zo me CS: COMPUTER SCEENCE AND INFORMATION TECHNOLOGY Duration: Three Howes Mecsomeon Marks: 100 Read the following instructions carefully. 1. This question paper contains 24 pages including blank pages for tough work. Please check all pages and repont discrepancy. if any 2. Write your registration number. your name and name of the examination centre at the specified locations on the right half of the Optical Respanse Sheet (ORS). 3. Using HB pencil, darken the appropriate bubble under euch digit of your registration number and the letters corresponding to your paper code. 4, Alllquestioas in this paper are of objective type. 5, Questions must be answered on the ORS by darkening the appropriate bubble (marked A, B, C, D) using HB pencil against the question number on the left hand side of the ORS. For exch question darken the bubble of the correct answer. In case you wish to change an answer, erase the old ansiver completely, More than one answer bubbled against a question will be treated as an incorrect response, 6. There area total of 65 questions carrying 100 marks. 7. Questions &.1 - Q.25 will cary L-mark each, and questions Q.26 - Q.55 will carry 2-marks each. 8 Questions Q.48 - Q.51 (2 pairs) are common data questions and question pairs (Q.52. Q.53) and (O.54. 0.55) are linked answer questions, The answer to the second question of the linked answer questions deperds on the answer (o the Grst question of the pair. Hf the first question in the tinked pair is wrongly answered or is un-attempted, then the answer to the second question in the pair will not be evaluated. 9. Questions Q.56 — Q.65 belong to General Aptitude (GA), Questions Q.56 ~ Q.60 will carry L-mark each. and questions Q.61 - 0.65 will carr S.anarks each. The GA questions will begin on a fresh page starting from page 15. 10, Un-attempted questions will carry zero marks. 11, Wrong answers will carry NEGATIVE marks, For Q.1 — Q.25 and Q.56 — Q.60, % mark will be deducted for each wrong answer. For Q.26 - 0.51 and ©.61 - Q.65, % mark will be deducted for each wrong answer, The question pairs (Q.52, Q.52). and (Q.54, Q.55) are questions with linked answers. ‘There will be negative marks only for wrong answer to the first question of the finked answer question pair ie. for Q.52 and Q.S4, % mark will be deducted for exch wrong answer. There is no negative marking for Q.53 and Q.55. 12, Calculator (without dats connectivity) is allowed in the examination hall (3. Charts. graph sheets or tables are NOT allowed in the examination hall 14, Rough work ean be done on the question paper iiself. Additionally, blank pages are provided at the end of the question puper for tough work,2010 cs QL - Q.25 carry one mark each. Qi Q? Qa Qa as Q6 qr a8 Lar G=(V, E) bea graph. Define €(G)= Si, xd. where j, isthe number of vertices of degree d = in G. IFS und Pare two different ees with ES) (ANI S1= 217] (BI S] =1T (7). then (© 1 S[=1 7] (D} 1S]=ITI+1 Newton-Raphson method is used to compute a root of the equation x -13=0 with 3.5 as the initial value. The approximation after one iteration is (A) 3.575 (8) R077 (C) 3.007 (D) 3.007 ‘What is the possible number of reflexive relations on a set of 5 clements?. cay 2° (By 2" © 2” @ 2% Consider the set S= (1, @, a7}, where @ and eo are cube roots of unity, If * denotes the multiplication operation, the structure {8 *) forms (A)a group (B)a ring (©) an integral domain (D) a field whatiste value of p12] "2 wel nw yo Bye «me ol ‘The minterm expansion of {(P.Q.R)= PQ + OR PR is a (©) ny emt my tet, (1) tar, + mb, + nig my m+ mg +m, (B) any +20, ten +, A main memory unit with a capacity of 4 megabytes is built using IM x 1-bit DRAM chips. Each DRAM chip has 1K rows of culls with 1K cells in each row. The time taken for a single refresh operation is 100 nanosecens. The time required to perform one reftesh operation on all the cells in the memory unit is (A) 100 nanoseconds (B) 10042" nanoseconds ¢C) 100*2" nanoseconds (D) 3200*2™ nanoseconds P is a 16-bit signed integer. The 2's complement represeniation of P is F87B)¢. The 2's complement representation of BYP is ANCWB)s (B) ORB). iY E878). @P) (9878), wsano ss 9 The Boolean expression for the output f of the multiplexer shown below is R R. 1 R. R. PQ (a) PBQSR ®) POOR C) PHQHR (D) PQek Q10 Ina binary wee with 2 nodes, every node has an odd number of descendants. Every node is considered to be its own descendant, What is the number of nodes in the tee that have exactly one child? we 1 © @y2 Owl QL What does the following program print? #include void (int *p, int ‘at ine maint { tei, 3): prints(*ed Ba\nt, i, jh retarn 0: } (A) 22. p21 cod (D) 02 Q.12 Two alternative packages A and B ure available for processing 2 database having 10° records. Package A requires 0.0001 n? time units and package B requires 10 nlogyy % time units (9 process, records, What is the smallest value of & for which packuge B will be preferred over A? (A) IZ B10 (C)6 (D) 5 Q13° Which data structure in a compiler is used for managing information avout variables and their attributes? (A) Abstract syntax iree (8) Symbol table (C) Semantic stack (1D) Parse table Q.L4 Which languages necessarily need heap allocation in the runtime environment? (A) Those that support recursion (B) Those that use dynamic scoping. (© Those that allow dynamic data structures. (D) Those that use global variables. GSuo ‘sy Qs Qi6 Qu7 Quis Qs (One of the heacer fields in an iP datagram is the ‘limesto-Live (TTL) field. Which of the following, statements best explains the need for this field? (A) Ivcan be used to prioritize packets (B) It can be used to reduce delays. (C} It can be used (0 optimize throughput (D) Ie can be used 10 preven packet looping Which one of the following is not a client-server application? (A) Internet chat (B) Web browsing (E-mail (D) Ping Let L1 be a recursive language. Let L2 and 13 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily tre? (A) L2_— Li is seeursively enurmerable, (B} L1— 13 is recursively enumerable. (C) L2 1 L3is recursively enumerable. {D) 12 UL3is recursively enumerable, Consider a BYtree in which the maximum number of keys in 2 node is 5. What is the minimum umber of keys in any non-root node? al (yz «3 4 A relational schema for a train reservation dalabas given below Passenger (pid, prame, age) Reservation(pid, class, tid) Table: Fassenger ‘Table: Reservatica pid | pname “| Age pid[class [tid 0 [Sachio [65 o[rac | 8200 T[Rahur [60 TAC [901 2 [Sourav | 67 2 [se [8200 [aan Tor 3 Pac [e203 [ses [8304 ¥ [aG__[szu2 ‘What pids ate returned by the following SQL query for the above instance of the tables? SELECT pid FROM Reservation WHERE claee = ‘AC’ AND EXISTS - ssenger age > 65 AND ssenger pid = Reservation-pid) (ALO (By i? (O13 152010 cs Q20 Which of the following concurrency comms! protocols ensure both conflict serialtzabilicy and freedom from deadlock? J, 2-phase focking N.Tine-stamp ordering 1A) lonly 8) Tl only (C) Both and WD) Neither Enor I Q2L_ The cyclomutic complexity of each of the modules A and B shown below is 10. What is the cyclomacie complexity of the sequential integration shown on the right hand side’? ayo BA «cy 20 (D) 10 Q.22 What is the appropriate pairing of items in the 1wo columas listing various activities encountered in a software life eyele? P, Requirements Capture 1. Module Developmen and Integration Q. Design 2. Domain Analysis AR. Impleinentation 3. Structural and Behavioral Modeling S. Maintenance 4, Performance Tuning, (AYP3Q2R4S1 — (BYP2AQIRAS4 (CO) PIQ2RAS4 (OPP2QIRASL Q.23 Consider the methods used by processes PI and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared booleun variables 51 and S2 are randomly assigned. f ‘Method used by Pi_ “Method used by P2 while (Sl == 82); while (Sl != $2); Critical Section Critical Section Sl = 82; 82 = net(S1); Which one of the following statements descrites the properties achieved? (A) Mutual exclusion but rot progress (B) Progress bat not mutuat exclusion {© Neither metual exelusion nor progeess «12) Hoth rantual exclusion and progress Q24 A system uses FIFO policy fur page replacement. It has 4 page frames with no pages loaded to begin with. ‘The system first accesses 100 distinct pages in sorte order and thea accesses the same 109 pages but now in the reverse onder. How many page faults will occur? 1A) 195 43) 192 «7 197 (D) 195 w ” wa200 os 25 Q.26- Q.26 Q27 28 Q.29 30 ‘Which of the following statements are true? J. Shortest remaining time first scheduling may cause starvation JL Preemptive scheduling may cause starvation. IIL. Round robin is better than FCFS in terms of response time (A) Lonky B)Land wonty —— (C) Wand only) Lard OF Q.S5 carry two marks each. Consider a company that assembles computers. The probability of a faulty assembly of any computer is p. The company therefore subjects cach computer to a testing process. This testing process gives the correct result for any computer with a probability of ¢. What is the probability of a computer being declared faulty’? (A) patUpXi-g) BY (t-a)p ©) (hey ©) pg ‘What is the probability that a divisor of 10™ is a multiple of 10% 7 (A) 11625 (B) 41625 (C) 121625 D) 16/625 ‘The degree sequence of w simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? L 7.6,5,4.43.28 He 6666.3.3,2.2 HL 7,6,6,44.3,.2.2 WV. 87.7642 11 (A) Tand 8) Mand V © 1V only (O) Ward IV Consider the following matrix col AS ay If the eigenvalues of A are 4 and §, then A)xedy= 0 @) © @D) 2=-4,y=10 Suppose the predicate F(s.y,1} is used to represent the statement that person x can fool person y at ime 1. Which one of the statements below expresses best the meaning of the formula VASE Lx, 9.19)? {A) Everyoae can fool some person at some time, {B} No one can fool everyone all the tire. {C) Everyone cannot fool some person all the time. {D) No one can foal some pessan at some time. ws2010 és Q.31 What is the boolean expression for the output f of the combinational logic circuit of NOR gates given below? P 9° =D > ——D- =D =p R (A O+R (B) P+Q () P+R () PHO+R 0.32 In the sequential citeuit shown below, if the initial value of the output QQ, is OO, what are the next four values of O15”? a 2 2 Clock Q% a (A TL1G.01L00 8) 10,11,01.00 — (C) 10,60.0101 OP 11,30,00,01 oS - Tae20 es Q.33 A S.siage pipelined processor has Instruction Fetch (IE), Instruction Decode (1D). Operand Feteh (OF), Pesform Operation PO) and Write Operand (WO) stages. The IF. 1D. OF and WO st take I clock cyele each for any instruction, The PO stage takes 1 clock eycle for ADD and SUB instructions. 3 lock eyeles for MUL instruction, and 6 clock cycles for DIV instevetion respectively. Operand forwarding is used in the pipeline, What is the number of clock cycles needed (o execute the following sequence of instructions? Instruction Meaning of instruction fg MUL R. Ro. Rt Rr RoR 4 DIV Ra Ri Re Ry RVR fy ADDR: Rs Re Ri = ReR; 4x SUB Rs, Ra Ry, R,—Ry-R, (Ay 13 IBY IS on 19 Q.34 The weight of u sequence @y.47,.-.4,, , of eval numbers is defined as ay ta/24..ta,.)f2 A subsequence of a sequence is obtained by deleting seme elements from the sequence. keeping the ‘order of the remaining clements the same. Let X deacte the maximum possible weight of a subsequence of dystysud,, and Y the maximum possible weight of a subsequence of Oyegynd, ,. Then X is equal to Abnasthag ti) Bymaxikigg HYP) (C)maxKdg +21) (Day + 72 Q.35._ What is the value printed by the following © program? #include int €¢int ‘a, int n} t if (n <= 0) return 0; else if ("a % 2 == 0) return ta + £(asd.n-1); else return ta - f(ati.n-1); ) int maint) ‘ ant afl = 12. 7. 13. 4. 11, 6: printf isd", £40, 6)); return 6: ) Ad-9 (Hs ons 19 = ws936 037 Q.38 Q9 The following © function takes a singly linked list as input argument. t modifies the list by moving Ie last element to the front of the list and returns the modified fist. Some part ef the code is lett blank typedef struct node { int value; struct node *next; + Node: Node *nove_to_front (Node *head) { Nede tp, tai if ((head = = NULL) || {head->next = = NULL)) return head; 9 = NULL: p = hea while (p-enext != NUBLI ( ap P= pesnext; return head; } Chouse the correct alternative to replace the blank line, (Ala = NULL; p->next = head; head = (B)q->next = NULL: head = p; p->next = hea (Cyhead = p: p->next = qi q-enext = NULI (D)q-snext = NULL; p->next = head; head ‘The program below uses six temporary variables a, bb, c. d. e, E. Agrmoaare Omen ae return d + £ Assuming that all operations (ake their operands from registers. what is the minimum number of registers needed to execute this program without spilling? (a2 3 oa D) 6 ‘The grammar S —+ aSa | bS |cis (A) LLG) but not LRT) (B) LR(1) but net LLC!) (C) Both LL( 1) ard LRU} (D} Neither LLC) nor LR) Let L= {© (0 + 1)" [has even number of 15], i.e, f 8 the set of all hit strings with even ‘umber of Is. Which one of the regular expressions helow represents £7 CA) rts (By usclortony CCP OMIOE TO" (DY OFCOM LYHIOF200 Qa Qal Qa2 Q43 o Consider the languages LY = {OV | ie jf), 22 (00 [i= 7}, £2=40N | i=2j+1). 14 = (OV | £42] }. Which one of the following statements is true? 4A) Only £2 is context free. (B) Only £2 and £3 are context free. (©) Only LJ and £2 are context free. (D) Allare comext free. Lat w be any string of length x in (0,1}". Let & be the set of all substrings of w. What is the minimum number of states in a non-dclcrministic finite automaton that accepts L? (Adel (Bin tCyned wy) 2 Consider the following schedule for transactions TI, T2 and 73: Th Tz T Read (X} Read (¥) Read( ¥} Write (7) Write (X) Write (X) Read (X) Write (X) Which one of the schedules below is the correct serialization of the above? (TL T3972 {B)T2 + T1 + 3 (T2373 TL (D)T3 371 + TI The following functional dependencies hold for relations RUA, B, C) and SB, DB, B): BoA, ASC The relation R contzins 200 tuples and she relation S contains 100 wples. What is the maximum number of tuples possible in the natural join x > Inian's age + Sai ii, The age difference between Gita and Sair oldest and Saira is not she youngest. ili, There are ng twins. In what order were (hey born (oldest fiest)? (AD HSIG. (B) SHI (©) IGS «Dy ISG age. 1 year, However, Gita is not the Modern warfare has changed from large scale clashes of armies to suppression of civilian Populations. Chemical ageats that do their work silently appear io be suited to such warfare; and regretfully, there exist people in military establishments who think that chemical agents are useful tools for their canse, Which of the following siarememts best sums up the meaning of the above passage (A) Modem warfare has resulted in civil strife. {B) Chemical agents are useful in modern warfare {© Use of chemical agents in warfare would be undesirable {D) People ia military establishments like to use chemical agents in war. 5 skilled workers can build a wall in 20 days; 8 semi-skilled workers can build a wall in 25 days; 10 unskilled workers can build a wall in 30 days. If a (cam has 2 skilled, 6 semi-skilled and 3 unskilled workers, how long will it take to build the wail? (A) 20 days {B) 18 days (C) Idays (Dy 15 days Given digits >. 2. 3, 3, 3. 4.4, 4, 4 how many distinct 4 digit numbers greater than 3000 can be formed? (aso (BSL 4) 52 (Dy 34 END OF THE QUESTION PAPERSpace for Rough Work cs o Tat2010 Space for Rough WorkSpace for Rough WorkSpace for Rough Work2010 Space for Rough Work cs GSSpace for Rough Work2010 es Space for Rough Workmet a Space for Rough Work es