M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I
|
|
- Kristopher Crawford
- 5 years ago
- Views:
Transcription
1 Paper I DATA STRUCTURES (DMCS 01) 1. Explain in detail about the overview of Data structures. 2. Explain circular linked list and double-linked list. 3. Explain CPU scheduling in Multiprogramming Environment. 4. Explain the operations on B-trees. 5. (a) Explain matrix representation using graphs. Explain Euler s and Hamiltonian circuits. 6. Write a routine for adding an item in a double linked list. 7. How do you represent a Queue using linked list? I 8. Explain Heshing techniques. 9. Write a routine to merge two Binary Trees. 10. Explain Threaded Binary Tree. 11. Explain Quicksort with an example. 12. Explain shortest path problem. 13. Explain Sparse Matrix Manipulation. 14. (a) Define dequeue. What is Height Balanced Binary tree? What are the operations performed on stack? Define Forest. Define minimum spanning tree.
2 Paper II OBJECT ORIENTED PROGRAMMING (DMCS 02) 1. Explain with suitable example about various flow control statements in C Define constructor. Explain in detail about different types of constructors. 3. What is operator overloading? Write a program to demonstrate ( ) operator overloading. 4. Write about streams and describe stream classes hierarchy. 5. Briefly explain about try and catch blocks. How can you handle multiple catch blocks? 6. Discuss about different casting operators in C Write a note on pointers and arrays. I 8. Explain about call-by-value and call-by-reference. 9. Explain about information hiding. 10. Write about function template. 11. Define hierarchical inheritance and give an example. 12. Explain briefly about writing data to a file and reading a file. 13. Discuss about pure-virtual function. 14. (a) Define void pointer. What is in-line function? Define friend class. Define polymorphism. What is template?
3 Paper III COMPUTER ORGANIZATION (DMCS 03) 1. (a) Explain with suitable sketch decoder with 3 inputs. Explain the programmable logic array. 2. (a) Explain the types of registers with suitable diagrams. Simplify the following expression A Y( W X Y Z ) Z. 3. Explain : (a) Bus and memory transfer Instruction cycle Input output interface. 4. (a) Explain the design issues and data transfer in DMA. Explain the design and implementation of hardwired control unit. 5. (a) Explain the synchronous and asynchronous date transfer. Explain auxiliary memory and associative memory. 6. What is register transfer language? 7. What is timing and control? 8. What are the types of ROM? 9. What is address sequencing? 10. What are the floating point arithmetic operations? 11. What is instruction format and explain the types of IF? 12. Explain the physical characteristics of a magnetic disk. 13. Explain the riple counter with diagram. 14. (a) What is adder? What is a binary counter? What are the computer instructions? What is decimal arithmetic unit? What are the modes of transfer?
4 Paper IV DISCRETE MATHEMATICAL STRUCTURES (DMCS 04) 1. (a) Construct truth table of the formula P Q R P Q P R Obtain the principal conjunctive normal form of P Q P R 2. (a) Show that R. S is tautologically implied by P Q P R Q S Show that xp( x) Q( x) x P( x) ( x) Q( x). n n i i. i 1 i 1 3. (a) Show that B A B A. Show that the function f( x, y) x y is primitive recursive. 4. (a) For any commutative monoid ( M, ), show that the set of idempotent elements of M forms a submonoid. Show that every distributive lattice is modular, but not conversely. 5. (a) If G is a connected plane graph, then show that V E R 2. Prove that every simple planar graph is 5-colorable. 6. Show that P Q R Q R P R R 7. Show that R P Q P M and M.. is a valid conclusion from the premises P Q, Q R, I 8. Show that A B A B B ~ A A B ~. 9. Find the POLISH notation of the infix expression a b c d / e h. 10. Show that a b) a b. ( and a b a b 11. In any Boolean algebra, show that( a b)( a c) ac ab ac ab bc. 12. Define isomorphism of graphs. Give two graphs which are isomorphic. 13. Find the chromatic number of the wheel graph. 14. (a) Define free and bound variable. What is Hasse diagram? Define partially ordered set. Define bipartite graph. Define cut set.
5 Paper V SOFTWARE ENGINEERING (DMCS 04) 1. Discuss the following process models: (a) RAD Prototyping. 2. Explain how do you create (a) Data flow model Control flow model. 3. What are golden rules of interface design? Elaborate each of them. 4. Explain briefly about different software quality attributes. 5. Explain Block-Box testing in detail. 6. Discuss about various characteristics of software. 7. Briefly explain about the metrics for software quality. I 8. Explain the software quality assurance activities. 9. What are the elements of analysis model? Explain them. 10. Explain about cohesion and coupling. 11. Explain architectural design using context diagram write about different parts used in the diagrams. 12. Explain the interface design evaluation cycle with the help of a diagram. 13. Discuss various debugging strategies. 14. (a) What is software myth? What are the phases of waterfall model? What is modularity? What is validation? What is performance testing?
6 Paper VI DISTRIBUTED OPERATING SYSTEM (DMCS 06) 1. Explain Hardware and Software concepts. 2. (a) Explain Layered protocols. What do you mean by Remote Procedure Cell? 3. Explain Deadlocks in Distributed Systems. 4. (a) Explain Scheduling in Distributed Systems. Explain processor allocation. 5. Explain Distributed File System Implementation. 6. Explain the goals of Distributed Systems. 7. Explain Asynchronous Transfer Mode Networks. 8. Explain Election algorithms. 9. Explain clock synchronization. 10. Explain client-server model. I 11. Explain page-based distributed shared memory. 12. Explain fault tolerance. 13. What is the difference between a distributed operating system and Network operating systems? 14. (a) Define Distributed System. What is the significance of Threads? Define Shared Memory. What do you mean by Mutual exclusion? What is system model?
7 Paper VII DATA BASE MANAGEMENT SYSTEMS (DMCS 07) 1. (a) Explain database languages, database users and administrators. Explain constraints and keys in entity-relationship model. 2. Explain the overview of SQL. 3. (a) Explain B + tree index files. Explain function dependencies. 4. Explain the following: (a) Concurrent executions. Serializability Recoverability. 5. (a) Explain timestamp-based protocols. Explain deadlock handling. 6. Explain the design of an E-R database scheme. 7. Explain relational model. I 8. Explain assertions and triggers. 9. Explain file organisation. 10. Compare static hashing and dynamic hashing. 11. Explain Boyce-Codd normal form. 12. How do you test for serializability? 13. Explain multiple granularity. 14. (a) Define database management system. Define view. What do you mean by encryption? What is data dictionary? Define normal form.
8 (DMCS 08) M.Sc. (Computer Science) I Year Assignments for May Paper VIII THEORY OF AUTOMATA AND FORMAL LANGUAGE 1. Explain Moore machine and Mealy machine. Let M Q,,,, q 1, 0 be a Mealy machine, and then prove that there is a Moore machine M 2 equivalent to M State and prove the Myhill-Nerode theorem. 3. Convert to Greibach normal form, the grammar A A, A, a, b, consists of the following: A A A A A A3 A1 b A A a. 2 G, A where P P, n n n 4. Design a turning machine M to recognise the language n 1 5. Prove that the complement of a DCFL is a DCFL. 6. Construct NDFSA accepting ab, ba and use it to find DFSA accepting the same set. 7. Show that the class of regular sets is closed under subtraction. n n 8. Show that L a b / n 1 I is not a regular language. 9. Reduce the following grammar to GNF: S A A 0B; B A B 1. 0; Construct PDA equivalent to the following grammar: S aaa, A as bs / a. n n 11. Design a Turing machine to recognize the language L0 1 n Explain about Church s hypothesis. 13. Discuss about the universal turning machine. 14. (a) Define finite state machine... 1 Define DFA. Define regular grammar. What is CFL? What is DPDA?
9 Paper IX COMPUTER NETWORKS (DMCS 09) 1. Discuss the layers present in OSI model. 2. (a) Write short note on transmission media. Explain how CRC encoder works. 3. (a) Discuss briefly about the DNS in the Internet. Explain the network address translation. 4. (a) Compare OSI and TCP/IP reference models. Discuss on the communication options in the DCS. 5. Explain different error detection and correction techniques. 6. Discuss the wireless LAN MAC sublayers. 7. Discuss about high speed network. I 8. Explain low in packet-switched networks. 9. Discuss NAPs. 10. Discuss the file transfer protocol. 11. Discuss about UDP. 12. Discuss the properties of LAN. 13. Explain the routing principles. 14. (a) Define a burst error. Define SMTTP and HTTP. Name the layers of OSI model. What are gate ways? State the need of an Ethernet in DCS.
10 Paper X DESIGN AND ANALYSIS OF ALGORITHMS (DMCS 10) 1. (a) Write an algorithm to insert an element x from a binary search tree. What is its time complexity? Explain the significance of 0,, in performance of analysis of algorithms. 2. (a) Apply merge sort algorithm on the array of element a 1 : ,285, 179, 652, 351, 423, 861, 254, 450, 520. Write the Prim s minimum cost spanning tree algorithm. 3. (a) Write an algorithm for 0/1 Knapsack problem. Show that algorithm BFS visits all vertices reachable from v. 4. Derive sum of subsets problem. Explain a back tracking approach for the sum of subsets problem using the state space tree corresponding to the fixed tuple size formulation. 5. (a) Write the FIFO branch-and-bound algorithm for job sequencing problem. Discuss the travelling sales person problem. 6. Discuss about the analysis of algorithm. 7. Write the Kruskal s algorithm. I 8. Write an algorithm for searching a binary search tree with an example. 9. Write the Bellman and Ford algorithm to compute shortest paths. 10. Generate the sets, 0 i 4 2, 5, 8, 1. S i, when, w w w w = (10, 15, 6, 9) and p, p, p p 1 2, 11. What is biconnected graph? Write an algorithm for DFS traversal. 12. Discuss the 8-queens problem. 13. Explain the graph coloring problem. 14. (a) Define heap property , 4 What is space complexity? What is dictionary? What is multistage graph? What is least cost search?
2) Explain in detail about different AVL rotation applied on unbalanced trees.
(DMCS 01) ASSIGNMENT - 1, MAY-2014. PAPER- I : DATA STRUCTURES 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75
M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES (DMCS 01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45)
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES
(DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer
More informationTotal No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.
(DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)
More informationASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS
ASSIGNMENT - 1 Data Structures (DMCS01) Q1) a) Write a sub-routine to implement PUSH ( ) and POP ( ) operations using linked list. b) Explain about open hashing and closed hashing. Q2) How to create double
More informationM.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.
Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75
M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 First Year Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY (DMSIT01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer
More informationB.Tech in COMPUTER SCIENCE & ENGINEERING
B.Tech in COMPUTER SCIENCE & ENGINEERING Paper - 1 S.No. Unit/Topic NPTEL Link 1. DIGITAL SYSTEM DESIGN Binary Systems: Introduction to Number Systems and conversions. Arithmetic with number systems, Signed
More information1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.
(DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?
More informationCOURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05
COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular
More informationM.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75
M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the
More information(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:
(DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER - 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - I : Data structures Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory
More information(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY
(DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures
More information1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems?
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1. a) Discuss primitive recursive functions with an example? 15M b) Statements and applications of Euler s and Fermat s Theorems? 15M 2. a) Define DFA and NFA
More information1) What is information system? Describe the basic concepts of information systems.
(DMSIT 01) ASSIGNMENT - 1, DEC - 2018. PAPER- I : BASICS OF 1) What is information system? Describe the basic concepts of information systems. 2) Discuss about input and output technologies of computer
More information(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY
(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section- A Answer any Three of the following (3 15=45) 1) What is the
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More information1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?
(DMCA 101) ASSIGNMENT - 1, DEC - 2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with
More informationINFORMATION TECHNOLOGY
[DMSIT 01] M.Sc. (Previous) DEGREE EXAMINATION, DEC 2013 First Year INFORMATION TECHNOLOGY Paper I BASICS OF INFORMATION TECHNOLOGY Time : 3 hours Max. Marks : 75 Section A (3x15 = 45) Answer any THREE
More informationM.C.A. FIRST YEAR DEGREE
(DMCA 101) ASSIGNMENT - 1, DEC - 2018. PAPER- I : INFORMATION TECHNOLOGY 1) What is MIS? Explain role of MIS in an organisation. 2) Explain in detail about input and output technologies. 3) Discuss about
More informationM.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75
(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the
More informationMATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE
MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE A Modern Approach to Discrete Mathematics SIXTH EDITION Judith L. Gersting University of Hawaii at Hilo W. H. Freeman and Company New York Preface Note to the
More information(DMCA201) ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 Second Year SOFTWARE ENGINEERING. Maximum Marks 30 Answer all questions
ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 SOFTWARE ENGINEERING Q1) Explain about software process frame work in detail. (DMCA201) Q2) Explain how both waterfall model and prototyping model can be
More information5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register
General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)
More informationAbout the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design
Preface About the Author Dependency Chart xiii xix xxi Chapter 1: Logic and Sets 1 1.1: Logical Operators: Statements and Truth Values, Negations, Conjunctions, and Disjunctions, Truth Tables, Conditional
More informationASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology
ASSIGNMENT-1 () Basics of Information Technology (DMSIT01) Q1) Discuss in detail about IT support at different organizational levels. Q2) Explain about hierarchy of computers. Q3) Discuss different categories
More information(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY
1 (DMCA 101) PAPER - I - INFORMATION TECHNOLOGY 1. What is a computer based information system? Discuss the general technological trends for information technology. 2. (a) Describe the four main types
More informationCS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( )
Syllabus for M.Sc. Computer Science Programme Semester I External/ Internal CS 101 Advanced Computer System Architecture 100 ( 75 + 25 ) CS 102 Operating System 100 ( 75 + 25 ) CS 103 Mathematical Foundation
More information«Computer Science» Requirements for applicants by Innopolis University
«Computer Science» Requirements for applicants by Innopolis University Contents Architecture and Organization... 2 Digital Logic and Digital Systems... 2 Machine Level Representation of Data... 2 Assembly
More informationOBJECT ORIENTED DATA STRUCTURE & ALGORITHMS
OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers
More informationContents. 1 Introduction. 2 Searching and Traversal Techniques. Preface... (vii) Acknowledgements... (ix)
Contents Preface... (vii) Acknowledgements... (ix) 1 Introduction 1.1 Algorithm 1 1.2 Life Cycle of Design and Analysis of Algorithm 2 1.3 Pseudo-Code for Expressing Algorithms 5 1.4 Recursive Algorithms
More informationMadhya Pradesh Bhoj (Open) University, Bhopal
Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation?
More informationThomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6
More information(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar
Code No: R05310501 Set No. 1 III B.Tech I Semester Regular Examinations, November 2008 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE
More informationADMINISTRATIVE MANAGEMENT COLLEGE
First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and
More informationSYLLABUS. M.Sc. I.T. Ist Year
SYLLABUS M.Sc. I.T. Ist Year CONTENT M.Sc.IT Paper I Ist Year Computer Organization & Architecture Paper II Data Communications and Computer Networking Paper III Programming in C and Data Structure Paper
More informationSyllabus for Computer Science General Part I
Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions
More informationASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.
ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 SOFTWARE ENGINEERING (DMCA201) Q1) Explain Spiral model with suitable example. Also explain how it differs from Software Prototyping model. Q2) a) Draw
More informationCS/IT DIGITAL LOGIC DESIGN
CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) Flip-Flop Answer
More informationInjntu.com Injntu.com Injntu.com R16
1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder
More informationTable of Contents. Chapter 1: Introduction to Data Structures... 1
Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction
More informationAnswer any Five Questions. All questions carry equal marks.
PART I, PAPER I (Problem Solving and Programming) 1. What do you understand by function prototype? Differentiate between call by value and call by reference methods of parameters passing to a function
More informationIntroduction to Algorithms Third Edition
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction
More information2c. Content of Computer systems (Component 01)
c. Content of Computer systems (Component 01) This component will introduce learners to the internal workings of the Central Processing Unit (CPU), the exchange of data and will also look at software development,
More informationEnd-Term Examination Second Semester [MCA] MAY-JUNE 2006
(Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.
More informationSUBJECT: INFORMATION TECHNOLOGY
NOTICE DATED: 02.02.2017 The syllabus for conducting Written Test [Multiple Choice Questions (MCQs)] in Information Technology for the posts of Lecturer (10+2) in School Education Department is notified
More informationObject Oriented Programming
Program Structure for Master of Computer Application (MCA) Mumbai University (With Effect from 2012-2013) Semester I Object Oriented Programming 1 C++ Fundamentals: Data types, Operators, Preprocessor
More informationD.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1.
D.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1. DESIGN AND ANALYSIS OF ALGORITHM UNIT- I SECTION-A 2 MARKS 1. Define an algorithm? 2. Specify the criteria of algorithm? 3. What is Computational Procedure?
More informationCOMPUTER MCQs. 1. DOS floppy disk does not have 1) a boot record 2) a file allocation table 3) a root directory
COMPUTER MCQs 1. DOS floppy disk does not have 1) a boot record 2) a file allocation table 3) a root directory 4)virtual memory 5) None of the above 2. The component is used by the data analyst to create
More information4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...
Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...
More informationTotal No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year INFORMATION TECHNOLOGY.
(DMSIT01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year INFORMATION TECHNOLOGY Basics of IT Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15
More informationPreface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS
Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...
More informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : II / III Section : CSE - 1 & 2 Subject Code : CS 6301 Subject Name : Programming
More informationOverview of Data Structures, Algorithm Analysis
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Advanced Data structures and Algorithms (16CS5804) Year & Sem: M.Tech
More informationMadhya Pradesh Bhoj (Open) University, Bhopal
Subject- Optimization Techniques Maximum Marks: 20 Q.1 Explain the concept, scope and tools of O.R. Q.2 Explain the Graphical method for solving Linear Programming Problem. Q.3 Discuss the Two phase method
More informationSyllabi of the Comprehensive Examination in Computer Science
Syllabi of the Comprehensive Examination in Computer Science The material of the comprehensive examination is drawn mostly from the undergraduate curriculum at Kuwait University and is updated to reflect
More informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the
More informationComputer Science Curriculum Content, KS5
Computer Science Curriculum Content, KS5 HT1 HT2 HT3 HT4 HT5 HT6 Data Structure Data Representation Introduction to the chosen Single- and multi-dimensional arrays (or equivalent) Number systems Operations
More informationDYNAMIC MEMORY ALLOCATION AND DEALLOCATION
COURSE TITLE DATA STRUCTURE DETAILED SYLLABUS SR.NO NAME OF CHAPTERS & DETAILS HOURS ALLOTTED 1 USER DEFINED DATATYPE /STRUCTURE About structure Defining structure Accessing structure element Array of
More informationHonorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore
COMPUTER ORGANIZATION AND ARCHITECTURE V. Rajaraman Honorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore T. Radhakrishnan Professor of Computer Science
More informationCS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 25: Review and Open Problems Course Overview Programming Concepts Object-Oriented Programming Interfaces
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More informationSeth Jai Parkash Polytechnic, Damla
Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018
More information(DCS/DIT311) Answer question no.1 compulsory (15 1 = 15) Answer ONE question for each unit (4 15 = 60) 1) Write short notes on :
(DCS/DIT311) B.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Third Year Third Semester) Computer Science & IT Paper - I : OPERATING SYSTEMS Time : 3 Hours Maximum Marks : 75 Answer question
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More information(3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary.
(3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary. Q.1. a) What are the major activities of an Operating system with regard
More informationCS6402 DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK UNIT I
CS6402 DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK UNIT I PART A(2MARKS) 1. What is an algorithm? 2. What is meant by open hashing? 3. Define Ω-notation 4.Define order of an algorithm. 5. Define O-notation
More informationJAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:
JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And
More informationIBPS SO Examination 2013 IT Officer Professional Knowledge Question Paper
IBPS SO Examination 2013 IT Officer Professional Knowledge Question Paper 1. The tracks on a disk which can be accused without repositioning the R/W heads is (A) Surface (B) Cylinder (C) Cluster 2. Which
More informationSilver Oak Engineering College and technology Information Technology Department
Silver Oak Engineering College and technology Information Technology Department Mid Semester 2 Syllabus 4th Semester IT Subject Code Subject Name Syllabus 2140709 COMPUTER NETWORKS Unit 3- Transport Layer
More informationJAIPUR NATIONAL UNIVERSITY, JAIPUR
Paper Code: MCA - 101 Paper Title: Fundamental of Computer Master of Computer Application (MCA) (i) Differentiate between data and information. Which is more useful to the people and why? (ii) Explain
More informationSyllabus for Computer Science
Syllabus for Computer Science PAPER I UNIT 1 :Mathematics and Graph Theory Set theory Notations, set operations, power set, set identities, Relations and ordering Relations, Properties of Binary relation,
More informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
More informationR13 SET - 1. ''' '' ''' ' blog: anilkumarprathipati.wordpress.com. Code No: RT32054
R13 SET - 1 III B. Tech II Semester Regular Examinations, April - 2016 1 a) Distinguish between Algorithm and Psuedocode. [3M] b) Describe the Algorithm Analysis of Binary Search. [4M] c) State the Job
More informationDATA STRUCTURES THROUGH C++
II Year I Semester DATA STRUCTURES THROUGH C++ L T P C 4 0 0 3 OBJECTIVES: To be familiar with basic techniques of object oriented principles and exception handling using C++ To be familiar with the concepts
More informationPart I Basic Concepts 1
Introduction xiii Part I Basic Concepts 1 Chapter 1 Integer Arithmetic 3 1.1 Example Program 3 1.2 Computer Program 4 1.3 Documentation 5 1.4 Input 6 1.5 Assignment Statement 7 1.5.1 Basics of assignment
More informationTopic wise Tests. Number Systems,Boolean Expression, Boolean Laws & K-maps
Test No Topic code Topic CSIT-01 CSIT-02 CSIT-03 CSIT-04 GDL 1 (Digital Logic) GDL 2 (Digital Logic) GCO 1 (Computer Organization) GCO 2 (Computer Organization) Number Systems,Boolean Expression, Boolean
More informationHIGHER SECONDARY EDUCATION CATEGORY NO. 111/2010 & 69/2010 (NCA- LC)
FURTHER DETAILS REGARDING MAIN TOPICS OF PROGRAMME NO.09/2012(SEPTEMBER) ITEM 11 & 12 HIGHER SECONDARY SCHOOL TEACHER COMPUTER SCIENCE / COMPUTER APPLICATION, HIGHER SECONDARY SCHOOL TEACHER COMPUTER SCIENCE
More informationMadhya Pradesh Bhoj (Open) University, Bhopal
Subject-I- Data Structure through C Maximum Marks: 30 funz s'k& Q3 Q4 Q5 Q3 Describe the methods of parallel processing. What do you mean by Instruction? Describe the computer instructions in brief. How
More informationComputer Science Engineering Sample Papers
See fro more Material www.computetech-dovari.blogspot.com Computer Science Engineering Sample Papers 1 The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose
More informationWITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632
DATA STRUCTURES WITH C+ + William Ford University of the Pacific William Topp University of the Pacific Prentice Hall, Englewood Cliffs, New Jersey 07632 CONTENTS Preface xvii CHAPTER 1 INTRODUCTION 1
More informationSri Satya Sai University of Technology & Medical Sciences, Sehore (M.P.)
MCA - 301 COMPUTER ORIENTED OPTIMISATION MODELS UNIT I Linear Programming, Applications in linear programming, Graphical method for solving LP s, Mathematical Model, Assumptions of Linear Programming,simplex
More informationPART A (22 Marks) 2. a) Briefly write about r's complement and (r-1)'s complement. [8] b) Explain any two ways of adding decimal numbers.
Set No. 1 IV B.Tech I Semester Supplementary Examinations, March - 2017 COMPUTER ARCHITECTURE & ORGANIZATION (Common to Electronics & Communication Engineering and Electronics & Time: 3 hours Max. Marks:
More informationLearning objectives. Computer principles The characteristics of contemporary processors, input, output and storage devices
Learning objectives Computer principles 1.1. The characteristics of contemporary processors, input, output and storage devices Components of a computer and their uses 1.1.1 Structure and function of the
More informationCHETTINAD COLLEGE OF ENGINEERING AND TECHNOLOGY COMPUTER ARCHITECURE- III YEAR EEE-6 TH SEMESTER 16 MARKS QUESTION BANK UNIT-1
CHETTINAD COLLEGE OF ENGINEERING AND TECHNOLOGY COMPUTER ARCHITECURE- III YEAR EEE-6 TH SEMESTER 16 MARKS QUESTION BANK UNIT-1 Data representation: (CHAPTER-3) 1. Discuss in brief about Data types, (8marks)
More informationLecture 1. Introduction
Lecture 1 Introduction 1 Lecture Contents 1. What is an algorithm? 2. Fundamentals of Algorithmic Problem Solving 3. Important Problem Types 4. Fundamental Data Structures 2 1. What is an Algorithm? Algorithm
More information1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \
BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,
More informationM.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141
Time : 10 Minutes M.Marks : 10 M.Sc. (CS) Second Semester Examination (Year 2016) Data Structures & Algorithms Subject Code: MSC-201 Paper Code: TMT-141 Section A (Objective Type Questions) Roll No. Enrollment
More informationSECTION A. (i) The Boolean function in sum of products form where K-map is given below (figure) is:
SECTION A 1. Fill in the blanks: (i) The Boolean function in sum of products form where K-map is given below (figure) is: C B 0 1 0 1 0 1 A A (ii) Consider a 3-bit error detection and 1-bit error correction
More informationPROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a
More informationINFORMATION TECHNOLOGY COURSE OBJECTIVE AND OUTCOME
INFORMATION TECHNOLOGY COURSE OBJECTIVE AND OUTCOME CO-1 Programming fundamental using C The purpose of this course is to introduce to students to the field of programming using C language. The students
More informationTime : 03 Hours Maximum Marks : 75
(DMSIT 01) Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY Answer any Three of the following 1) Define IT. Enumerate various IT trends and their benefits to the organizations. 2) Bring
More informationBorland 105, 278, 361, 1135 Bounded array Branch instruction 7 break statement 170 BTree 873 Building a project 117 Built in data types 126
INDEX = (assignment operator) 130, 816 = 0 (as function definition) 827 == (equality test operator) 146! (logical NOT operator) 159!= (inequality test operator) 146 #define 140, 158 #include 100, 112,
More informationCOURSE OUTCOMES OF M.Sc(IT)
COURSE OUTCOMES OF M.Sc(IT) Sr. No Subject Code Subject Name Sem-I CO Status Course Outcomes 1. A304101 PROGRAMMING USING C 2. A304102 FUNDAMENTALS OF COMPUTER & INFORMATION TECHNOLOGIES CO1 CO2 Understands
More informationI BSc(Computer Science)[ ] Semester - II Allied:DISCRETE MATHEMATICS - 207D Multiple Choice Questions.
1 of 23 1/20/2018, 2:35 PM Dr.G.R.Damodaran College of Science (Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Reaccredited at the 'A' Grade Level by the NAAC and ISO 9001:2008
More informationB.Sc II Year Computer Science (Optional)
Swami Ramanand Teerth Marathwad University, Nanded B.Sc II Year Computer Science (Optional) (Semester Pattern) ( W.E.F. June 2010) Paper No VI VII Paper Title Digital Electronics & 8085 Microprocessor
More informationReference Sheet for CO142.2 Discrete Mathematics II
Reference Sheet for CO14. Discrete Mathematics II Spring 017 1 Graphs Defintions 1. Graph: set of N nodes and A arcs such that each a A is associated with an unordered pair of nodes.. Simple graph: no
More informationCLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION
CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the
More informationEND-TERM EXAMINATION
(Please Write your Exam Roll No. immediately) Exam. Roll No... END-TERM EXAMINATION Paper Code : MCA-205 DECEMBER 2006 Subject: Design and analysis of algorithm Time: 3 Hours Maximum Marks: 60 Note: Attempt
More information