Sei sulla pagina 1di 36
ih 26 — QUESTION PAPER ‘SERIES CODE Centre of Exam, A Name of Candidate : ‘Signatare of Tavigilator ENTRANCE EXAMINATION, 2015 MPhil /Ph.D. & M-Tech./Ph.D. COMPUTER & SYSTEM SCIENCES { Fleld of Study Code : COMP—SCSP (158)/MTCP (157) } Time Allowed : 3 hours Maximum Marks : 480 Weightage : 100 INSTRUCTIONS FOR CANDIDATES Candidates roust read carefully the following instructions before attempting the Question Paper (i) Wisite your Name and Registration Number in the space provided for the purpose on the top of this ‘Question Paper and in the Answer Sheet ae . ae (i) Please darken the appropriate Circle of Question Paper Series Code on the Answer Sheet. (ii) AU questions are compulsory. liv) Answer all the 120 questions in the Answer Sheet provided for the purpose by darkening the correct choice, ives fal or) or () or (6) with BALLPOINT PEN only against each question in the corresponding Circle. Any overwriting or alteration will be treated as wrong answer (0) Each correct answer carries 4 marks, There will be negative maridag and 1 mark will be deducted for each wrong answer, (ei) Answer written by the candidates inside the Question Paper will not be evaluated. (wi) Calculators and Log Tables may be used, (vii) Pages at the end have been provided for Rough Work {o) Return the Question Paper and Answer Sheet to the Invigilator at the end of the Entrance Examination. DO NOT FOLD THE ANSWER SHEET. INSTRUCTIONS FOR MARKING ANSWERS Use only Blue/Black Ballpoint Pen (do not use pencil) to darken the appropriate Circle 2) Please darken the whole Circle. 3. Darken ONLY ONE CIRCLE for each question as shown in the example below Wrong ‘Wrong Wrong Wrong | Correct 0 HOHO|FHOO|FOHOGlOHOO/OHO@ Once marked, no change in the answer is allowed. Please do not make any stray marks on the Answer Sheet. Please do not do any rough work on the Answer Sheet Mark your enswer only in the appropriate space against the number corresponding to the question. Ensure that you have darkened the appropriate Circle of Question Paper Series Code om the Answer Sheet. 126-8 126-0 1. Which of the following sorting algorithms has a running time that is least dependent on the initial ordering of the input? {@) Insertion sort (0) Merge sort (©) Quicksort (4) Selection sort 2. The mean of the values 0, 1, 2, .... having corresponding weights n, respectively is Oa % 25 © @ 5 What would be the sequence of nodes in preorder traversal of a binary tree whose inorder and postorder traversals are as under? Inorder ABCFBD Postorder : EF C DBA a) ABCDEF ) ABCFED () ABCEFD (a) None of the above 4. Ifa file of size n= 1000 takes 5 ms for sorting using the quicksort algorithm, then approximately how much time: would it take to sort a file of size n = 10000000007 (Assume that all data are available in the main memory) {a} 1500000 ms (o) 15 ms {e} 150000 ms (a) None of the above 126-4 3 [P70 126-A Let R=(A, B, C, D, EB, F) bea relation scheme with the following dependencies CAF, EA, EC3D,A>B Which of the following is a key for R? @ cD (o) AE fe) AC (4) None of the above What is the output of this C code? void main( ) { const int a =10; int *ptr = (int*)éa; : “ptr = 20; celrser( }s printi[%6d",@}; geteh( ); (@ 10 &) 20 () Error (a) Garbage ‘The most powerful form of structural testing is ° (a) function coverage testing (0) branch coverage testing (0) statement coverage testing (2) path coverage testing How many page faults will occur for.the optimal, least recently used and clock-page replacement algorithms respectively for the given page reference string? 232152453252 (@) 54,3 () 34,5 © 33,4 @ 44,5 9. ‘The maximum frame size for a CSMA/CD network rui network running at 1 Gbps over }-km cable with no repeaters and a signal speed of 200000 km/sec is {a} 10000 bits {b) 5000 bits (c} 20000 bits {a) 18000 bits 10. if (tan + cot6) =2, the value of (tan? 0+ cot” 6) is equal to @ 0 Oe @ 2 @ 4 11, CSMA with p-persistent (a) sends frames immediately if the channel is idle {b) senses the channel with probability p (@) sends with probability p if the channel is idle (a) sends with probability 1- p if the channel is idle 12. The major difference between'a Moore and a Mealy machine is (a) output of Moore machine depends on present state and input () output of Moore machine depends on a state only fe) output of Moore machine depends on output only (a) None of the above 12, Ona positive edge-triggered SR Dip-lop;the outputs reflect the input condition, when (a) the clock pulse is low {b) the clock pulse is high (@) the clock pulse transitions from low to high (¢) the clock pulse transitions from high to low 126-A 5 14. 1s. 16. a7. 126-8 anu it nope engula ati An=), Ont} ore nee a Monash epmpha rer I 0,0) sted MO whee of, 80 stored i vray orm =3007 to nis) oo ns229 fe ns230 (@) [3231] What is the output of this C code? define product (a, b) at main() t int x = 5, y= 2; printi("%d", product(x + 4, y~ 3} ) f@) 10 & -9 oe 15 (d) Error The value of tani5* tan20* tan 7 tan 75° is equal to (@) 1 to) 2 (22 (a) 23 What among the following depicts a semaphore? (a) A program (b) A constant {c) A variable (@) A hardware device 18. Suppose you are given an array s[1 nl and a procedure reverse (si j) which reverses the order of elements in s between i and j (both inclusive). What does the following sequence do, where 1k Sn? fa) © () (a) reverse(s, 1, Kj; reverse(s, k +1, nj; reverse(s, 1, nj; Rotates s right by k positions Rotates s left by k positions Reverses all elements of s None of the above 19. Choose the missing term out of the givei () (b) C) @ Poles : Magnet :: ? : Battery Energy : Power Terminals cells 20. RISC stands for @ o cc @ 21, If the hit ratio to a TLB is 150 nanoseconds to access the main memory, Rapid Instruction Set Computer Reliable Intelligent Super Computer Reduced Instruction Set Computer Ruby Integrated Silicon Chip time in nanoseconds? @) ®) ) (a) 126-8 185 195 208 175 n alternatives : 80% and it takes 15 nanoseconds to search the TLB and what must be the effective access [P.7.0. 22. 23. 24. 126-8 Capacity of a channel is 20 Mbps and a round-trip time is 25 ys. Frames of size _ 1000 bits are being transmitted. The utilization of the channel is approximately @) 6) c) a 95% 66% 585% 33% Which of the following logic expressions is incorrect? CO) ) © @ The The fa) ) c) @ How (a) @) © @ 18 1 18180 1181-1 16 ° probabiliy density function of @ random variable X is flx)= in OSx=2 P(X>1-5]X> I) is equal to ze 16 ‘many inputs will a decimal-to-BCD encoder have? 4 8 26. 27. 28. 126-4, What is the cyclomatic complexity of the following piece of code? int D = 2; for (int i = 1; 4-3; 16+) {for (int k= 1; eed; k++) {for (int m = 1) me=3; m+} D=D*3; fa) 3 ) 4 © 5 @ 6 What is the output of this C code? struct xyz q char *3; int i} strict xyz, a, bi as = (char*}malloc(6); stropy(a.s, “hello"; bea b.slo} =H print{(%s", 2.8) - (a) Thére will be run time error (b) hello () Hello (a) There is a syntax error Predictive parsing is possible only for (a) L1{k) grammar (b) LALR() grammar (c) LRGs) grammar (a) CLR¢) grammar [P.7.0. 29. 30. a1. 32. 33. 126-8 Which of the following is not a step in objectoriented analysis using OMT? (a) Object modeling (b) Collaborative modeling (€) Dynamic modeling (a) Functional modeling Which of the following will be equivalent to ~(p- > 4]? (@) (Piva) () (-@->-p) © (paral (d) All of the above Im Unix, for some file the access permissions are modified to 764. Which of the following interpretations is valid? (a) Everyone can read, group can execute only and the owner can read and write (0) Everyone can read and write, but the owner alone can execute (e) Everyone can read, group including owner can write, owner alone can execute (@) None of the above Consider a schema R(A, B, C, D) and functional dependencies A> B and CD. ‘Then the decomposition of ® into R\(AB) and R,(CD) is (a) dependency preserving and lossless join (b) lossless join but not dependency preserving (c}_ dependency preserving but not lossless join {d) not dependency preserving and not lossiess join ‘The general solution of the equation (V3 ~ 1)sin@ + (V3 + 1)cos® = 2 is fa) © Cc) (a) 10 34. Choose the missing term out of the given alternatives Peace : Chaos :: Creation : > (@) Manufacture (b) Destruction (@ Buita (@) Construction 38. If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the output after two passes would be la} 8, 15, 20, 47, 4, 9, 30, 40, 12, 17 (b) 8 15, 20, 47, 4, 9, 30, 12, 17, 40 (6) 47, 20, 8, 15, 4, 9, 30, 40, 12, 17 (4) 8 15, 20, 4, 9, 47, 30, 40, 12, 17 36. Which one of the examples given below express the commutative law of multiplication? () A+B=B+A (b) AB=BsA () AB= BA xB (a) AB= 37. NAND gates are preferred over others, because these (a) have lower fabrication area (0) can be used to make any gate {c) consume least electronic power (a) None of the above 38. In COCOMO model, the effort of 2 person month can correspond to fa) 2 persons working for 1 month (b) 1 person working for 2 months (c) 2 unit area under the person-month plot (a) All of the above 26-4 n [P.1.0. 39. 41, 42. 126-8 What is the output of this C code? void main() { int x = 5, y= 10, 2= 15, val; val = sum (x,(y = 0,220, ¥), 2) celrser(}; printf (%d", val); getch| ); ’ sum (int x, int y, int 2) { return x+y #2; } fa) 20 () 10 (15 (a) None of the above stharmenie mean of 0 postive integers and gis 3 given that 2! 9 @ 98 a) qz13 Among the following, which is not a Horn clause? (a) P @) pve ) pog @ pong Let f(x) = x? be a function over the set of real numbers. Which of the following is true? (a) fis invertible (b) fis not invertible ()_f is one-to-one (a) Not possible to determine 12 fa) (e Co) a) + Choose the missing term out of the given alternatives Architect : Building :: Sculptor : ? Museum Statue Chisel Stone 44, Standard FIP uses reserved port(s) (@) & ) @ 48. When simplified with Boolean algebra (x + y)(x+z} simplifies to @ oo) ) @ 126-4 20 25 20 and 21 25 and 23 x xtxiyt2) x(1+ yz) xtue 13 [P-7.0. 46, The minimum number of nodes in an AVL tree (height-balanced binary tree) of height = 9 is (@) 54 (o) 64 87 (a) None of the above 47. Sliding Window Protocol with selective reject/repeat gives better performance than other protocols, when (a) buffer is limited and bandwidth is sufficient {b) buffer is sufficient and bandwidth is limited (c) buffer is limited and bandwidth is limited (d) buffer is sufficient and bandwidth is sufficient 48. Three integers are chosen at random from the first 20 integers. The probability that, their product is even, is @ oo 35 @ = 126-8 14 é 49. What happens if the base and derived class contain definitions of a function with same prototype? () Compiler reports an error on coimpilation (b) Only base class function will get called irrespective of the object () Only derived class function will get called irrespective of the object (@) Base class object will call base class function and derived class object will call derived class function 50. What is the heuristic function of greedy best-first search? Gf (at= hie) ©) Fe) < rin (Fer) = Pin) (a) Fee) > hin) 51. How many spanning trees are possible in Kp ,? (sat @) s.28 @ 2 2 82. If FRIEND is coded as HUMJTK, how can CANDLE be written in that code? (a) DEQUOM (b) DCQHOK (9 EDRIRL (@ ESUFME 126-4. 15 [P70 55. 126-8 ‘The number of generators in the group is 1 wo 2 @ 3 @ 4 Which of the following is true in context of alpha-beta search procedure? (a) The alpha values of MAX nodes can never decrease (&) The beta values of MIN nodes can never decrease (0) Search can be discontinued below any MIN node having beta value less than or equal to alpha value of any of its MAX node ancestors (@) All of the above An algebraic structure is monoid if it possesses one of the following properties (a) Closure and Associative (©) Closure, Associative and Commutative (c} Closure, Associative and identity (a) Closure, Associative, Identity and Inverse If A and Bare acute angles and sinA=cosB, then the value of A+B is equal to (a) 30" wy 75 i) 90° (a) 180° 16 587. The productions E> E+E|E-E|E+E|id (a) generate an inherently ambiguous language fb) generate an ambiguous language {c) are ambiguous (@)_ None of the above 58. In a certain code ADVENTURES is written as TRDESAUVEN. How is PRODUCED written in that code? (a) TUIPGSSRNP (®) IUIPGSRSNR () TUINGSSRRP (@)_ IRIPGSSNRR 89, if FRAGRANCE is written as SBHSBODFG, how can IMPOSING be written? fa] NOPTIHOS (b) NOPTIOHY fe} NQTPIOH (a) NQPTJOHI 60. Which of the following is true for Chomsky hierarchy? la) There are some regular sets that are not context-free (b) The set of type 0 language is a proper subsct of set of type 1 languages (cq) his a hierarchy of four classes of languages (@) It is @ hierarchy of four types of grammar rules 61. 52" ~1 is divisible by a 5 (wy -5 () 24 (a) -24 126-8 17 {P.T.O. 62, if PALE is coded as 2134, EARTH is coded as 41590, how can PEARL be coded in that language? fe) 25430 (by 29530 (ce) 25413 a) 24158 63, Which one of the following regular expressions is false? f (y= ) ny = tr)” tn) = Ry (4) None of the above 64. IT ROSE is coded as 6821, CHAIR is coded as 73456 and PREACH is coded as 961473, what will be the code for SEARCH? (a) 216473 (b) 246173 (©) 214673 (@) 214763 65. Which one of the following is true? (@) Mean + Mode = 3 (Mean ~ Median) (0) Mean - Mode » 3 (Mean - Median ) (Mean ~ Mode = 3 (Mean + Median ) (@) Mean + Mode = 3 (Mean + Median } 126-A 18 66, iin a certain code, GLAMOUR is write ; is written as LCNMWP and MISRULE is aston as OGUSSNC, then how will TOPICAL be written in that code? " (a) VMRJECN (b) VMRHAGS fo) VMRUACJ (a) VIRJABJ 67. 6° (Kleene’s closure of ¢, where @ is the empty language over 3) is equivalent to () ¢ (b) A (null string) ) £ (a) None of the above 68. If BE QUICK is coded as ZC OSGAI, then the code of the last letter of the third word in the sentence ] LOVE MY COUNTRY is fA &) 7 @ ¥ (aw 69. If ZEBRA can be written as 2652181, how can COBRA be written? (@) 30218) (3152181 () 31822151 (a) 1182153 126-8 19 [P.1.0. 70. n. 72. 73. /26-A Let S={A, C, T, G), The number of all subsets (power set) of Sis @ 4 o) 8 fe) 16 (a) 32 If ‘eraser’ is called ‘vox’, ‘box’ is called ‘pencil’, ‘pencil’ is called ‘sharpener’, and ‘sharpener’ is called ‘bag’, what will a child write with? (a) Eraser (0) Bag (6) Peneil (4) Sharpener Ix], O + 208° + (a) t0¢(2 &) Free) 3 (Hest) a a- 25 [Pro 92. 93. 126-0 cos® —sin® ne mates [Sing cost 0 Jora[5 $] onmue ermatcatin (a) ifa=b or @= nn is an integer (b) always () never (4) if. acos® # bsin® If A+B+C=n, then 1, tan A+ tanB+ tanC=tanAtanBtan€ aches Ca Aa: i. cot +cot2 +cot€ = cot cot Foot 5 A seat roots = cot eat cot I, tan2A+ tan2B+ tan2C= tan2Atan2Btan2C ‘Among the above three statements {, 1 and Ill, identify the correct statements {a) Only I and Il are correct {b) Only 1 and Ill are correct fo) Only 11 and Il are correct (4) All, and UL are correct For finite automata, which one of the following statements is false? fa) 8(g, 220) = B(5(a, x), 4) (o) 8(q, x0) = 5(q, wx) ©) 8a ed (d) 16 8(a, yl=8(q, x), then 8(g, x2)=3(q, ¥2) 26 98. The number of positive integral solutions of 15x, +x» + x3 $20 is equal to (a) 685 (bo) 785 (1180 (@) 1360 96. In the following expressions of relation algebra, the relations are R(a, b)and Sib, ¢: LT, y(R>

Potrebbero piacerti anche