(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:

Size: px

Start display at page:

Download "(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:"

Beatrice Bell
5 years ago
Views:

1 (DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER (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 (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False: F (n) = 30n 2 2 n + 6n2 n + 8n 2 =O(2 n ). b) How are recursive programs are analyzed? c) What are the demerits of linear stack? d) What is the time complexity of Merge sort? e) How a selection tree useful in a k-way Merge? UNIT I 2) a) Write a recursive program to obtain the n th order Fibonacci sequence number. b) State all possible disadvantages of linear queues. 3) a) Show that for a non-empty binary tree T if n 0 is the number of leaf nodes, n 2 the number of nodes Degree 2 then n 0 = n b) Explain the possible applications of AVL trees. UNIT II 4) What is searching? Explain all possible search techniques. 5) a) Trace the passes of insertion sort on the following lists: i) {H,K,M,N,P}, and ii) {P,N,M,K,H}

2 b) Undertake non- recursive Merge sort for the list L = {78,78,78,1} and check for the stability of the sort? What is its time complexity? UNIT III 6) Explain all the external sorting techniques with suitable examples. 7) Define file. Explain the advantages and disadvantages of files. UNIT IV 8) Explain the following: i) BFS, and ii) DFS 9) Define minimal spanning tree. Choose your own example and explain one algorithm of it.

3 (DMTCS 02) M.Tech. DEGREE EXAMINATION, DECEMBER (Examination at the end of First Year) COMPUTER SCIENCE Paper - II : Discrete Mathematical Structures Time : 03 Hours Maximum Marks 75 Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) Write the minimal set of connectives. b) State all the normal forms. c) Define Hasse diagram. d) Name the basic principles of counting. e) State the principle of Inclusion and Exclusion. f) Define planer graph. g) What is chromatic number? h) Define a tree. i) What is a Euler path? j) List the properties of a Lattice. k) What is a partial order? l) What is a open walk? m) Define logic. n) Define set. o) State automatic theorem of proving.

4 UNIT I 2) a) State and explain the rules that can generate a well formed formula. b) Obtain the product of sums canonical forms of the following formulas: ( P Q R) ( P Q R) ( P Q R). 3) a) What is a relation? Explain its properties. b) Show that R S tautologically follows (P Q) (P R) (P S). UNIT II 4) a) In how many ways can 23 different books be given to 5 students so that 2 of the students will have 4 books each and the other 3 will have 5books each. b) Using Multinomial theorem, expand (2x-3y+4z) 3. 5) a) What is a combination? Give an example. b) A survey of 500 television viewers of a sports channel produced the following information: 285 watch cricket, 195 watch hockey, and 115 watch football, 45 watch cricket and football, 70 watch cricket and hockey, 50 watch hockey and football and 50 do not watch any of the three kinds of games. i) How many of the viewers in the survey watch all three kinds of games? ii) How many viewers watch exactly one of the sports? UNIT III 6) a) Verify the following relation R on X={1,2,3,4} is equivalence relation or not. Explain R={(1,1), (1,2), (2,1), (2,2), (2,3), (3,3), (3,4), (3,2), (2,4), (4,4)}. b) Draw the Hasse diagram for X= {2,3,6,24,36,48} and relation = be such that x = y, if x divides y. 7) Define equivalence relation. State its properties. Give examples separately.

5 UNIT IV 8) a) What is circuit rank? Give an example. b) Find the chromatic number of the following: i) Complete graph K n and ii) Null graph. 9) a) Is there a graph with even number of vertices and odd number edges that contains an Euler circuit? b) Show that a connected graph with exactly two vertices of odd degree has an Euler trail.

6 (DMTCS 03) M.Tech. DEGREE EXAMINATION, DECEMBER (Examination at the end of First Year) COMPUTER SCIENCE Paper - III : Computer Architecture And Organization Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) Differentiate Computer Organization and Architecture. b) A digital computer has a common bus system for 16 registers of 32 bits each. This is constructed with the multiplexers? i) How many selection inputs are there in each multiplexers? ii) How many multiplexers are there in bus? c) Mention the different phases of instruction cycle of basic computer? d) Define RISC architecture? e) The content of 4- bit register is initially The register is shifted six times to the right with serial input being What is the content of each register after each shift? f) What is normalization of floating point number? g) Define the following terms. i) Micro instruction. ii) Control Memory. h) What is vector processing? i) Define cache.

