M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

Size: px

Start display at page:

Download "M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75"

Julius Gilbert
5 years ago
Views:

1 M.Sc. (Previous) DEGREE EXAMINATION, MAY (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) Answer any Three of the following 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations with an example. 2) Explain in detail about different AVL rotation applied on unbalanced trees. 3) Construct a binary search tree for the data and perform the operations. i) delete node 27. ii) delete node 20. 4) Write Dijkstra s algorithm to find the shortest path. Illustrate the algorithm with an example. 5) Describe topological sort procedure and explain it with an example. Section - B (5 5 = 25) Answer any Five of the following 6) Explain insertion operation in double linked list. 7) For A = 2, B = 3, C = 4, D = 6 find the postfix value of the expression A + (B*C)/D. 8) Apply quick sort on the data elements: ) Write a C program to create and display a given single linked list. 10) Construct a max heap tree with the values

2 11) Explain bucket sort with suitable example. 12) Explain shortest path problem with an example. 13) Discuss about Euler and Hamiltonian circuits. 14) What is the concept of data structure? Section - C (5 1 = 5) Answer All questions 15) How do you represent double linked list? 16) What is Tower of Hanoi Problem? 17) Define Priority queue. 18) Define weighted binary tree.

3 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - II : OBJECT ORIENTED PROGRAMMING (DMCS 02) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three questions. 1) a) Explain the basic structure of C++ program. b) Explain about type casting in C ++. 2) a) Write a note on call-by-value and call-by-reference. b) Explain about jump statements. 3) Define constructor. Explain different types of constructors by giving demonstrate program for each. 4) Write a note on operator overloading. Write a program to demonstrate binary operator overloading. 5) a) Discuss about string manipulating functions. b) What is an exception? Explain how can you throw an exception. Section - B (5 5 = 25) Answer any Five of the following 6) What is an array? How can you pass an array to a function? 7) What is pointer? Write about void pointer? 8) Write a note on static function. 9) Discuss about class template. 10) Explain briefly about pure-virtual function. 11) Write about endl manipulator and flushing-buffer.

4 12) Explain how can you use get ( ) and put ( ) functions in files. 13) Discuss about command line arguments. Section - C (5 1 = 5) Answer All questions 14) What are user-defined data types? 15) Differentiate local and global variables. 16) Define friend function. 17) Define Polymorphism. 18) What are file pointers?

5 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - III : COMPUTER ORGANIZATION (DMCS 03) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three questions 1) State and explain any four addressing modes with examples for INTEL processors. 2) a) Draw timing diagram for memory write cycle of 8086 and list operations in each T state. b) Write note on MAX/MIN mode of ) a) Compare horizontal and vertical microinstruction representation. b) Explain the design of multiplier control unit using Delay Element Method. 4) a) Explain about microprogrammed control. b) Explain interrupt, indetail with types. c) Explain about super computer. 5) a) Write Booth s algorithm for restoring unsigned division and divide the following unsigned numbers and justify your answers. Dividend = 1000, Divisor = 11. b) Explain Von Neumann architecture with the help of a neat diagram. 6) What is subroutine call and return? Section - B (5 5 = 25) Answer any Five questions 7) Explain parallel processing in-detail. 8) Draw neat diagram of single bus organization of a CPU showing ALU, all types of registers and the data paths among them. 9) Explain the flow chart for floating point addition.

6 10) Explain PCI bus with a neat diagram. 11) Explain function level pipelining with diagram. 12) What are the techniques for performing I/O. 13) What is RAID, explain in brief. 14) What is SDRAM? Section - C (5 1 = 5) Answer All questions 15) What is RISC? 16) What is DMA? 17) What is Auxiliary Memory? 18) What is a flipflop?

