Computer Science Paper -II Time allowed : Threehours Maximum Marks: 300 ‘The figures in the margins indicate full marks for the questions. Candidates should answer Question No. | and 5 which are compulsory and three of the remaining questions, selecting at least one from each section, iii iii SECTION-A ‘Write the advantage of postfix expression over infix expression. 6 Write 3 advantages and 3 disadvantages of index sequential access mechanism of files 6 Discuss the count to infinity problem of distance vector routing. Explain any one method to overcome the same. 8 Write two ways in which the OSI reference model and the TCP/IP Model are the same. Also write two ways in which they differ. 8 Explain the OOPS paradigm in brief, Explain how object orientation contributes to- (A) Programming (B) GUI (C) Data Base (D) Operating System 16 What are the draw backs of E-R model? How could they be overcome using EER model? Explain with example. 8 In the context of concurrency control in DBMS, what are the problems of the basic locking protocol and how 2PL is useful to overcome such problem? 8 Write an algorithm to delete a node from the binary search tree. Consider the following binary search tree, delete node 6 from tree and reconstruct it 8ii, ii, iii, iii, Discuss any four factorsthat influence the choice of file organization and methods, 8 Explain thespecific roles of LLC and MAC sub layers of data link layer. 10 Define Amplitude, Period, and Phase fora periodic digital signal. 6 In structured programming paradigm differentiate the global and local variables by giving an example. 8 Write 10 rules of CODD andexplain any three of them with example, 12 What are the potential threat points in a database system? Explain any three of them. 8 Evaluate following postfix expression and Illustrate how this expression is represented in stack 8 100: 382 at 50: ots Write the advantage of threading a tree, Explain right threaded and left threaded binary tree with example of each. 8 State any two problems with SLIP protocol. State how they are overcome by PPP protocol, a6 Explain thenecessity of subnet mask with IP address 8 For a programming language differentiate between semantics and syntax with example. 10 Explain the components of domains definition. Ilustrate the domain constraints by taking asuitable example, 10 Explain the concept of cursor in Database, (ii) Explain any four cursor operations. 10 Convert following postfix expression to infix expression: 6 ALB. Ge Dope E at 6. Explain the general mechanism of sorting a linked list in. ascending order using pointers, 8 Define minimum spanning tree. Find all the spanning tree and minimum spanning tree of following graph 6 = A, 2 3 4 1 c ee ene D,iv ii, iii, ii, iii iii, iv. iv, Why do we need framing at data link layer? Explain any two methods to mark the start and end ofeach frame. 8 Why do we need fragmentation and defragmentation atnetwork layer? Explain. 6 Differentiate between multiple inheritanceand multilevel inheritance with example, 8 Explain terms cardinality and connectivity in contextof E-R diagram. 6 () Explain Tables, View and Index in DBMS, (ii) Write3. advantages ofviews. 12 SECTION-B Write an algorithm to convert a postfix expression to infix expression, 6 Explain the mechanism of selection sort method, Show the process of sorting following sequence of numbers in ascending order using selection sort method. Show all the intermediate steps after each cycle by highlighting the two numbers exchanging their locations, 10 (44733 [ss [227i Regarding IPaddress, give reasons for following statements: (A) AllOs-Nevera validdestination (B) All ls-Nevera validsource (©)127._._._ shouldnot appearon network 9 For establishing TCP connection if there would be two way hand shake instead of three way, what problem may occur? Discuss. 6 What is a subprogram? Explain following parameter passing methods to and from subprogram; 8 (A) Pass by value (B) Pass by result (C) Pass by reference Define 3NF with the help of a suitable example. Explain terms insertion anomalies, deletion anomalies, modification anomalies in the context of 3NF. 10 What will be the output of following query? SELECT REPLACE(TRANSLATE(LTRIM(RTRIM(! ATHEN i ), “!), ‘AN’, "#9," ' TROUBLE’) FROM DUAL; > Consider a schema R(A,B,C,D) and functional dependencies A>B and C->D. Then the decomposition RI(A,B) and R2(C,D) is dependency preserving but not lossless join. Comment whether statement is True or False? Justify your answer. 6 Write the characteristics of binary tree and give oneexample of the same. 6 Construct binary search tree from the following set of numbers given intheorder 8 20,35, 12,3, 28,3, 14,31, 16, 13, 30,35 Show the construct of tree in incremental order after each node insertion, Comment on the efficiency of sequential file processing. a While using analog signals to transmit digital data, what band width is required for data 3ii iv. ii, iii, iii being sent at a rate of 10 bps using analog signal? Assume that each signal element is, one bit. 5 Whats the advantage of multiplexing? Explain FDM and TDM. 9 What is late binding? Explain the difference between virtual function and pure virtual function. 10 How are specialization/generalization constraints represented in the EER model? Expl 9 What isde-normalization? Why do we perform de-normalization? 8 Write and explain Algorithm to search a node in a linked list. 8 Define graph and explain its two applications, Show the adjacency list structure of following graph- 10 ae () 4 @) Y Explain following terms in context of network's performance 9 (A) Throughput (B) Packet delivery ratio (C) Jitter Explain any three properties that are used in quality of service in thenetworklayer. 9 Explain the concept of abstract data type with example. 6 Explain in brief any six causes of Database failure, Explain roll forward and roll back concept of database recovery. 10 Explain database privilege, system privilege and object privilege in the context of data protection. 8 What is a Circular-queue? What problem of linear queue can be resolved using Circular queue? 4 Writeanalgorithm for computing a minimum spanning tree. 8 Writean algorithm to insertan elementin acircular queue. 8 Explainany two differences between TCP and UDP protocols. 6 Write three functions of data link layerand network layeras applicable to OSI model. 12 Discussany three criteria of programming language evaluation. 6 What is the importance of Thomas's Write rule in Database concurrency control? How does the Thomas's write rule modifies the checks for a write operation by a ‘TransactionT? 12 Explain the difference between TRUNCATE and DELETE command of sql. 4 4Computer Science Paper -I ‘Time allowed : Three hours Maximum Marks: 300 The figures in the margins indicate full marks for the questions. Candidates should answer Question No. land $ which are compulsory and three of the remaining questions, selecting at least one from each section, SECTION-A. 1. a. Define Turning Machine. Construct a Turing Machine for the proper subtraction i.e. m- max (m-n, 0) where m-nis m-nifm>=nandOifmAIB ASAE B>0B|IB|< 6 bi. What is an indirect measure and why such measures common in software metrics work? 20 Describe the role of risk analysis in an evolutionary process model like the spiral model * Elaborate thetest strategies for object oriented software 20 * Whyisahighly coupled module difficultto unittest? SECTION - B 1 Consider a logical address 0 space of 8 pages of 1024 words mapped onto a physical memory of 32 frames * How many bits are there in the logical address? * How many bits are there in the physical address? Is 4h Explain the necessity for mutual exclusion, What is the minimum level of ‘mutual exclusion that is necessary for the implementation of useful mutual exclusion iy operating systems? What other forms are useful? 15 b. i. Describe the difference between "known risk" and “unpredictable risks” in context of software development, 15 th What is the difference between thread based and use - based strategies for integration testing? How does luster testing fit in? 156 ii, ii, iii, Write short notes on mealy machine. Draw a mealy machine for finding I's complementofa given binary number. 15 Consider the € NFA =p ee ae Compute the e-closure of each state, Convert the ¢-NDFAtoNDFA 15 What is the difference between a direct and indirect address instruction? How many reference to memory are needed for each type of instruction to bring an operand into a process register? 15 What are interrupts? Draw the block diagram of instruction cycle with interrupts. 15 Assume a stack-oriented processor that includes the stack operations PUSH and POP. Arithmetic operations automatically involve the top one or two stack elements. Be; with an empty stack, what stack elements remain after following instructions are executed? PUSH4 PUSH7 PUSH8 ADD PUSH 10. SUB MUL 10 Differentiate between RISC and CISC. 10 What are the four main components of general purpose computers? Show it with a block diagram, 10 ._ Transform P and V operations on a semaphore S into equivalent critical regions without busy-waiting. 15©. Expla in the following with suitable example 1s © Sizeoriented metrics Function oriented Metrics a. i, Describe the difference between short term, medium term and long term scheduling, 15 Explain the organization and working of following types of Turning Machine © = Multi-tape Turning Machine 15 * Turning machine with Semi-Infinite Tape b. Which is more valuable to object oriented testing, white box or black box testing? Justify your answer. 15 A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 20ns are required to access it. If t is in main memory but not in cache, 60ns are needed to load it into the cache, and then the reference is started again. If the word is not in main memory, 12ns are required to fetch the word from disk, followed by 60ns to copy it to the cache, and then the reference started again. The cache hit ratio is 0.9 and the main memory hit ratio is 0.6. What is the average time in ns required to access a referenced word on this system? 15