7 j) Give an example of virtual memory. k) Define loosely coupled multiprocessors. l) Give an example of control memory. m) What is vector processing? n) Give an example of pipeline technique. o) What is reverse polish notation? UNIT I 2) Explain three state bus buffer with a diagram in detail? 3) Discuss the applications of logic micro- operations? UNIT II 4) With an example, explain the addressing modes of CPU? 5) Describe about four segment instruction pipeline? UNIT III 6) Explain the general structure of micro programmed control unit? 7) Write a short note on: i) Parallelism in microinstructions. ii) Microinstruction addressing. UNIT IV 8) What is memory hierarchy? Explain the cache mapping techniques in detail? 9) What is DMA? Explain UART?

8 (DMTCS 04) M.Tech. DEGREE EXAMINATION, DECEMBER (Examination at the end of First Year) COMPUTER SCIENCE Paper - IV : Operating Systems Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) What are the resources of virtual computer? b) What are the advantages of virtual izing a hardware resource? c) List the different types of processor modes? d) What happens when an interrupt occurs? e) Difference between process and a program? f) Difference between message queue and pipe buffer? g) What are steps in software design process? h) List two advantages of threads. i) What is the basic idea of mutual exclusion IPC pattern? j) What is a semaphore? k) What are the three entities & two lines involved in indirection? l) What is external fragmentation? m) List the operations on a file. n) List any two disk scheduling algorithms. o) What are ways you can name an object?

9 UNIT I 2) a) Why can t you change the control registers in user mode. b) Give the computation that shows that the disk controller can access a disk of up to 4GB. 3) a) Explain inter process communication in detail. b) Write the motivation, consequences and related design techniques of decomposition patterns. UNIT II 4) Explain in detail about Multiprocessor OS. 5) a) Difference between process and a thread. b) Write the consequences of using state machine. UNIT III 6) a) Difference between linking and relocation. b) Difference between paging and segmentation. 7) Find the number of page faults occur in the following reference string using Optimal and LRU page replacement algorithms. Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. UNIT IV 8) a) What is the purpose of frame buffer? b) Contrast seek time and latency time. c) Write short note on FCFS disk scheduling algorithm.

10 9) Write short note on: a) File system objects & operations. b) File system Mounting.

11 (DMTCS 05) M.Tech. DEGREE EXAMINATION, DECEMBER 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - V:Automata Theory and Formal Languages Time : 3 Hours Maximum Marks: 75 Answer Question No.1 is compulsory (15) Answer one question from each unit (4 15 = 60) 1) a) Define a language over a set. b) What is the difference between DFA and NF? c) What do you mean by - closure? d) Define regular expression and give one example. e) Is (r* +s*)* = (s*r*)*. f) List out the applications of finite automata. g) Define PDA. h) Write different forms of CNFs. i) Why pumping lemma is important? j) Enumerate the differences between PDA and TM. k) Is TM recursively enumerable? l) Discuss Non deterministic TM. m) How a TM accepts a language? n) Why computable functions are needed in the context of TM? o) Define null state.

12 UNIT I 2) a) Design a DFA to accept a language where L = { w/w has both an even number of 0 s and an even number of 1 s} b) Construct an NFA to equivalent to the following RE 10+ (0+11) 0*1. 3) a) Construct a transition system which can accept strings over the alphabet a,b,---- containing either cat or rat. b) Explain all the properties regular languages. UNIT - II 4) a) Design a PDA for recognizing the language of palindromes over the alphabet {0,1}. Draw the computations tree showing all possible for the strings and b) Explain the procedure for converting a PDA which accepts a language L by final state into a PDA which accepts the L by empty stack. 5) a) Distinguish between DPDA and NPDA. b) When do we say that a PDA is non deterministic? Design a PDA for recognizing the language of palindromes over the input alphabet {a,b}. UNIT - III 6) a) Design a TM for recognizing the language of palindromes over the input alphabet {a,b}. Show the moves of the TM for the string abbbba. b) What is instantaneous description of a TM? Briefly explain. 7) a) Define recursively enumerable languages and recursive languages. Prove that the union of two recursive languages is also recusive. b) Design a TM for computing the square of a given positive integer. Show the moves of the TM for a value of 2.

