M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

Size: px

Start display at page:

Download "M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I"

Kristopher Crawford
5 years ago
Views:

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.

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