. (Write Roll Number from left side cxacly sin the Admit Card) 2 2215 Question Booklet Series [a] PAPER-IIL Question Booklet No. Subject Code : 22 OMR Sheet No. COMPUTER SCIENCE iD APPLICATIONS Time: 2 Hours 30 Minutes Maximum Marks: 150 Instructions for the Candidates 1, Write your Roll Number in the space provided on the top of this page as well as on the OMR Sheet provided, 2. At the commencement of the examination, the question booklet will be given to you. In the first 5 minutes, you are requested to open the booklet and verify it i) To have access to the Question Booklet, tear off the paper seal on the edge of this cover page (ii) Faulty booklet, if detected, should be got replaced immediately by a correct booklet from the invigilator within the period of 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra time will be given. (iii) After this verification is over, the Question Booklet Series and Question Booklet Number should be entered on the OMR Sheet and the OMR Sheet Number should be entered on this Question Booklet 3. This paper consists of seventy-five (75) multiple-choice type questions. All the questions are compulsory. Each question carries two marks, 4, Bach Question has four alternative responses marked: (A) (B) (C) (D). You have to darken the circle as indicated below on the correct response against each question, Example: (A) (B) (D). where (C) i correct respons Example ®® O@ |, where © is the cowrect response 5. Your responses to the questions are to be indicated correctly in the OMR Sheet. If you mark your response at any place other than in the circle in the OMR Sheet, it will not be evaluated. Rough work is to be done at the end of this booklet. If you waite your Name, Roll Number, Phone Number or put any mark on any part of the OMR Sheet, except {or the space allotted for the relevant eniies, which may disclose your identity, or use abusive language or employ any other unfair means, such as change of response by scratching or using white fluid, you will render yourself liable to disqualification. 8, Do not tamper or fold the OMR Sheet in any way. If you do so, your OMR Sheet will not be evaluated, You have to return the Original OMR Sheet to the invigilator at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. You are, however, allowed to carry question booklet and duplicate copy of OMR Sheet after completion of examination, 10. Use only Blue/Black Ball point pen. 11, Use of any calculator or log table or mobile phone etc. is strictly prohibited. 12, ‘There are no negative marks for incorrect answers. [ Please Turn Over ]A-3 2215-1 Computer Science .d_ Applications Parer—UL 1. Consider the following circuit with D flip- 3. L, flops. Suppose P = 0, Q = I, and R = 0. What shall be L P, Q R after the clock edge? L Context-free Language Regular Language Context-free Language L, : Regular Language L,=L, AL, L,=L,UL,L,=L,UL, Which of the following is correct? (A) L, Regular, L, Regular, L, Regular Clock (B) L, is context-free, L, context-free, Q L, Regular (© L, context-free, L, context-free, L, context-free (D) L, Regular, L, context-free, L, Regular 2 : a1 e Clock } R 4. Consider the graph and its search tree ou aLe Clock f (A) 000 “& for generation of all cliques by back-tracking. How (B) 001 ‘many nodes are generated for this problem? © o10 (a) 15 (D) O11 (@B) 10 © 14 (D) 9 2. Consider the languages: L, = {a™b": m2 n) L, = (a* bed? m+n=ptq} L, = {a®b*: m= 2n} Which of the following is true? (A) L, is context-free, context-free. (B) L, is context-free, L, is not context-free, L, is context-free. ©) L, is context-sensitive, L, is context-free, 5. Consider the time complexities (I) of the following problems. P, : Fourier transform P, : Fast Fourier transform ,, Floyds algorithm for all pair shortest paths P, : Dijkstra’s shortest paths algorithm Which of the following is true? (A) TR) =T@P), TR) = TR) context-free, L, is P L, is context-free. B) Te) TP), TR) 1 and L= set of all square-free strings in E*, Which of the following is wrong? (A) Lis regular. (B)_L is context-free. (©)_L is context-sensitive. (D) L is recursively enumerative. 12, Consider the push down automation M=(K, ©, A, s, F) where (G.a,e), (8.4)),(5,b.e),(5.4)), (s.a.e).(fe)), (aa), (2), (Eb.a), (he))} Which one of the following is correct? (A) aaeL, babel, (B) baaaacL (©) abacl, baaeL (D) abbeL, baaeL13. The time complexity of Banker's algorithm is where P is the number of active processes and ris the number of resources (A) PP (B) PP © @) rp 14, A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority), The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule, Which among the following is time if the processes have no V/O operations and all arrive at time zero? The algorithm is equivalent to (A) First Come F (B) Shortest Job First (©) Round-robin scheduling (D) Shortest Remaining Time First irst Serve 15, In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on (A) the size of the blocks and the size of the address of the blocks. the number of blocks used for the index and the size of the blocks. the size of the blocks, the number of blocks used for the index and the size of the address of the blocks. None of the above. @B) © ) 16. are ‘The subcategories of orthographic projection “w @B) © ) Cavalier, cabinet, isometric Cavalier, cabinet Isometric, dimetric, timetic Isometric, cavalier, trimetric AS 2215-1 17. Assuming that one allows 256 depth value levels to be used, how much memory would a 512 x 512. display require to store the Z- buffer? (A) 512 KB (B) 256 KB (C) 1024 KB (D) 128 KB 18. A bilinear vansformation can be simulated by the transformations (A) @B) © (D) Translation, rotation and stretching ‘Translation and rotation Rotation, stretching and inversion Rotation, stretching, inversion and translation 19. With the line Y=X as the reflection axis, the reflection matrix is oor 010 1009) oi 0 100 0.04, ort 110] 104 Loo lo10 o1 Hue of a color is related to its “™ B) © @) (A) B) © ) 20. Luminance Saturation Incandescence Wavelength [ Please Turn Over |2215-HI 21. Increase in the size of a page in memory ‘management would result in (A) more intemal fragmentation always (B) more external fragmentation always (©) both (A) and (B) (D) cannot be specified for sure 22, In round-robin scheduling, the relation between the time slot and context switching will be (A) direct (B) inverse (©) cannot be specified (D) conditionaly inverse 23. The dispatcher involves some/all of the followings: (i) Switching context (ii) Switching to user mode (ii) Jumping to the proper location in the user program (o restart that program ‘The proper option will be. (A) @ and Gi) (B) (i) and iii) (© @, Gi and (ii) (D) Gi) and (ii) 24, Among the following four () Mutual exclusion (ii) Progress (iii) Bounded waiting and (iv) Circular wait a solution (o the critical section problem must satisfy (A) All the four above (B) ), Gi) and (ii) (©) Gi), Gii) and Gv ©) (@, Git) and Gv) 25.8 is a flat area of the search space in which a whole set of neighbouring states have the same value (A) Ridge (B) Shoulder (©) Plateau (D) Both (B) and (C) 26. Which of the following(s) is/are true? (A) BFS is mote time intensive than DFS. (B) BFS is less time intensive than DES. (C)_ BFS and DFS have the same time overhead. (D) Time overhead of BFS and DFS cannot be compared, 27. TE Cy (D) and Cy 4,9(D) are the time overhead of mean filtering and median filtering respectively of a digital image I of size m x n then which of the following is true? (AY Cypesug(D B) Cyecim l= ¢, © ¢, @ ¢ nx Cy, ‘Mean @ = log, (mn) x Cy...) = log, (mmxn) x C, Median Meas Median) 28. ‘The storage requirement of storing a true colour digital image of size m x nis, (A) 3mn bytes (B)_ mn bytes (©) 3mn bits (D) None of the above 29, JPEG format uses (A) Lossless compression (B) Lossy compression (©) no compression at all (D) selective compression 30. A single layer perceptron (SLP) is capable of (A) linear classification only (B) nonlinear classification only (C) linear as well as nonlinear classification (D) no classification at all 31. If A is a fuzzy set on universe of discourse X with membership function 4, (x), x € X, then (A) A®cA® whenever mn (D) A®=A* even if m @yid then FOLLOW (E) is given by (A) 0, $} ®B) (+). 8) (©) (+, %), 8} (D) None of the above 69. Type checking is normally done during (A) lexical analysis (B) syntax analysis (C) syntax-directed translation (D) code optimization 70. A state of an NFA is important if (A) it has a regular out-transition (B) it has €-dependent out-transition (©) it has non-¢ out-transition (D) it has no out-transition 71. In a programming language, an identifier is defined as a letter followed by any number of letters or digits. If A and N denote the sets of letters and digits respectively, then the identifier is represented by A AN* @B) AN) * © AW) @) (AUN) * 72. A grammar is left-recursive if (A) ithas a nonterminal A such that there is a derivation A 25 Act for some string (B) thas a nonterminal A such that there is a derivation A => Act for some string . (©) ithas a nonterminal A such that there is a derivation A 25 Act for some string (D) it has a nonterminal A such that there is a derivation A— Act for some stringACL 2215-1 73. Define Ics (x, y) as the longest common. 74. How many points with integer co-ordinates lie subsequence of two strings x and y as a string that is | in the feasible region defined by 3x+4y$12, x20, and a subsequence of both x and y and is as long as any | Y2!? such subsequence. Also define d (x, y) as the distance (a) S between x and y as the minimum number of insertion B) 8 5 © 4 and deletions required to transform x into y. ‘Then for De any two strings x & y, the distance between x & y and length of their longest common subsequence are 75. The solution of the linear programming problem Min Z = 5x, - 2x, related by such that 2x, + 3x,21, x,, x,2 0 is given by (A) dO, y) = bal + lyl — Qeles (x, yD (B) d &, y) = Ixl + ly! ~ (Iles &, yy) (A) x,=0, x,= 1, min 2 =~ 8/3 (B) x,=0,x,= 13, min z =~ 23 (C)_ d , y) = Int + Iyl + (Ves (x, yp) (©) x,=1,x,= 1/3, minz =~ 4/3 (D) None of the above (D) None of the above2215-HI AAI2 ROUGH WORK