13 UNIT-IV 8) a) What is universal TM? Explain in detail. b) Give an example for undecidability. 9) Discuss the Chomsky Hierarchy.

14 (DMTCS 06) M.Tech. DEGREE EXAMINATION, DECEMBER 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper VI : Database Management Systems Time : 3 Hours Maximum Marks: 75 Answer Question No.1 is compulsory (15) Answer one question from each unit (4 15 = 60) 1) a) What are the responsibilities of DBA? b) What is the difference between database schema and database state? c) What is weak entity give an example? d) What is domain? e) How can achieve referential integrity? f) Write the syntax for Update command in SQL? g) Give some examples for secondary storage? h) What is record? i) Define folding? j) List the different operators in relational algebra? k) Mention the different types of joins? l) Give two examples for multivalued attribute? m) What is functional dependency? n) What are the properties of a transaction? o) What is granularity?

15 UNIT - I 2) Consider the following relational schemas and write the sql syntaxes for the following sailors (sid: integer, sname: string: rating integer, age: real) Boats (bid: integer, bname: string, color: string) Reserves (sid: integer, bid: integer, day:date) a) Find the names of the sailors who reserves a boat #103. b) Find the names of the sailors who reserves a red boat. c) Find the names of sailors who reserved either red boat or green boat. d) Find the names of sailors who reserved both red and green boats. e) Find the names of sailors who reserved at least two boats. 3) Write short notes on: a) Key constraints b) Participation constraints c) Entity integrity d) Two tier client server architecture for DBMSs e) Logical data independence UNIT - II 4) Write in detail about Dynamic multilevel indexes using B-trees and B+ trees. 5) What is meant by the term heuristic optimization? Discuss the main heuristics that are applied during query optimization. 6) a) Explain BCNF with example. UNIT - III b) Explain the third normal form with example. 7) Discuss functional dependencies with an example. 8) What is Tuning? Explain with an example. UNIT - IV 9) Discuss concurrency control with an example.

16 (DMTCS 07) M.Tech. DEGREE EXAMINATION, DECEMBER 2015 (Examination at the end of FirstYear) COMPUTER SCIENCE Paper - VII: Software Engineering Time : 3 Hours Maximum Marks: 75 Answer Question No.1 is compulsory (15) Answer one question from each unit (4 15 = 60) 1) a) What is system engineering? b) Define architectural design. c) Differentiate software process and software metric. d) What are formal methods? Why we need them? e) What do you mean by component? How many components are there? UNIT - I 2) a) Define the term software. State and explain various of software applications. b) Compare the personal and team process models. 3) Discuss system engineering in detail. UNIT - II 4) a) State and explain various software design concepts. b) Discuss why software architectural design plays an important role during development and discuss various architectural terminology. 5) a) Define the term software component and discuss its characteristics. b) State and explain various interface design activities.

17 UNIT - III 6) What are the testing strategies for conventional software? Explain them in detail. 7) Discuss various software testing techniques. UNIT - IV 8) a) State formal methods? Discuss. b) Define re engineering. Why we need it in software engineering? Explain. 9) a) Differentiate client/ server software engineering. b) Write short notes on web engineering.

18 (DMTCS 08) M. Tech. DEGREE EXAMINATION, DECEMBER 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - VIII: E-COMMERCE Time : 3 Hours Maximum Marks: 75 Answer Any five of the following All Questions carry equal marks 1) a) E-market place technologies. b) M- commerce. c) SET. d) Extranet. e) Message object security service. f) Encryption 2) What are the causes for the growth of e-commerce? 3) Explain different modes of e-commerce. 4) Bring out different antivirus programmes available for internet. 5) Discuss and secure technologies for e-commerce. 6) Describe the internet relevant to e-commerce. 7) Elucidate the advertising on web. 8) Explain different schemes for e-cash management. 9) Describe business requirements of master card secure e- transactions.

M.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