7 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) COMPUTER SCIENCE Paper - IV : Discrete Mathematical Structures (DMCS 04) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) a) Verify whether the following statement is tautology on not. [7] {[(p q) r] ( p)} (q r) b) Show that S is a valid conclusion from the premises. [8] p q, q r, ~ (q r) and S P. 2) a) State all rules for logical inference. [8] b) Symbolize the following argument and check for its validity all doctors are collegue graduates some doctors are not golfers. Hence some golfers are not college graduates. [7] 3) a) State and explain Recursion Theorem. [8] b) Define power set of a set and show that the cardinality of the powerset of A. P (A) is 2n if cardinality of A is n. [7] 4) a) Show that the chromatic number of planar graph is no greater than 4. [7] b) Find the shortest path between A and F of the following weighted graph by using Dijkstra/s algorithm. [8] 5) a) Design Tunning Machine to compute n!. [7] b) Prove that Every Chain is a distributive Lattice. [8]

8 Section - B (5 5 = 25) Answer any Five of the following 6) Show that (p q) (p q) is a Tautology. without constructing truth table. 7) Let A be a set. Define P (A), the power set of A. Find P (A) when A = {1, 2, 3}. 8) Define Homogenious recurrence Relation. 9) Define finite machine with example. 10) Explain : a) Degree b) Biparite graph. c) Connected graph. d) Path. e) Cycle. 11) Show that AUB = (A ~ B)U(B ~A)U(A B). 12) Define order of the recurrence relation. 13) Define dual of a planar graph. 14) Define cut set. Section - C (5 1 = 5) Answer all questions 15) Define Poset. 16) What is monoid? 17) What is Karnough map? 18) What is biparite graph?

9 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - V : SOFTWARE ENGINEERING (DMCS 05) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following. 1) What is software? Discuss in detail various characteristics of software. 2) Explain the following process models a) Spiral model. b) RAD model. 3) Explain various design principles that enable the interface to reduce the users memory load. 4) What is an architectural style? Categorize different architectural styles and discuss them with the help of neat diagram. 5) Write the concept of integration testing. Discuss the top-down integration testing. 6) Discuss about software myths. Section - B (5 5 = 25) Answer any Five of the following 7) Write about metrics for software quality. 8) Explain the analysis principles. 9) Discuss the method of creating a control flow model. 10) Discuss about Cohesion and coupling. 11) Explain the architectural design process. 12) Explain different aspects of control structure testing. 13) Describe the art of debugging.

10 14) What are software engineering layers? Section - C (5 1 = 5) Answer All questions 15) What are size-oriented metrics? 16) What are software quality assurance activities? 17) What is the role of data dictionary? 18) What is regression testing?

11 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - VI : DISTRIBUTED OPERATING SYSTEM (DMCS 06) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following. 1) a) Define distributed operating system in detail and give the types of distributed operating system. (7) b) Explain about the different goals of distributed system. (8) 2) Explain in detail Protocol Layers and transfer Mode Networks. (15) 3) Explain in detail about deadlock in distributed systems. (15) 4) a) Discuss about threading Issues in detail. (8) b) Enumerate locking protocols in detail. (7) 5) a) Explain distributed file - system implementation in detail. (9) b) Explain client - server model. (6) Section - B (5 5 = 25) Answer any Five of the following 6) What are the design issues of the distributed systems? 7) What is Remote procedure call? Explain. 8) What is Mutual Exclusion? Explain in detail. 9) Explain about Election Algorithm. 10) What are logical clocks? Explain.

12 11) Define Thread. Give the types of thread with neat diagram. 12) Give the trends in distributed file systems. 13) Give the methods for recovery from Deadlock. 14) What is a protocol? Section - C (5 1 = 5) Answer All questions 15) Define Networks? 16) What is synchronization? Give the types. 17) What is Client - server Model? 18) What is Atomic transaction?

13 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - VII : DATA BASE MANAGEMENT SYSTEMS (DMCS 07) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following. 1) What is a data model? What are different data models? Briefly explain E-R model and relational model. 2) Explain the following: a) Aggregate function in SQL. b) Embedded SQL. 3) Discuss the normalization process using multivalued dependencies and join dependencies. 4) Discuss in detail the B+ tree index file organization. 5) Explain lock-based protocols for concurrency control. Section - B (5 5 = 25) Answer any Five of the following 6) Write about database users and database administrator. 7) Discuss about extended relational algebra operations. 8) Discuss about various clauses of SQL. 9) Write about security and authorization in SQL. 10) What is Buffer manager? Explain Buffer - Replacement policies. 11) Explain Boyce - codd normal form. 12) Explain conflict serializability and view serializability. 13) Explain about validation-based protocols.

14 14) What is the purpose of database system? Section - C (5 1 = 5) Answer All questions 15) What is view? 16) What is dynamic hashing? 17) What is decomposition? 18) What is transaction?

15 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - VIII : THEORY OF AUTOMATA AND FORMAL LANGUAGE (DMCS 08) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following. 1) State and prove the Myhill - Nerode theorem. 2) State and prove the complement of DCFL is a DCFL. 3) Explain about the methods for transporting Grammars. 4) Discuss about Target languages in detail. 5) Explain about syntax analysis method in detail. 6) Write a note on free languages. Section - B (5 5 = 25) Answer any Five of the following 7) Explain about Church s hypothesis. 8) Explain about the universal tunning machine in detail. 9) Explain about the context free grammar. 10) What is a counter machine? 11) Write a note on pushdown Automata. 12) Reduce the following grammar to GNF. S A O ; A OB; B AO B 1 13) What is code generation?

16 Section - C (5 1 = 5) Answer All questions 14) What is the significance of finite state machine? 15) What is regular set? 16) Define derivation tree. 17) Define DFCL and DPDA. 18) Define LBA.

17 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - IX : COMPUTER NETWORKS (DMCS 09) Time : 03 Hours Maximum Marks : 75 1) Explain the OSI model in detail. Section - A (3 15 = 45) Answer any Three questions 2) Discuss about HTTP, SMTP and FTP protocols in detail. 3) Explain about TCP and UDP in detail. 4) Explain IPV6 datagram format in detail. 5) a) Discuss about IEEE in detail. b) Write about point-to-point protocol. Section - B (5 5 = 25) Answer any Five questions 6) Write a short notes on packet switched networks. 7) Write about protocol layers. 8) Write about multiplexing and demultiplexing. 9) Discuss about the principles of reliable data transfer. 10) Discuss about the Network service models. 11) Write about the ARP. 12) Write about the services of datalink layer. 13) Discuss about the hierarchical routing.

18 Section - C (5 1 = 5) Answer all questions 14) What is internet? 15) Define Electronic-Mail. 16) What is ISP? 17) What is Routing? 18) What is a Switch and Bridge?

19 M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - X : DESIGN AND ANALYSIS OF ALGORITHMS (DMCS 10) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three questions 1) Write an algorithm to sort N numbers in ascending order using merge sort. 2) Write an algorithm for performing binary search for an element in any array. 3) What is Asymptotic Notation? Briefly explain how time complexity of an algorithm is derived at using a priori analysis. 4) Write and explain an algorithm to implement stack operations with an example. 5) What is minimum spanning tree? Write Prim s algorithm for finding minimum spanning tree. Section - B (5 5 = 25) Answer any Five questions 6) Explain all pairs shortest paths using dynamic programming. 7) Write BFS and DFS algorithms. Explain their working with suitable examples. 8) Write an algorithm of 8-queens problems using Back tracking. 9) Explain Branch and Bound Technique for travelling sales person problem with example. 10) Explain divide and conquer method briefly. 11) Explain Strassen s matrix multiplication. 12) Explain Job Sequencing with deedlines using greedy method. 13) Discuss about multistage graphs using dynamic programming.

20 Section - C (5 1 = 5) Answer all questions 14) Explain about the various tree traversel techniques. 15) Describe graph coloring problem and its time complexity. 16) Discuss about the sum of subsets. 17) Explain 0/1 Knapsack problem using Branch and Bound concept. 18) Explain about biconnected components.

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