Gees ICSI Section Tests TEST DETAILS 1, Engineering Mathematics .. 1,283 2. Digital LOgiC ssssessssereee 1, 2&3 3. Computer Organization 182 4. Theory of Computation svseeusT@st NO. 1,283 5. Data Structure and Algorithms .. Test No. 1, 2&3 6. Operating Systems ssusTest NO. 1&2 7. Database Management Systems .... sseeTest NO. 1&2 8. Compiler Design .. 1&2 9. Computer Networks . 1&2 10. Software Engineering and Web Technology 1 11. Verbal Ability. a 12, Numerical Ability. ‘ ise + TwGATE + ICP-Intensive Classroom Program + eTutort Online Test Series Sevoes Pv Ud, No par ol Wis baste ay be fepreduoadoruiizd nay om inoue writen parison,(re|SateFonum 0 Engineering Mathematics-I Computer Science Engineering Test I: Duration: 90 minates ‘Maximum Marks: 50 10, u. Read the following instructions careful Write your roll number, your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In caso you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. ‘This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each. Unrattempted questions will carry zero marks ‘The question pair (27, 28) is common data questions. ‘The questions pair (29, 30) is questions with linked answers. The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un- attempted, then the answer to the second question in the pair will not be evaluated NEGATIVE MARKING: For Q.1 to @.10, 1/3" mark will be deducted for each wrong answer. For Q. 11 to Q.30, 2/3 mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, Le. for Q.29, 2/3" mark will be deducted for wrong answer. There is no negative marking for Q.30. Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall, Rough work ean be done on the question paper itself, Webster wam.cateiorumcom Era: support@ gateforum.com ‘SA nighsrsarved by Catan onal Sauces PW No pai is Boot ay Bo opredieed ©” uiled iv any or wihout Haan eee ene tly cosston paper et wwe aitementorcom, _‘Test ID: 2121 (CSI Engineering Mathematics-1 Q. No.1-10 Carry One Mark Eac:. and B its adjoint matrix. If |8|= 64, then |A|= (8) 24 (© +8 (D) #12 Matrix A is such that A? = 2A-I, where Lis the unit matrix, then for n>2, A" = (A) nA-(n-1)1 (8) nA-I (C) P*A-(n-1)1 (0) 27A-1 If Az A? =I, then det(I+A) = (A) 0 (8) -1 m1 (0) 2 For a matrix A of rank r, (A) rank (A")r (D)None of these Let £0) 1 [f(x)dx is a f(1) =2.72, then from trapezoidal rule, the approximate value of (a) 3.72 (8) 1.86 (©) 1.72 (0) 0.86 By the application of Simpson's 1/3" rule for numerical integration, with three fi sub intervals, the value of [is divx 25 17 Gal ©) 17 (8) 3§ (c) Consider the matrix arta)-(5 2), What is the element aiz of A? ) (A) 1 (8) 0 (C) -1 (D) 3/2 If the correlation coefficient between x and y is 0.28, covariance between x and y is 7.6 and the variance of x is 9, then the SD of y is (A) 9.8 (8) 10.1 (C) 9.05 (D) 10.05 The probability that a contractor will get a plumbing contract is 2/3, probability that he will not get an electrical contract is 5/9. If the probability of getting atleast one contract is 4/5, what is the probability that he will get both? (A) 1/4 (8) 3/4 (C) 14/45 (D) 11/12 ‘DiArgh esered by Gaston Eascaior Intensive Classroom Program + eTutort Online Test Series Tom + Comespondence Course + TaGAt eae Pr ld. No pa te boots maybe (oprOSuSed or UH Without the written permission, 310. 1. 12. 13. 14, 15. Test DD: 2121 1CSi Engineering Mathematics-1 If A and B are two events with P(A) = 0.4, P(B)=0.3 and P(An8)=0.2, Find P[A UB] and P[AnB] (A) O.1and0.9 (8B) 0.8and0.1 — (C) 0.2and0.8 —(D)0.9 and 0.1 Q. No.11-30 Carry Two Marks Each The characteristic equation of a 3 x 3 matrix A is defined as a(n) =[al-A)= 09 +22 +2041=0, then At (A)-A? + A420 (B) A?+A+I (©) -(A?+A+1) (0) -(A? + A421) 6138 426 -1l ? What is rank of |) 39 > 16 4 12 1 i (8) 2 ©3 (D)4 Let A and B be 3x3 matrices such that AT = a skew symmetric matrix for (A) A=3 (8) A= \ BT =B, then matrix XAB+3BA is (C) 4=3 or A=-3- (D)None of these The system of equations x+ay+az=0 bx +y+bz=0 ox+cy+z2=0 where a, b and ¢ are non zero and non unity, has a non trivial solution, then the a b c lue of 24D, _¢ = value of i=ai=6 =e abc (A) 0 B) 1 (C) -1 D0) = @) (8) ©) © sre Consider the polynomial function (x List I with List IT 28 + Sx-7 for x=-1,0,1,2,3,4,5. Match List 1 List 11 P | af) 1/6 Q | A% 2 | 24 R | F(a) 3) ay s | a*(0) alo (A) P-2, Q-1, R-4, S-3 (B) P-1, Q-2, R-3, S-4 (©) P-2, Q4, R-3, S-4 (D) P-4, Q-3, RA, S-2 + Correspondence Course + TwGATE + ICP_Intensive Classroom Program + eTutor+ Online Test Series ‘Tigi osorved by Galo Eaucatonal Servees Pv. Ld. Nop ol is bool may be eptGdiond or ubaad ih any Tom ‘shout the writen parmissin.Ge 16. Calculate af (39) and Af (38) for the data given below. ‘Test ID: 2121 ICS! Engineering Mathematics-1 x | 35 36 37 38 39 40 at y | 14.298 | 14.144 | 13.986 | 13.825 | 13.661 | 13.495 | 13.328 (A) 0.166, 0.002 (8) -0.166,-0.002 (C) 0.002, 0.166 (D) -0.002,-0.166 17, If¥o =3, ¥; =12, ¥42 = 81, y3 = 200, yg = 100, then findA*y,. (a) 256 (B) 144 (© 259 (D)-259 18. Given eg |e ez | ara | ston |faton| (2 y | 2.72 | 3.32 | 4.06 | 4.96 | 6.05 | 7.39 ; Find and *Y. at xat.2 dx dx’ (A) 3.3125 and 3.9375 (8) 3.9375 and 3.3125 (©) 3.21 and 3.19 (D) 3and 4 19. 2% of the fuses manufactured by a firm are expected to be defective. Find the probability that a bus containing 200 fuses contains 3 or more defective fuses. (A) 0.4321 (8) 0.5871 (C) 0.9817 (0) 0.7621 20. One hundred identical coins, each with probability P of showing up heads are tossed once. If 0 AB=|A] (Since 8 = (adjA)) = |Ae|=|AP 7, [AlIl=|AP's [Al64=|aP |AP? = 64 [A] ==8 2 For n=3, A? = A.A? A(2A~-I) = 2A? -AL Now Substituting, n= 3 in option (A), wehave = 2(2A-1)-A =3A-21 = 3A-(3-1)1= 28? ~ AL Hence, A Option is correct 3 At Mala (A+N(A-1)=0... (a) let|A+1| #0, then (A+I)* exists Multiplying ,(A+1)* to (1), wehave (AH) (A+1)(A-1) = (At) 0=0 1(A=1) =0; (A-I)=0 = A=I, which is a contradiction Hence, |A+I] = 0, =¥o =Y Yo ax +x By Simpson's Rule, 2 + Correspondence Course + TarGATE, ‘S Alnighes reserved by Gatton Educator ‘ganna fo samen porndasion.eet Test ID: 2121 ICSI Engineering Mathematics-I eee ey - At= (32-22) 8. = OMY) _ 9 2g- o.Sy 10, P[AUB]=P[ANB -P(A(1B) =1-0.2=0.8 ‘The event B can be written as B{AMB)U(ANB) and ANB and ANB are disjoint events = P(B)=P(ANB)+P(ANB) -. P(ANB)=P(B)-P(ANB)=0.3-0.2=0.1 11. We know that, every matrix satisfies its characteristics equation AP +A? +2A41=0 At[AR + AR + 2AGT AP 4+ A424 4 = 0; At =-[A? +A+2t] 12. Given is a 4x4 matrix and we can have minors of order 1,2,3,4. \6 13 8 42 6 -1 linor of order 4 I . Minor of order 4is |, 3 5 J] =0 he 3 121 6 1 3 Minor of order 3=|4 2 6| Apply R;-R, 10 3 9| ee =|4 2 6=0 (-R,=R3) 614 Similarly by applying R, -R, we can show that two rows of each of the minors of order 3 are identical and hence they are zeroes. j- k #0; « p(A)=2 “+ Comespondence Course + TwGATE + ICP-Intensive Classroom Program + eTutort Online Test Series ‘B Airis vara by Gatatoram EdveaTonal Senvens Pt Ad No pat le Doone tay be rpreduzad or vlaaainany om winout he win parison 9Test ID; 2121 ICSI Engineering Mathematics-1 13. [AAB+3BA]" = 2(AB)' +3(BA)' = BTAT + 3A7BT =4(B)(-A) +3(-A)(B) [AT =-A, BT =B) =-ABA~3AB = -(3AB + ABA) = 2-3 14, For non ial solution, 0; operate C, - Cz, C.-C, 1a 0 a lb-1 1-b | 0 c1 4| Divide by. (a-1)(b- 1) (¢—1),we have We get = (1-a)[(1-b)-b(c-1)]+a(b-1)(c-1)=0 15. f(-1) =-13; £(0) = -7; f (1) =-4; F(2) = 14; £(3) = 35; £(4) = 77; F(5)= 143 The difference table for this f(x) is shown below First Second Third Differences Differences Differences ‘ 2 ‘ 6 12 6 24 R 6 42 6 a 24 X= 5 af (-1) = ayg = 6 af(2) = Vy = 24 °F (0) = a?y, = 6 A*f(1) = A®y, = 12 VE(5) = Wve = 66 VE (2) = Vy3 =12 vt(4) = vy5 = 18 v'f(1) = Vy, =0 + Correspondence Course + TatGATE + ICP-Intensive Classroom Program + eTulor¢ Online Test Series ‘Singhs resovedby Gastorur EaucatonalSonices Pid No pa te bookt ray bo reproduced o ulzad inary em without tho win pamisin. 10‘Test ID: 2121 (CSI Engineering Mathematics-1 18. a ae ° Di x | y | 1 bifference Difference | #” Difference 1/272 0.6 12 | 3.32 0.14 1.4 | 4.06 on 0.16 a 0.01 16 | 4.96 ae 0.19 Oe 0.03 1.8 | 6.09 re 0.25 : 2_| 739 : gy el +4 ao He vaaleres x0.16 + 4x0.03 10.03] 3.3125 a Sal me once 003+ $4 x0.03| 9375 Ohaa (0 7 p-2 -0.02 | 19 100 } mis very large, p is small n= 200, p=0.02) X can be treated as a Poisson value with parameter 2=np=200%0.02=4 eta P( 14,2, zx P[3 or more defectives] = 1-p[x < 3] =1-e4[1+4+8]= 0.7621 —[P(0)+P(1)+P(2)] 20. — Given 1°C,.q°p5? =1° C,.q4%p*! = 51q= 50p => 51(1-p)=50p, p= ir 21. The two balls drawn may be both green, one green and one red or both red. In these cases, the man receives 40paise, 30paise’and 20paise respectively. Let X be the amount the man receives. Then 3, A 5C. P[x=40] = P[both green] [lone green one red]= 2¢, P [both redj= 5c = 0.8 2 Probability distribution of x is x_[40] 30] 207 [| P(x)[0.3/0.6/0.2] | | E(x) = ExP (x) = 40% 0.3 + 300.6 +20%0.1 = 32paise “+ Correspondence Course + TarGATE + ICP-Intensive Classroom Program + eTulor+ Online Test Series ‘DATrghtewexarved by Galefour Educnonal Sevions PL. No parol is bool ay be eprcdiced or ized many Tm trou th writ permission. aaTest ID: 2124 (CSI Engineering Mathematics-I 22, If fis the p.d.f. of X, then Dre o¢3-(3 y +(3)+ 23. The sample space is given by S={(xy):xyeN1 a= V2 25. Mode = 8, since frequency is maximum for 8. 3 P(A)=§ \ For atleast 2 hits, we have 26. P(8)=2}/ 2. allthe three can hit | ( - 23,244 pie)= 4] (PAB) = PAPO) PLC) =§ 2.4| + Comespondence Coune + TaGATE + ICPlntensive Classroom Program + eTutor¢ Online Test Series “Tihs reserved by Galsonum Eavcatona Ta No part off books! may bo rproaiead or uaedin ary om ‘trou to wn permission, a2Test 2 2121 ICS! Engineering Mathematics-1 2, Band C hit, A misses it = P(A).P(B) P(C) = 3. A and C hit, B misses it = P(A) P (B) P(C) = -P(2 short hit) = 2 « 3 ole we (6-x-y)dxdy = ore 13 27. P[xP (D)P (QP) + Comespondence Coune + TatGATE + ICP-Intensive Program + eTuiore Online Test Seve ‘Darah ecored by Galion Educatonl Sewoes Pvi Led No parol fs Booklet may be repreduzedor ulna any Tom ‘wrote wnonpemisson 17(oesateronum ‘Test ID: 2122 (CSI Engineering Mathematics -II 9. Which of the following is false? (A) P3PLQ (B) Q>PLUQ (C) PnQaP (D) P>PnQ 10. For the graph shown below, which of the following are cut sets? A F (A) {CD} (8) {EG} (C) Both (D)None of these Q. No, 11 - 30 Carry Two Marks Each 11, For a simple bipartite graph with v vertices and e edges, which of the following equations is true? ve v 2 ve + B) ex < se (a) e=9F (8) ez — Oesv (Dyes 12. What is the cost_of the minimum spanning tree for the following graph with Kruskal algorithm? (A) 12 (B) 14 (c) 16 (D) 18 13. Let G be simple graph with 30 vertexes, 40 edges and independent number of G is 8, then vertex cover of Gis (a) 8 (B) 22 (©) 40 (D) 30 14, Gis a connected planner simple graph with 'e’ edges and ‘v’ vertices. Let r be the fnumber of regions in a planar representation as G, then (A) r=etvt2 (B) r=e-vt1 (C) r=etv+i 15, What is the first order predicate calculus statement equivalent to the following? “Every child is liked by some person” (A) v(x)[child (x) + 3(y) [person(y) a likes (y,x)] (B) v(x)[child(x) + 3(y)[person(y) = likes (y, x)] (C) ¥(x)[child (x) .3(y) [person(y) — likes(y, x)] (D) 3(y) ¥(x)[child (x) + [person(y) a likes (y,x)] + Conespondence Course + TaGATE + ICP- Intensive Classroom Program + eTulor Online Test Series ‘Gin rghs resorvedby Galeton Eavcatonal Sonices Pv Ls No par ois book maybe reproduced or ula a ay form virout tte witan parmsson. 18Ge Test D: 2122 (CS Enginerng Mathematics 16. — Consider the following statements: S, :~ [3x,[~ F(x)] = none false S, i~ [vx,[~ F (x)] = none true (A) S; is true and S, is false (B) S, is false and S, is true (C) S,& S, are true (D) S, & S, are false 17. Consider the following statements: Pi: (AB) AC)=((AaC) + (BAC) P2: ((A>B)vC)=((AvC) > (BvC)) Which of the following is correct? (A) P1 is valid but not P2 (8) P2 is valid but not P1 (C) Pi and P2 are both valid (D) P1 and P2 are not valid 18. — An undirected graph G has n nodes. Its adjacency matrix Is given by ann x 0 ‘square matrix, whose 1, Diagonal elements are 0's and 2. Non-diagonal lower triangular elements are all distinct Which one of the following is true? (A) Graph G has no minimum spanning tree (MST) (8) Graph G has unique MST (C) Graph G has multipte MST (D) None of these 19. The chromatic number of wheel graph with 5 vertices is (A) 3 (B) 4 (5 (D) None of these 20. Which of the following statements is/are false? 1. Minimum spanning weight tree is unique for a graph. 2. Prim’s and Kruskal’s algorithm give the same minimum weight spanning tree. 3. Minimum weight spanning tree is unique if graph has unique weight. (A) 1 only (8) 283 (C) 1,283 (0) 182 21. Consider the following statements: Pi: ((AsB)<—3C) = (AC) a(Berc) P2:((AvB)<—3C) =(A oC) vB 0) Which one of the following is true? (A) P11 is valid, but not P2 (B) P2 is valid, but not P2 (©) Pl and P2 are both valid (D) Both Pi and P2 are not valid + Conespondence Course + TuGATE + ICP-Intensive Classroom Program + efuior Online Test Series Bi Li. No pao hs Bock may be reproazes 19ey Test ID: 2122 1CS1 Engineering Mathematics -IL 22. — Which of the following is independent number of K;,? (A) 3 (8) 6 (9 (D) 18 23. Which of the following represent degree sequence of a simple graph? Le 2,2,2,2,2,2 2. 3,3,3,3,6 3. 1,2,3,4,5, (A) t only (8) 2only (C) 3only (D) All of these 24, — Which of following statements are true for planar graph? 1. It always has Hamiltonian circuit, 2. It is always connected 3. Italways satisfies r=e-v+2 4, It always satisfies e< 3v-6 5. It will have vertex cover of size at most 3/4 6. Ithas independent set of size at least n/3 (A) 12,45 (8) 1,2,5,6 (©) all (0)3,4,5 25. Consider the following statements; A&B) aC) = ((AnC) o (BNC) P,:((A @ B)v C) = ((AUC) & (BUC) Which of the following is true? (A) Pris valid but not P, (8) P2 is valid but not P, (C) P; and P, are valid (D) P, and P, are both not valid 26. Number of match edges in Kg is (A) 2 (B) 3 (4 (0)5 Common Data Questions: 27 & 28 Consider the graph given below: 23 6 7 6 el ew F 2 1 ——-+ aa 27. Number of distinct minimal spanning trees that can be formed with Kruskal’s algorithm is aye (8) 4 we (D) none of these 28. What is the cost of minimal spanning tree using prin. 's algorithm starting with vertex ‘E?’ (A) 26 (8) 23 (27 (D) none of these + Comespondence Course + TaiGATE + ICP-Intensive Classroom Program + eTwior+ Online Test Series ‘© Arig asrved by Gael Eductoral Sarcas Pv No prio is Booka ay be eproSaced or ulizedin ay fh ‘wore writen pamisscn 20 ee Neen ee29. 30. Test ID: 2122 ICSI Engineering Mathematics -II Statement for Linked Answer Questions: 29 & 30 Let ‘k’ be the number of variables of a propositional function Number of distinct propositional functions is (A) () 2* © 2 (o)2* For what value of k, the number of propositional functions will be 512? (A) 23 (8) 3 (on) (0)5 “+ Correspondence Course + TarGATE + ICP-Intensive Classroom Program + eTutort Online Test Series ‘G-Airigtsosarved by Gallon Educational Sevieos PL. No art ol fis Bookt ray Bo reproduced or uilzadinany fom: ‘tno the writen poisson aaoi Test ID: 2122 1CSI Engineering Mathematics II Answer Keys aio o{[3;/o}/a4/e|s{a}leé}ci}|7/a s|alo9|o|{20| c}]a2] 0 {12} a | 43] B | 14] D 1s | a | 16 | a | 17| 8 | a8| 8 | 19] A | 20| D | 2] dD 22| 8 | 23 | a | 24| o | 25| 8 | 26/ B | 27| A | 28| B 29| 8 | 30| 6 Explanations: For any complete bipartite graph, chromatic number is 2. Vertex cover of Ky is n-1 = 7 G,, G, both are planar Ge B Number of spanning trees for complete graph K, isn Pp q ~a Poa [wpa(poa)|~p | ~da~p 0 0 1 1 1 1 1 0 1 0 1 0 0 0 1 0 1 0 0 _|o 0 1 1 0 1 0 0 0 P+Q=-PLQ (A) P9(PrQ) =~PU(P AQ) (PP) A(~w PQ) = TA(~PrQ) = (~PQ) (8) PU~P= Tautology (©) (P>Q)uP (~PUQ)UP (~PUP)L@ TUQ =T= Tautology ‘Arighis served by Gaeorum Eaueatoral without ho win pores. “ Comespondenve Coume + TAGATE +Test ID: 2122 (CSI Engineering Mathematics -II 11. Let us assume x vertices on one side. So v-x on other side no. of edges in this graph will be: e=xx(V-x) =vx-8 We want to maximize de ¥( SE =-2; $0 e,, = | ox nex = 13. Vertex cover + line independent number = no. of vertices Vertex cover = 30-8 = 22 14. For any simple planner graph, the eq. v+r=e+2 holds 17. a [e [c [ase [anc |8nc |(A>8)nC] (anc) > (Bn) ofolo| a o | o 0 1 ofo[i/ 1 | 0 0 a | olafo] i 0 |-o 0 1 ofifial i ofa 1 1 t[o;o| o (om Eo 0 1 Tin a 1 [0 o 1 tfifo[ 2 o | o 0 ° fafata ta a [4 1 1 For A=0 B=0 C=0 PL (00)00) =(0A0) +(000)=0=1 ale [c [as [auc | Buc] (A> 8)UC] (AUC) > (BUC) o fo [a oye |fomea| i =n Om nal 1 1 1 fo [a [o [a o |i [a 1 of fafa 1 2 ft 1 1fo [o jo 1 [o |o Q 1[o [1 fo 1 ff 1 ng (fies |fom |e fae) eee fa 1 th fb fh 1 ff 1 18. The graph G has unique MST as it has all weights distinct and it is Ky, 19. The chromatic number of wheel graph = 4 (if no, of vertices is even) = 3 (if no, vertices in odd) + Comespondence Course + TarGATE + ICPintensive Classroom Program + eTutor+ Online Test Series ‘Tiairgne esorved by Gawlonm Eaveaonal Seas Pvt Li) No sar of is Boot may ba eprodleed oF andin any Tom ‘wtrout a wien pormisson 23Gee 20. There may be more than 1 minimum lot spanning tree possible. Prim’s and kruskal’s algorithm can give different minimum spanning tree ‘Test ID: 2122 (CSI Engineering Mathematics -II 21. Consider A=0;B=1; C=0 PL (040) = (04 O)a(1oo) 1=1,0 1=0 P2: (AvB) oC #(AGC)v(BoC) 31608060v(100)20-1v05021 22. The independent number of Kmnis max(m,n) 24D) ‘ 3. Planar graph always satisfies eq. r=e-v+2 4. Planar graph always satisfies eq. e<3v-6 ! 5. Planar graph has vertex cover of size at most 3n { 25. ale[c[ aes anc] auc [anc [Buc] @osync | anc Bac |(Ae8ve) ofofo| 1 | o 0 o | o 0 1 1 j ofola] 1 | o 1 of 2 1 1 1 ofrfo[ o | o 0 oft 1 1 0 ofalat o | o 1 1 [4 0 o i : tfofo{ o | o 1 o | o 1 1 0 7 tfol1{_o | 1 1 o [4 0 0 1 ififof 1 [0 1 1 [1 0 0 1 tfrfa{ 4 1 1 1 [1 1 1 1 We will get (AUC) © (BUC) same as ((A © B)vC). Hence P2 is valid. P1 is not valid. . 26. Number of match edges in K, is |6/2]=3 27. If we run Kruskal’ algorithm, we will get spanning trees as. | {AC, AB,BD,DE,EF,FG,GH} ¢ {AC, CD,BD,DE,EF,FG,GH} {AC, AB,CD,DE,EF,FG,GH} , {AC, AB,BD,DE,EF,FH,HG} {AC, CD,BD,DE, EF,FH,HG} {AC,AB,CD,DE,EF, FH,HG} + Comespondence Course + Ta GATE + ICP-Intensive Classroom Program + eTwior+ Online Test Series ‘DA reserved by Gallon Educational Sanicns Pv Ui. No par of his boots maybe reproduce or ulzedn ary fr wiout re writen permission 24 iTest ID; 2122 (CSI Engineering Mathematics -II 28. If we run prim’s algorithm 29. The number of distinct propositional functions = 2" + Conespondence Course + THGATE + ICP-Intensive Classroom Program + eTutor+ Online Saas een Gaon Esato Sri Po Le opal Sista neyberenoeasruainanyiom ‘winout no writen pormisionEngineering Mathematics-II Computer Science Engineering testip: [2] 1] 2 Duration: 90 minutes ‘Maximum Marks: 50 10, u Read the following instructions careful Write your roll number, your name and name of the examination center at the ‘specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. ‘This question paper contains 30 objective type questions, Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each Unvattempted questions will carry zero marks. ‘The question pair (27, 28) is common data questions. ‘The questions pair (29, 30) is questions with linked answers, The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is um- attempted, then the answer to the second question in the pair will not be evaluated. NEGATIVE MARKING: For Q.1 to @.10, 1/3 mark will be deducted for each wrong. answer. For Q. 11 to Q.30, 2/34 mark will be dedueted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ie. for Q.29, 2/3% mark will be deducted for ‘wrong answer. There is no negative marking for Q.30. Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall. Rough work can be done on the question paper itself, Website: won. gateforum.com Email: Support@gateforum.com ‘GA rg resewd by Gatalrum Eaucatonl Sevens PL No pal Wis Basket ray bs repruod o ized any frm wut ‘ho writen cemiation Diese ts question panera wan. gatomenter.com, 7‘Test ID: 2123 1CSi Engineering Mathematics -IT Q.No.1-10 Carry One Mark Each 1. Total number of bijective function from set of 6 elements to set of 6 elements is (A) 2° (8) @ © 6 (0) 6 2. Positive integers are _ _____under uivision, (A) Reflexive (B) Transitive (C) Anti-symmetric (0) Partial ordered 3. Total number of symmetric and reflexive relations on set A with |A| = 20 is a (207420) (20%-20) (A) 22 (QO) an (c) 22 (D) 27° 4. Let (A,*) be group over set A xe A, then which of the following is true? (A) * is closed and associative operation (B) A has unique identity element (©) Every element in A has inverse (D) All of these 5 Let P ad Q are subsets of universal set U and complement of set P of U is denoted as P*. Find [eoeoe)} oof (A) PE (B) & ju (Dye 6. The number of subsets of the set {1, 2, 3,....,k} with even cardinality is (A) 24-4 (B) 2** (c) 2 (0)2 7. Total number of functions from a set of 8 elements to set of 10 elements is (A) 10° (B) 8° (C) 80 (0) 10! 8, Let A, B and C be three non empty sets, then(A~C)(C-B) is (Aya (8) 8 (cc we 8 tue MV then xa yh ~ a y ax Yay (A) (a/28)u @) (4) (©) (1/13) (D)None of these 10. Find the number of ways of arranging the letters of the word GATEFORUM such that all the vowels come together. (A) 16380 (8) 720 (©) 2880 (017280 + Comespondence Course + TwGATE + ICP-Intensive Classroom Program + eTulort Online Test Series ‘Dlr xarve by Galloran Eaueatonal Senos Pu Ll No pa lh Book! may be repreduzad or wed many om vhou he writin parson 29Test ID; 2123 {CSI Engineering Mathematics -III Q.No.11-30 Carry Two Marks Each 11. Consider a binary operation @ over a set of {2,2,4,7,8,11,13,17} aob=axbmodis What are inverses of 8 and 7? (A) 2,8 (B) 11, 13 (©) 2,11 (D)None of these 12. Consider the binary relation R and S on non-empty set A. Both R and S is transitive. Which is true? 1. ROS is transitive 2. RUSiIs transitive 3. R-Sis transitive 4. S-R is transitive “(Ay 1 (B) 2 (C) All (D)1, 2 13. The set{0,1,2,3,4,5,6,7,8,9,10} under multiplication modulo 11 is 1. It is closed 2. It forms a group 3. It does not form group because identity does not exist. 4. It does not form group because O does not have inverse. (A) 1,2 (8) 1,3 (©) 1,4 (D)3,4 14, Let A, B, C be arbitrary sets a. (A-B)-C=A-(BUC) c. (A-B)-C=(A-C)-B c (A-B)-C=(A-C)-(B-C) Which of the following is true? (A) a,b (B) a, b,c (C) bc (D)a,c x2 + 5x43) 15. — [ees (A) ef (B) & (C) (Dye 16. Ifet =x", then y has a (A) Maximum at (C) Maximum at x (B) Minimum at x= e (D) Minimum at x= e* +60 ce Course + TaGATE + ICP—Intensive Classroom Program + eTutor+ Online Test Series ‘© Argh rosrved by Gaslorum Eauoatonal Sanices Pv. Lid No pa ie Bookie maybe reproduoed or uz n any om ‘wut ne writen permissen 30iG) 17. Asubset relation over set A = {1,2,3,....10} Is Test 1D: 2123 1CS1Engineering Mathematics -IIT 1. Reflexive 2. Symmetric 3. Anti-symmetric 4. Transitive 5. Poset 6. Asymmetric (A) 12,4 +(B) 1,3,4,6 (C) 1,3,4,5 (0)1,2,6 18. How many ways can 4 boys and 4 girls be seated around a round table such that no two boys are adjacent? (A) 144 (8) 576 (©) 256 (D) None of these 19. Inverse of function exists if and only if (A) it is surjective function (B) itis injective function (C) itis bijective function (D) itis constant function 20. Given, F is function from C to A and G is function from B to C. Given FoG is injective. Which of the following is true? (A) F must be injective but G may not be so (B) G must be injective but F may not be so (C) Both F and G must be injective (©) Both F and G not necessarily be injective 21. Consider the binary operation © over set of Z, ={0,4)---.0.n- 1} {a+b ifatb Online Test Series Tihs reserved by Gatsorum Eauosional anvene Ov. Li No pat oie Booket may ba raproded ruiz nay form ‘nth te wn sams. 32 éGi Answer Keys Test 1D: 2123 ICSI Engineering Mathematics “IT D o[s|/cle/sl[7]a 8 po faz] a [a3|c | sa] 5 | A fava) Wage ce |a209| 80m ease eo) io Bal|p268 eeu f278| eeu azole 1. Number of bijective function on set, with 6 element is 6!. 2. Divide relation over set of +ve integer is reflexive, antisymmetric and transitive. Hence it is partially ordered relation 3. Reflexive means all diagonal should be present and symmetric means one half z J has choice = 2: 8. [fer(pne}} ng] 10. The given work Is GATEFORUM Vowels are A, E, O, U (that is 4) Now consider all the vowels as one unit and the remaining 5 as 5 units that is a total of 6 These 6 units can arrange themselves in 6! ways Also the 4 vowels can arrange themselves in 4! ways Hence total number of arrangements = (61)(4!)= 17280 + Comespondence Couise + TwGATE + ICP—Intens Pvt id No par of is Bock may be reproduc or uted Tassroom Program + eTutor+ Online Test Series yon twiton prmssion 33(Seen Test D: 2123 ICS Engineering Mathematics I 11. Doesn't form group since the operation is not closed. For example, 4011=44mod15=14 is not in the set. 12. RaSis transitive RUS=R{(1,2)} S{(2,17)} RUS={(1,2)(2,17)} not transitive Ref{(1,2)(2,3)(1,3)}; S={(1.3)} R-S-={(1,2)(2,3)} not transitive R={(,3)}; S{(2,2)(2,3) (1,3)} S-R ={(1,2)(2,3)} not transitive 13. It is closed but 0 does not has inverse. So it does not form the group. 14, Allare true on Venn diagram, ors 15. us [eSee3P ou (1 Pets xo EXD | OH ss f Pexet Jeol x(éxet) 4x41) eer | ena le aoltan 2 afl Fexea) | J dy _Inx- 16. x=yinx, 2 =!9X-1_9 = x= e(max vinx, = (max) 17. asasoreflexive asB=BcC B-C =6 Hence, n(B-C) = 0 + Conespondence Course + TaGATE + ICI ensive iassroom Program + eTulor+ Online Test Series ‘Sighs resovoaby Gaeloum Edcatonal Sewions Pt Ls, No sr of hi booklet may be reproduced or utlan@in any Tom ‘wthout he writen permission 35(TEISATEFORUM Digital Logic-I Computer Science Engineering te: 2] 1] 2] 4 Duration: 90 minutes Maximum Marks: 50 Read the following instructions carefully: 1. Write your roll number, your name and name of the examination center at the specified locations of the ORS. 2, Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code, 3, All the questions in this question paper are of objective type 4. Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. estions. Q.1 to Q.10 carry one mark This question paper contains 30 objective type at each and Q.11 to @.30 carry two marks each. 6. Unvattempted questions will carry zero marks. ‘The question pair (27, 28) is common data questions, 8 The questions pair (29, 30) is questions with linked answers. ‘The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un- attempted, then the answer to the second question in the pair will not be evaluated, 8.» NEGATIVE MARKING: For Q.1 to Q.10, 1/3" mark will be deducted for each wrong answer, For Q. 11 to Q.30, 2/3" mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ie. for Q.29, 2/3" mark will be deducted for wrong answer, There is no negative marking for Q.30. 10. Caleulator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall. 11, Rough work can be done on the question paper itself. Webster wana gateforim.com Email suppon@guteforamcom {SATs ose by Gaon Easataal Sevens PCa No pl Wi esa mayb op'loead f iledin any im wou the win partie acs fs uso pape! ew alomertocom 7Test ID: 2124 ICSI Digital Logic Q. No. 1 - 10 Carry One Mark Each 1. Expression A + AB +ABC + ABCD + ABCDE can be simplified to (A) AB+BC +CD+DE (B) A+B+C+D4E (C) AB+BC+CB+DE (D) AB+BC+CD+DBE 2. The minimum number of NOR gates required to implement A(A+B)(A+B+C) is Ao (8) 1 (3 (0)5 3. What does A ~ B implement? (A) ABY (8) AB (A+B (A+B 4, Minimum number of NAND and NOR gates required to implement the function EX-OR gate, respectively is (A) 5,4 (8) 4,4 (O55 (04,5 5. Absorption theorem is given by (A) x1 = (B)x+1=1 (C)xx (D) x(x + y) = x 6. __ If M-represents the Maxterms f = M,M,M,M.M, then f = (A) AB+C (B) (A+B)C (C) C+A.B (oc 7 ‘Simplify the following Boolean functions to minimal SOP form: F(X, ¥, Z) = XV" + X'Z + XY + YZ! (A) x+y (B) x+y’ (C) xy+x'y’ (D) None of these 8. Which one of the following statements is correct? (A) RAM is a non-volatile memory whereas ROM is a volatile memory (8) RAM is a volatile memory whereas ROM is a non-volatile memory (C) Both RAM and ROM are volatile memories but in ROM data is not lost when power is switched off (D) Both RAM and ROM are non volatile memory but in ROM data is lost when power is switched off 9, The logic expression X +x is equal to (A)xty (8) X+y (C) x+¥ (0) xy + Correspondence Course + TwGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘Digna rosared by Gawlnum Educational Sevens PU No pa ol Bis boo ay be epioauced or znd mary TOM inoue writen parison aTest ID: 2124 ICSI Digital Logic-I 10. The logic expression AB+ ABC+ ABD equal to (A) A¥B+C+D (B) ABCD (©) A+B (O)A+B . Q. No. 11 - 30 Carry Two Marks Each { 11. The number of Minterms and Maxterms corresponding to the expression £(A,B,C) = A+B+C is respectively (A) 3 and 5 (8) Sand 3 (C) 4and4 (0) 7 and 1 Truth table for the combinational circuit is shown below. The minimum number of two input NAND gates required to realize this logic circuit is A B Cc 0 0 0 0 0 1 0 1 0 a 4 i : 5 Combiner fa 1 0 0 1 0 1 1 1 0 1 1 1 (A) 3 (8) (5 (D) 6 13. The function F = CD+AD+8D+ABT+ ABCD can be realized with help of A (8) (©) (0) “+ Correspondence Coune + TwGATE + ICP-lniensive Classroom Program + eTutor+ Online Test Series ‘Daighsresrvedby Gelato EaccatonalSonices Pv No pao is bots hay be oproaioed or uized any Toe bout witan prmisin. 40 4eros 14. Find the expression for F for the circuit shown below. Test U (CSI Digital Logic-1 ee Area > Flore) (A) F=A@BOC (B) F=(A+BC)+(A+B8C) (C) F=AB+AC+BC (D) F=(A¥BC).(AB+C) 15. Output (F) for above circuit will be (a) x @)1 (® (0) Zero 16. The circuit shown below is of a a — —D— * =D f (A) Adder (8) MUX (C) Subtractor —_(D) Buffer 17, F=A®BOCED in SOP form is (A) ¥(4,3,5,7,9, 10,13, 15) (B) ¥(0,2,5,7,13,8,9,15) (©) Y(4,2,4,7,8,11,13, 14) (D) ¥(0,3,5,6,9,10, 12,15) 18. A four bit standalone binary full adder is constructed with three full adders and ¥ + (A) x+y (B) xy +3y (Ox 22. In the given circuit, F= DDH (A) AB + AB Lp (B) AB+AB (C) A+B (D) AC + BC (8) ABC + ABC + ABC + ABC (D) None of these ==) (D) None of these + Comespondence Course + TaGATE + ICP-Intensive Classroom Program + eTulor+ Online Test Series ‘TiAl rghs esarvedby Gaalour EdatonalSenices Pi Ud No pa a is bola ay ba reproduced or ulaed any for wihout he wntan permission. a2eee Test ID: 2124 ICSI Digital Logic: 23. The Karnaugh map of a four variable function F(w, x, ¥, 2} the function is a wx\ oo ot 3110 given. In POS form, 00 te al fafafe ufafafe|e 10 a: (A) F =(W+2z)(y+z)(w+x+y) (B) F = (w+z)(W+x)(¥+2) (C) F=(w+z)(w+y)(W+x+y) (D) F=(W+z)(¥+z)(W+x+y) 24. — Karnaugh Map of a function is given below. In SOP form, the function is yz wx\ 00 021110 oo} 0 | o alo lols a ofo 10 o}e (A) w2+yz+Wixy (B) Wy +z (©) wy +z (D) wz +9 25. The given circuit is that of a b ) ——] =De D> 1 Q (A) Multiplexer (B) Demultiplexer (C) Half adder- (D) Half subtractor 26. A Boolean function is represented by F = x + yz The canonical form in SOP configuration will be (A) YZ + xyz + x¥Z + xyz + Xyz (B) xyz + xyz + x¥2z + XYZ + KZ (C) xyz+KVZ+Xyz+x¥z+xyZ . —_(D) None of these + Comespondence Course + TaGATE + ICP-Inlensive Classroom Program + eTutor+ Online Test SeriesTest ID: 2124 1CSIDigital Logie-1 Common Data Questions: 27 & 28 ¥(5,6,13) and YE (0.1,2,3,5,6,8,9,10,11,13) and f =,.f, where f,f,,f, are function of A,B,C,D 27. Total number of possible expressions for fy is (A (8) 2 Ox (oy 12 28. Minimal value of f, is (A) A (B) A+C cB (D) None of these Statement for Linked Answer Questions: 29 & 30 Consider the given multiplexer, © 1 5 1 4xt A : 1, Mx F(C.B,A) : o—bs, 5, l- ‘ [a Boa 29, The logic function realized by the given multiplexer arrangement (with MSB C in put line) Is (A) F=2(1,2,4,5,6) (8) F=£(1,2) (©) F=5(0,1,2) (D) F=¥(0,1,2,4,6) 30. The given multiplexer can be arranged with LSB A in input line by which o, the following configuration? (A) A] (8) ry 4a MUX F = 14, o—jhs os rl Uy © A—T1h (2) r—i, oa 1k oa mux F mux F i—y, 1k I—hs 5 o—jbs sy UI im “¥ Comespondence Course + TarGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘Dargie esored by Gaal Edcatonal Sonices Pv: Lid No pa alts bootie ay bo oprosuced oruilzedin any Tore iret ha wtionparmisson. 44Answer Keys afel[2z2fals]lala]o @{/sj|9|/o|a|c {als ——rr——C 22[ 8 | 23| 0 | 2a] 8 | as] 29 [a [30] c [ Explanations: 1 10. vs A+ AB+ ABC + ABCD + ABCDE = A + AB+ ABC + ABC(D + DE) = A+ ABs AB(C+C(D+DE)) = A+A+(B+8(C+D+E)) =A+A+(B+C+D+E)=A+B+C+D+E A(A+B)(A+B+C) =(AA + AB)(A+B+C) =(A+AB)(A+B+C)=A(A+B+C)=A Hence no NOR gate is required to implement this function For maximum terms, put 0 instead of 1 in the boxes of Karnaugh Map KAY = X(L4Y) XY = KH KY XY ER HY (XK +X) AB +ABC+ABD = AB(1+C+D)= AB AB -.AB+ABC+ABD = AB=A+B £(A,B,C)=A+B+C =A+BC =A(8+8)(C+C)+(A+A)BC = ABC + ABC + ABC + ABC + ABC = Ym(1,4,5,6,7) + minterms +BC=(A+B)(A+C) =(A+B+CC)(a+8B +c) =(A+B+C)(A+B+C)(A+B+C) = xM(0,2,3) + maxterms ‘Dargis overved by GastonTest ID: 2124 IC SI Digital Logic-1 7 —D ——D7—D—>- 14. — Series switch = AND Parallel switch = OR D=Dp- ap. 18. The adder at LSB does not have any carry in and so a half adder will do. This is valid for a stand alone unit. 15. 19. The Karnaugh map may be redrawn as below: ec D\oo__or_ 10 | e [2 if @ F(A,B,C) =B+ AC 20. F=[AGB]@C=[AOB]C+[AOB]C c =[A@B]C+(AB+ AB)C = (AB + AB)C+( = ABC + ABC + ABC + ABC 2. x e @ r $ Conespontance Conse + TWGATE + 1CP-Inansve Cassoom Pragram + eTuor? Online Ta Ss ‘Dratrghs recorved by Gailou Earl Sovioos PLM Nopacl fie bask May bs Toproduoed or ized may 17m ‘wit tn win pein, 46Test WD: 2124 ICSI Digital Logic-t ABA =(A+B)A= AB ABB = (A +B)B = AB; F =(AB)(AB)=(4+B)(A+B) = AB+AB 23. The Karnaugh map is modified as shown below: yz wx\ 00011110 0 > of 0 * n o lle 10] @ 24, The Karnaugh map is modified as shown below: vz we\ oo or 1110 Fa Wy +z | ff) a LE ALL Te rola efi 25, P=(A+B)(A+B) = AB+ AB- A@B = S(sum of a half adder) Q= (A+B) = AB =C (carry of a half adder) 26.0 x+yz; Further : xy = xy(z +2) +9 (2+ 2) = xyz + xyZ + x¥2 + xVZ yz = y2(x + %) = xyz + Kyz fF = XyZ4+ MYZ+ XYZ VZ+ xyZ-+ RYZ= HZ + XYZ + XYZ + XVE + RZ + Comespondence Course + TuGATE + ICP-lntensive Classroom Program + eTutor¢ Online Test Series ‘DArnghtervevad oy Gaworan Escalona Savas Pa Ud Noa o fs bose May be reproduced or raed h any Tom without he writen permission a7Test ID: 2124 IC SI Digital Logic-1 Sono; 1110 ee 00 se orm ei0) o © 09) ‘oo| 1 1 | a fo oafaifafafa f 6 ul aa 1 10) 1 sof a [ 1 ou 10 x [x [7% There are 5 don’t case la pe eee eee x] 29. I- table 30. + Comespondenco Course + TwGATE + ICP-Intensive Classroom Program + eTutor¢ Online Test Series ‘DATrghesresarnd by Gaeioun Ecucebonal Sevees Pv LN pact fs booket ay Bo repredisadorublzed a oT win! the wien pamision 48GATEFORUM Engineer Digital Logic-II Computer Science Engineering Test ID: Duration: 90 minutes ‘Maximum Marks: $0 10. u Read the following instructions carefully: Write your roll number. your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer ‘This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each, Unvattempted questions will carry zero marks, ‘The question pair (27, 28) is common data questions, ‘The questions pair (29, 30) is questions with linked answers. The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un- attempted. then the answer to the second question in the pair will not be evaluated. NEGATIVE MARKING: For Q.1 to Q.10, 1/3 mark will be deducted for each wrong answer, For Q. 11 to @.30, 2/3¢! mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question. ie. for Q.29, 2/3" mark will be deducted for wrong answer. There is no negative marking for Q.30 Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall. Rough work can be done on the question paper itself, Webster wum.gateforim.com Email: support @gateforum.com ‘SAlrighs rosea by Gaatonum EaucaTonal Sonices Pt Ud. Na pal ts Boa may be produced or uized in any fos wou! fro wren serasn. Oiscuse ils quosionnepe wwo.gatomertor.com. “0as Digital Logic-IT Q. No.1-10 Carry One Mark Ear: If (212), = (153), then the base x is (a) 5 (8) 6 (7 (08 For an edge-triggered D flip-flop, (A) A change in the state of an flip-flop occurs only at a-clock pulse edge (B) The state that the flip-flop goes to depends on the D inputs (C) The output follows the input at each clock pulse (D) All of these Asynchronous counter differs from a synchronous counter in (A) the number of states in its sequence _(B) the method of clocking (C) the type of flip-flops used (D) the value of the modulus For a 4-bit synchronous counter, propagation delay through 1 flip-flop Is 10us. Calculate the maximum output frequency of the counter. (A) 100 KHz (8) 90 KHz (C) 71.5 KHz (D) 25 KHz Consider the following conditions: 1. tT Where t, = pulse width, at = propagation delay and T = clock period. The race around condition in the JK flip-flop can be avoided if (A) 1 and 2 are satisfied (B) 1 and 4 are satisfied (C) 2 and 3 are satisfied (D) 3 and 4 are satisfied If a counter needs to count up to 2048, then the minimum number of flip flops needed is (A) 11 (8) 12 (c) 10 (0) 5 ‘Statement (S): JK flip flop is better than SR flip flop as it can avoid race around condition. Reason (R): JK flip flop rejects the input when both the outputs are 1 unlike SR flip-flop. (A) Sis false (8) Sis true but R is not the correct reason (C) S is true and R is the reason (D) S and R are true but not related + Conespondence Coune + TaGATE + ICP-Intensive Classroom Program + eTulor+ Online Test Series ‘Tiga reserved by Gatsorur EdusatonalSanvoos PW Li, No pat ols Dookt may be roprodused or uilzad nan lm wihout ne writen permission, oy|GATEFORUM Freese east ‘Test ID: 2125 (CSI Digital Logie-tt 8. (567).9 when converted to Hex will have the following value (A) 7324 (8) 2374 (C) 352 (0) 2354 9. Excitation table of a flip flop gives (A) Next state in terms of present state and control inputs (B) Present state interms of next state and control inputs (C) Control inputs interms of present state and next state (D) Next state as a function of present state irrespective of control Inputs 10. AF12H in decimal form will be (A) 41325 (B) 44818 (C) 36266 (D) 32326 Q. No. 11 - 30 Carry Two Marks Each 11. (3233), +(1323), + (3121), + (3333), +(2323), = AW (A (13337), (8) (13337), (©) (33331), (D) (3333), 12. 4 | @ > Ql > @ D Clocks, input The present state of the given shift register is 0111 (from left). Data input is 000000 After application of a clock pulse the state will be (from left) (A) 0111 (8) 0110 (c) 1110 (©) 0012 13. A 4 bit right shift register shown in the figure is configured in the circulating mode. Initial content is 0000. After three pulses, Q,,Q.,Q,Q, will be cp —>—_f Q (A) 0000 (B) 1111 (c) 1110 (©) 1001, + Comespondence Course + THGATE + [CP-iniensive Classroom Progam + © "Singha vosoved by Gavloum Edwea me witout he wat peissin, ‘Wort Online Tes 7a borat may bo eproaIERd(eo ree icsnigatteget 14. Aslice of a signal is given below: af ‘ Asilice of the enable signal for a D latch is given below: Z Output waveform will be: a J @ J Of (D) None of these 15. An-stage Johnson counter divides the input clock by a factor equal to (aya (8) 2n (c) 2 (D) n? 16. What is the corresponding decimal number corresponding to the 2's complement representation as 111101,’ (a) 3 (8) -7 (C)-5 () -29 17. Adecade counter is realized by cascading a MOD 5 counter and a MOD 2 counter. In order to have a perfectly square waveform (50% duty ratio) (A) MOD 2 counter should be followed by MOD 5 counter (B) MOD 5 counter should be followed by MOD 2 counter (C) Neither of (A) and (B) can generate a perfectly square wave form (D) Either of (A) and (B) can generate a perfectly square wave form 18. A _J-K flip-flop with an input tied to J and the inverse of the input tied to K is NN equivalent to (A) D flip-flop (8) T flip-flop (©) S-R flip-flop _—_(D) None of these 19. The combinational element of a counter can be made with WN (i) flip-flops (ii) Logic gates (ili) PLA, (iv) ROM (A) ‘only (B) ii, i, ivonly —(C) tionly (0) all 20. An N-bit two's-complement numeral system can represent every integer in the range (A) -2"* to +2"t-1, (B) -2"4-1 to +2" (C) -2" to +2" (D) -2" to +2" + Correspondence Course + TaGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Ser ‘DAigrsresewed by Pi Lid No par of is book! may be epredicedo” wild nay om winaut the writen permistion, 33 jou earcara 21.) What is the minimum number of flip-flops needed to produce a mod-8 binary counter? (A)2 (B)3 (c)4 (D)5 FORUM Test 1: 2125 {CSI Digital Logic-II The purpose of the clock input to a flip-flop is to 2 (A) Clear the device (B) Set the device (©) Always cause the output to change states (D) Cause the output to assume a state dependent on the controlling inputs 23. The group of bits 10110101 is serially shifted into an 8-bit parallel output shift register with an initial state of 11100100. After two clock pulses, the register will contain (A) 01011110 (8) to110101 (C) 01111001 (D) 00101102 24. What is the highest count of a mod-12 counter? (A) 1100 (8) 1011 (C) 1101. (D) 1010 25. (98),, +(1D),, + (72), + (1011), =? (A) (314), (8) (84), (© (194), (D) None of these 26. The circuit shown below acts as a (A) D FF fal S\ (8) JK FF > yf. "(TRF a ¥| 7 (D) None of these Common Data Questions: 27 & 28 The given circuit is that of a short modulus ripple counter. + Comespondence Course + TarGATE + ICP-Intensive Classroom Program + eTuior Online Test Series ‘Svngheserved by Gablonm Edvonional Govies PH Ld No part Pi books maybe repodiead or Wiad any lm ‘thot writen parison 54eee ene enn 27. The MOD number is (a3 (8) 5 (C6 (0)7 28. If in the given circuit, the two input negative OR gate is fed form Q, & Q, then the MOD number will be (A) 5 (8) 0 (C2 (D4 Statement for Linked Answer Questions: 29 & 30 Consider the following counter: a(clockj"-P.@ L x @ > A c oe aks q Kk & 29. The MOD of the counter will be as (8) 6 7 (oe 30. If the input clock frequency is 1 kHz, the output frequency will be (A) 1kHz (B) 0.2kHz (C) 0.125kHz (D) 0.33kHz + Comespondence Course + Ta GATE + ICP-Inteasive Classroom Program + eTulort Online Test Series ‘Siang overved by Gasorum Eaucaioral Senices Pv Ll) Noa ol is bool may be reproduced or lad any Tom ‘ihout tba witan permission 3seee reumsats sib ope Answer Keys afce[z2[al3alelala al7[a B 9 ¢c 10 B 11 Cc 12 D 13 c 14 8 as[ 58 |16/ a [17] 5 | 18/ a | 19] 8 | 20[ a | 21] 8 [22] bo | 23] c | 24/ B | 25| D | 26] Cc | 27| B | 28 faafo [solic] | Explanations: 2x +x+2=1x8+5x843 2x=7 = 100kHz 6. 0-2048 = 2049 counts But 2" can count upto 2047 so, 12 f/f needed 16567 3g, (183527 162-3 0-2 Ans: 237 H 10, AF 12H = (10)(16°) + (15)(16*) + (1)(16)+2 = 40960 + 3840+16+2= 44818 M1 12. There will be bit shifting to right Boy 1 @ + Comespondence Course + TarGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Sees ‘D Ainghi recored by Gatsorum Educatonel Sewioas PLE Noa offs Booklet may bo reproduced orullznain any xm vetrout fe wrt permission, 56Tete Test: 225 25. 26. 27. 28. [P and S are introduced as intermet FPS®Z®A 00, S=PQ, 0 100 0 0 1 061-0 00 1 1 10 0 0 1 Oot=0 00 ae 0 Oi 007-0 00 3111 1 0 2 totar 41 11 1 1 0 100-0 Take all the digits to a particular base and then solve 298 2149-0 224-1 212-0 26-0 23-0 a-1 (98),, = (1100010), (10),, = (00011102), (72), = (111010), (1012), Then add up Xf Qe ° Q a A. MOD 5 counter & & fe tg The counter will be MOD 4 counter. ICSI Digital Logic-It fe terms for solution only] 2 &@ @& 1" ° ° + Conespondence Course + THGATE + ICP-Iniensive Classroom Program + eTulor¢ Online Test Series ‘iret be weton parm reserve by Gateorur EacaTonal Sarvons PLR No pat Ps boll maybe rpredusd or Used any Tn 37oareronum ous oa 29. Clock | Ja | Ka | Js | Ke} Jc | Ke} Qc | Qa | Qa input frequency 30. output frequency MOD 0.125kKHZ + Conespondeace Course + TaGATE + ICP-Intensive Classroom Program + eTwtor+ Online Test Series ‘TAs sored by Gamlonan Edveataral Sercas Prt LA No pa ofthe bok may be proained or ulieain any Term wou te witn prison, 58[IB|SATEFORUM Di meee Digital Logic-III Computer Science Engineering ree: DTT) uration: 90 minutes Maximum Marks: 50 Read the following instructions carefully: Write your roll number, your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. Al the questions in this question paper are of objective type. Questions must be answered on Objective Response Shect (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. ‘This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each ‘Unrattempted questions will carry zero marks. ‘The question pair (27, 28) is common data questions. ‘The questions pair (29, 30) is questions with linked answers. The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un’ attempted, then the answer to the second question in the pair will not be evaluated, NEGATIVE MARKING: For Q.1 to @.10, 1/3 mark will be deducted for each wrong answer. For Q. 11 to @.30, 2/3% mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ic, for @.29, 2/3" mark will be deducted for wrong answer. There is no negative marking for Q.30. 10. Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall. 1. Rough work can be done on the question paper itself Website: won gateforum.com Email: support@gateforum.com ‘SA age revved by Gatavorur Esuceonal Sonisoa Pi Lid No bar af Pa Booka! May ba Fprodased ould in any fr wiout tra writen perruasion, Discuss te qusion papa at www gatementar com, aTest ID: 2126 ICSI Digital Logic-Iit Q. No. 1 - 10 Carry One Mark Each 1. Select the derivation with minimum number of literals for the function represented by the following K-map. 1% (A) Xr" Xo¥s "Yo" %XoYo" x00 01 41 10 00 (B) X,Y, +Xo¥sYo +XiXoYo oi} 2 (O) XY +X" WYo + %"Xo Yo ula ta . (D) None of these sofa fa 2. What is the minimal canonical sum of products representation of the function f (x,y,z) = xy'+ y(x+z)? (A) F(x, ¥.2) = xy xy + yz (B) F(X, y,z) = xy'z+ xy'2'+ xyz +x" yz + xyz" (© f(uy,2z)=x+y2 (D) F(x ¥,2) = (x+y +2)(x+¥+2')(X+y'+2) 3. Essential prime implicant is (A) A sub-cube that is not contained within any other sub-cube (B) A sub-cube that includes a 1-minterm that is not included in any other subcube. (©) Both A and B (D) None of these 4. What is the binary equivalent of the decimal number(13.375),.? (A) (1101.110), (8) (1101.010, —(C): (1101.011), (D) (101.0101), 5. For which value of r the following equation will be satisfied? (200), = (8),, (9 (8) 10 on (0) 8 6. What is the 2’s compliment representation of 60? (A) 10111100 (8) 11000100 (©) 11000011 (D) None of these 7. A four bit down counter can count from (A) 0000 to 1111 (B) 111100000 (C) 000to 111 (D) 111 to 000 + Correspondence Course + TaGATE + ICP-Inte iassroom Program + eTutor+ Online Test Series ‘S-Airghts sara by Gattorun Eauoatonal Sonicos Pv Ld. No pr othe bockst may ba reproduced or izeain any fom wit to witan parmsion 6110. 4. We : ‘Test ID: 2126 ICSI Digital Logic-Iit In the following logic circuit, the function F is Dt per (A) A (8) B (C) A+B (D)A+B Consider the representation of 6-bit numbers by 2's compliment, 1's compliment, or by signed magnitude. In which of the representation, overflow occurs from the addition of the integers 011100 and 011100? (A) 2's complement only (8) Signed magnitude and 1’s complement only (C) 2's complement and 1’s complement only (0) All three representations What is the minimum numbers of gates required to evaluate the Boolean expression AB+BC(B+C)? (A) 2 (8) 3 © (0) 4 Q. No.11-30 Carry Two Marks Each The k-map shown below illustrates a switching function F(A,B,C,D) that includes five don’t cares. cD ap\ 00. 01 11 10 oo] crexe| apt afofofi]o utfa fax |x wpafofa]t Which of the following expressions is / are valid representations of F? I. AB+CD+AD TI, AB+CD+BD MI. (B+C+D)(A+C)(A+D) (A) Lonly (B) Land only = (C) Pad Ilonly (0) I, Hand HT How many flip-flops are to be complimented to reach the next count after 1011011111" in the counter? (A) 5 (B) 6 (c)7 (0)8 + Correspondence Course + TwGATE + ICI ‘TAs served by Gatorm Edveatoral intensive Classroom Program + eTutor+ Online Test Series Pvt Ud Nopartof wih the witn prisin, ezey Test ID: 2126 ICSI Digital Logic. 13, Consider the sequential circuit specified by Dy = AX+BX Dg = AX Y=(A+B)X Which of the following state transition(s) of (A, B) is / are not possible? 1. (0,0) (0,1) MH. (0,1) 9 (4,0) UL. (1,0) (1,1) (A) Tonly (B) only (C) Mand mt (D)None of these 14. What is the input sequence, which will result in the state transitions (0,1) > (1,1) + (0,0) in the above circuit? : (A) 00 (8) 01 (c) 11 (p10 . 15. The initial state of Mod 10 up counter is 1000. After 53 clock pulses the state of Aff y the counter will be ft (A) 1000 (B) 0001, (©) 0010 (D)1001, 16. A product of sums expression for the function BD + Dis (A) (B+C)(D+D) — (B) (B+D)(C+D) — (C) (B+D)(C+D) (0) (B+D)(C +) 17. Given the functionf(x,y,z,w) is equal to yw+x'w+x'y'ty'w'. Which of the following is / are essential prime implicants? L yw IL xy’ ML. x'w Vv. yw (A) Land only (B) I, Hand I only (C) 1, 1, M1, IV (D) Land IV only 18. A EDT SD— {_} \) >a Which of the following is TRUE about the above logic diagram? (A) Implementation of Full Subtractor with two half subtractions (8) Implementation of Full Adder with two half Adders (C) Implementation of Full Adder with two half adders and an XOR gate (D) None of these + Comrespondence Course + TuGATE + ICP-Intensive Classroom Program + eTotor+ Online Test Series ‘T Aaghs reserved by Gateona Edcatonal Serveas Pv Us. No par of is Boot may be epredined or ilzadin any Tom ‘inoue writen pormissn. 63Case ‘Test ID: 2126 ICS1Digital Logic-tIt 19. Match List II with List I _ List =a List 11 [pe [Deceder 1 [Asynchronous Q Encoder 2 | Binary to Octal R Multiplexer 3___| Data Selector s Ripple Counter ‘4 | Octal to Binary (A) P-2, Q-4, R-3, S= 1 (B) P-4, Q-3, R-l, S-2 (C) P-t, Q-2, R-3, S-4 (D) P-2, Q-1, R-3, S-4 20. Determine the modulus of the following 1 1 a Ya Qe Qe 2 cuk. U Ky Ke (A) Asynchronous mod 8 Up counter (B) Synchronous mod 8 Up counter (C) Asynchronous mod 8 Down counter (D) Synchronous mod 8 Up counter 21. Consider the following Multiplexer A f 3 ° 2 MUX 1 t—y ; eal Si So Output ¥ is equal to ry (A) A (B) A (cB (D)B 22. Consider the following sequential circuit. Pe Ge fou aa Pr ail isa cLiK—p>} +,Test ID: 2126 ICS1Digital Logic. What is the counting sequence of the above arrangement, when 000-So, 001-S;, 010-S2, 011-S3, 100-S4, 101-Ss, 110-Sg, 111-S;. (A) SS, 955 48,95, +8; 9S, (B) S82 > S59 9S 9S, + Sy () S$) > 2 > $3 >; +S, 3S. 9S, ¢ (D) None of these 23. The output of the following Multiplexer is \\ =e “I< x! wneo iz € & a = e . A B oo (A) A(BX+BX) +A (By +BY) (B) XX+Y¥+ AB (C) A(B®X)+A(BOY) (0) AXY+BYK+AB 24. How many essential prime implicants are there in the following K-map? | co AN 00 01 11 10 oo} 1 1 01 as a afa]a 10] 2 1 (a) 3 (8) 2 (yt (D) 4 25. Find the minimum number of literals in the following Boolean function in SOP and POS form respectively. F(xy,2) = 3)(0,1,5,7) a(x, y.2)= 5 (23) (A) 2 in SOP, 4 in POS (8) 2 in SOP, 3 in POS {C) 4 in SOP, 4 in POS (D) 2 in SOP, 2 in POS + Conespondence Course + THGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘Aarons esrvedy Getler Edsatona Services Pv 1M No pares ooke! May berepediedrzainany mm‘Test ID: 2126 ICS! Digital Logic-U1f 26. In majority function in combinational logic, what is the output of three inputs (A,B,C)? (A) AB+BC (B) AB+BC+AC (©) A+B (D) A+BeC Common Data Questions: 27 & 28 Consider a shift register with an initial value of 10110011. Let the serial input be 11100011, The serial input is connected as input of the MSB flip flop. 27. The number of clock pulses to be applied to reach the value 01110110 in register \ is (A) 3 (B) 2 (cya (0)4 28. What is the value of register after applying 4-clock pulses, starting with the initial value? (Assume that now serial output is connected to serial input) » (A) 11101100 (8) 00111011 (C) 10110011 (D) 10010011 Statement for Linked Answer Questions: 29 & 30 Look at the following combinational circuit | PD > lo 29. The output of the given logic circuit is (A) & (8) 8 1 (D) 0 30. The output obtained in the above is given to two input EX-OR gate with one input EX-OR gate with one input connected to +5V, then output of EX-OR gate Is (Ay A (8) 8 (c) 0 (1 + Comespondence Course + TarGATE + 1CP—Intensive Classroom Program + eTutort Online Test Series ‘SAirghs reserved by Gator Eaucatonal Senicos Pvt Li. No pt ais Bock may be aproOlead or laeain any om witoul ne weitan parmisin, 6s/(] ‘Test 1D: 2126 ICSI Digital Logic-I1 Answer Keys 1 A 2 c 3 B 4 Cc 5 D 6 8 7 B 8 A D 10 A 11 c 12 8 13 c 14 D 15 B 16 c 17 D 18 Cc 19 A 20 A 21 c 22 8 23 A 24 B 25 D 26 B 27 A 28 8 29. D 30 D Explanations~ 1 Wo XQ 0001 11 10 00 o1| a ula ta 1 : sofa [is 0/9 = Xia" Ko¥s Yo" XsXo¥o" 2. fexy'tyx+yz, f=x(yty)+yz, foxtyz ‘The sub-cube which contains one or more distinguished 1’s 4 13+ 1101, 0.375 (101.011), 5, 1x8? + 0x 8" + 08° = (64), => V64 = (8), 8. (((AB)'.A)'(AB)')' = (AB)' A+ AB = (A's B') A+ AB = AB's AB = A(B44 B) =A 11. AB+CD+BD; F'=A'C'+A'D'+B'C'D, 13. resent, Next state B x A B o o 0 0 oO 1 oO 1 1 0 o 0 1 1 1 1 0 oO 0 0 0 1 1 o 1 o o 0 1 1 1 0 (A+C)(A+D)(B+C+D') AX + BX; Ds = AX, (0,0) to (0,1) only possible + Correspondence Course + TarGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series Sarre wihout be witen puemison ed by Gael Easceonel Sowicas PA UM Napa ol Ws Boch ray bm oprhioad OF URES ATT 67Test ID: 2126 (CS1Digital Logic-IT 14. To change form (0,1) to (1,1); input is 1. To change from (1,1) to (0,0),input is 0. S, is 10 16. SOP=BD+@ Pos = = CD+BD; F=(CD+BD) =(€+D)(e+D) 17. Essential are the cubes contains atleast one distinguishable 1's. So they are y'w’ and yw. 21. y= ABA+AB-B+AB-0+AB-1=0+AB+AB=(A+A)B=B 23. ABX + ABX + ABY + ABY ALBX + BX] + A[BY + BY] 24. BD and B'D’ are essential prime implicants. 25. SOP = X'+Z; POS = XZ’ 26. =J-T=]=]e]elele|> =F felelelleyey= rlelelelelel-lola F=AB+BC+AC 0/p is equal to 1 when number of one’s are more in the input. 27. 10110011 1 11011001 1 11101100 0+ 01110110 After 3 pulses 28, 10110011 > 11011001 -» 11101100 + 04110110 dornso1s + Comespondence Course + TaGATE + ICP-Intensive Classroom Program + eTutor¢ Online Test Series ‘SAT vai rosrved by Gataforam Eaucaloal Savas Pv LW, Ne pa Ps bookie ay be reproduced or vlad ay mh wirout ne wntan permission . 6sComputer Organization-I Computer Science Engineering est: [2[ 1] 2] 7 Duration: 90 minutes Maximum Marks: $0 10. uL Read the following instructions carefully: Write your roll number, your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. ‘This question paper contains 30 objective type'questions, Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each, Unvattempted questions will carry zero marks, ‘The question pair (27, 28) is common data questions ‘The questions pair (29, 30) is questions with linked answers. The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un~ attempted, then the answer to the second question in ih’ pazr will not be evaluated. NEGATIVE MARKING: For Q.1 to @.10, 1/3" mark will be deducted for each wrong answer, For Q. 11 to Q.30, 2/3" mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ie. for @.29, 2/3! mark will be deducted for wrong answer. There is no negative marking for Q.30. Calculator without data connectivity is allowed in the examination hall. Charts, graph shoots or tables are NOT allowed in the examination hall. Rough work can be done on the question paper itself : Website; wan.cateforum com Email: suppon@ gateforum.com ‘Sigs rund by Gatnoran Eaucatonal Svews PU Wo pal tha hai may ba reproduce oiled in any Tom witout ‘he wien permission scuss tis qustion paper al warm gatementercom, A(eee Test ID; 2127 ICS1 Computer Organizaton-1 Q. No. 1 - 10 Carry One Mark Each 1. Purpose of memory hierarchy is (A) To reduce average memory access time (B) To reduce memory cost per bit (C) Both (A) & (B) (D) None of these = A computer uses 1 GB of main memory. Memory Is byte addressable. 9 ‘)- How many address lines are required to connect this memory with the computer? (A) 10 lines (8) 20 lines (©) 30 lines (D) None of these 3. Which of the following is the slowest mode of input? W (A) DMA (B) Interrupt driven input (C) Program controlled input (D) none of these 4. An input processor has got the following facilities (a) DMA (B) Interrupt support (C) Both (A) & (B) (D) None of these 5. Which control unit is used to mimic the behavior of the other CPU? (A) Hardwired (8) horizontal (©) vertical (D) none of these 6. Assume a CPU takes 17 cycles in worst case to execute an instruction. Number of cycles required to execute current instruction by CPU is 12. If an interrupt occurs while executing current instruction, then after how many cycles it will be recognized? (A) 17 (B) 44 (c) 12 (D) 17412 7. For executing indirect address instructions, the following machine cycles(s) is/are performed. (A) Fetch Cycle (B) Indirect Cycle (C) Execute Cycle (D) All 8. Which of the following technique is used for connecting key board devices with the cpu? (A) Interrupt driven input (8) DMA request (C) Program controlled input (D) None of these 9. What is the name of the technique used for polling the input devices whenever an interrupt occurs? (A) Daisy chain technique (8) Interrupt vector technique (C) Both (A) and (B) (D) None of these + Conespondence Course + TarGATE + ICP-Iniensive Classroom Program + eTulort Online Test Series ‘© Alright oserved by Galsorum Educational Sanices Pw Li. No arto 8s Booka may be reproduced or lized in ary fom wanout th writen prmission| mn‘Test ID: 2127 (CSI Computer Organization-1 Se processor has average instruction execution time as 2 micro seconds, then the MIPs rate of the processor is ¢ (A) 5 MIPS (B) 2 MIPS (C) 0.5 MIPS (D) None of these 11. Consider a computer with 4 floating point processors suppose that each processor uses a cycle time of 40nsec. How long will it take to perform 400 floating point operations and also what is the time, if the operations are carried out on a single processor with cycle time of 10nsec? (A) 400nsec, 4000nsec (B) 4000nsec, 4000nsec (C) 4000nsec, 400nsec (D) None of these 12. A ROM chip of capacity 512* 8 bits is connected to the CPU which has 12 bit address bus. The connection is shown below. cpu ’ \ [ORSINI omnes oh 121110 9 ct Y oo k— A129 [ADDRESS LINES: ‘What is the range of addresses allocated to the ROM shown in the diagram? (A) 400H-SFFH (8) 200H-3FFH (©) 200H-2FFH — (D) 500-6FFH (H- Here refers to hexadecimal number) 13. A computer uses 1 GB of main memory. Suppose the memory is word organized and the word size is 64 bits. Then, how many address lines are required to connect the memory with the computer? (A) 27lines (8) 30tines (©) 20lines (D) None of these 14. A typical CPU uses the following instruction format -1312- 1110- Addressing mode _| Address field --16 bits > Each instruction is stored in one memory word. What is the maximum capacity of main memory, which can be a connected with this CPU? (A) 2? bytes (8) 2" bytes (C) 2” bytes (D)None of these + Comespondence Course + TarGATE + ICP-Intensive Classroom Program + eTulor+ Online Test Series ‘S-Airighs reserved by Galton Eaueatona Serves Pw Ltd No pao ebook may be reproduoe or ulzed nay fo wwihou fe wtn prmeion 72eee rer eee 15. ») 16. 7. 18. 20, 21. ‘A CPU is operating at 100 Mega Hertz. Assume that 25% of the time the CPU Performs 1 micro operation in one Clock pulse duration, another 25% of the time the CPU Perform 2 micro operations in one clock pulse duration and remaining 50% of the time it performs 3 micro operations in one clock pulse duration. The CPU requires Performing 5 micro operations on the average to fetch, execute and execute on Machine language instruction. Calculate the speed of the CPU in MIPs. (A) 50 MIPS (8) 45 MIPS (C) 60 MIPS (D) None of these Match the following: A B int *p$a; a, Index addressing 2. | white (i++ <0); b. | Auto increment 3. | for(i=O0;i<10;1++) |e. | Indirect addressing (A) 1-2; 2-b; 3-¢ — (B) 1-aj 2-¢; 3b (C) Ac; 2-b; 3-a_ (D) 1-¢; 2-a; 3-b There are 64 general purpose register in a system and instruction size is 16bits. If there are 10 two-address instructions, then how many one address instructions are Possible? (A) 6x2° (8) 5x2® (C) 7x28 (0) 2" If we want to read 1024 bytes in programmed input mode CPU, then the time required to read the data Is (neglect seek and rotational latency) (A) 630ps (8) 620ps (C) 625ys (D) 600s Number of bits required in control word for horizontal and vertical micro Programming with following signal specification is S1=10 Signal $2=33 Signal $3=13 Signal (A) 33,10 (8) 33,14 (C) 56,14 (0)56,13 Which of the following control unit is the fastest? (A) Hardwired (B) horizontal (©) vertical (D) Both (B) and (C) AHDD has the following specifications Number of surface = 8 Number of track / surface = 128 Number of sectors / track=128 No. of bytes /sector = 512 RPM=3000 ‘Assume DMA initialization takes 200ms and bus speed is 8GHz. Time taken in ys to read 1024 bytes in cycle steering is___. Assume bus is 32bit. (A) 200 (B) 200.64 (C) 200.128 (0) 200.32 “+ Comespondence Coune + TaGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘Sgt osarved by Gailorum Educalonal Serdcos Pv Li. No par ois bok may ba reproduced itzeain any fom ‘winout a witon permission 7322. 4 a 23. 24. 26. =A TEE ‘Test ID: 2127 {CSI Computer Organization- A HDD has the following specifications Number of surface = 4 Number of track / surface Number of sectors / track= No. of bytes /sector = 512 RPM=6000 If we neglect the DMA initialization time, percentage of CPU time saved in operating in DMA mode v/s Programmed 1/0 mode (assume bus is 8GHz with 32 bit wide) (A) 5000 times (B) 2000 times (C) 6000 times (D) 8000 times Zero-address instruction is which CPU organization? (A) Stack Organization (8) General Register (C) Single register organization (D) None of these In a 32-bit floating point number with normalized mantissa and Excess-64 exponent Base 16, the number 16*denotes (A) Floating point overfiow (8) Negative floating point overflow (©) All0’s in exponent and mantissa field () The minimum re-presentable positive number A micro-program control unit is required to generate a total of 25 control signals. Assume that during any micro-instruction at most two control signals are active, minimum number of bits required in the control word to generate the required control signal will be (A) 2 (8) 2.5 (c) 10 (p12 How many separate address and data lines are needed for a memory of 8Kx16? (A) 13 address, 3 data lines (8) 13 address, 16 data lines (C) 12 address, 4 data lines (D) 13 address, 4 data lines Common Data Questions: 27 & 28 ‘APC - Relative mode branch instruction is 3 bytes long. The address of the Instruction in decimal is 342038. 27. Determine the branch target address, if the signed displacement in the instruction is -31. (a) 342031 (8) 342010 (©) 342007 (0) 342069 28. What is the branch address, if the base and index registers contain the values 480220 and 9 respectively? (Assume base with Index addressing mode is used) (A) 480198 (B) 480229 (C) 480250 (0) 480220 + Comespondence Course + TarGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘DA rghieeeerved by Galton Exucona Sevias Pv Lid, No pat of Bis boowel may be reproaizedorulasdin ary fom ‘wih a itn permission 74(eee ‘Test ID: 2127 ICS Computer Organization Statement for Linked Answer Questions: 29 & 30 Brine content of accumulator (AC) and the extra bit E initially has hexadecimal 7, 079C and 1 respectively. A subroutine is executed to circulate E and AC four * times to the right. 29. What are the contents of AC and E respectively in Hexadecimal? (A) 9079, 1 (8) 20F3, 0 (C) C232, 0 (D) 9079, 0 30. What Is the content of AC after circular shift left is performed on AC and E for the correct option above? (A) 90F0 (B) 20F3 (C) 20F2 (D) 8465 + Correspondence Course + TarGATE + ICP-Intensive Classroom Program + eTuior+ Online Test Series ‘Sal ght osonved by Galtoran EdueaTonal Senicns Pvt LA No pro fs book may be reproduced or aed ‘whet writen permission asAnswer Keys afc ce[3]cls]{[c]{[s|[ele6e{cl7]o s|a a jao| cjas| 6 | az] 8 | a3] a [aa] c 1s | 8 | 16 | c | 17/ a | 18| c | a9 | c | 20| A | 21| © 22 | a | 23| a | 24| od | 25] c | 26/ 8 | 27/ B | 28/ A 2s | a | 30] 8 Explanation: 5. Horizontal control unit is used to mimic the behaviour or other CPU 6. 12 cycles after executing current instruction CPU checks for the interrupt 16. Pointer indirect with auto 17. __ bits for register = log,64= 6 Total Bits=16 number of registers 64 each register address requires 6 bits ‘Two address instructions =10 44646 remaining = 4x2power6 18. bytes / track = 128x512 = 2° x2’ Gore RPM = 3000 ~ 50 Xffer rate=2'* x50bytes / sec 1024 Time to transfer 1024 bytes = 35 “zp = 6254s 19. Horizontal = 10 + 33 +13 =56 Vertical =[log, 10] + [log, 33] +[log, 13]=4+6+4=14 20. Hardwired is the fastest as it is made up of hardware 21. Transfer rate = 128x512x50 bytes/sec=128x512x4x12.5 1024 bytes will take how much time bus 2124 256times bus speed 8GHz means 256 8x10" bus transffer require = 5-4 sec; So for 256 require = Total time = 200us+32ms=200.32us. + Comespondence Course + TarGATE + ICP-Tntensive Classroom Program + eTutor+ Online Test Series “TAT eserves by Gattoum Eaucetonal Sewoas Pv Lid, Nepal Pi bookel fay Be repredioed or wilzodin any om ‘whol te won permission 76(eee ‘Test ID: 2127 ICSI Computer Organization 22. In programmed Input output mode, to transfer 128x5*? x 100bytes time required Transfer rate of HDD = 128%512x 100bytes/sec time required = isec. In DMA mode, we require 128x512x100 _ 1024x2x100 4x8x10" 10° 1 _ 10° = >— = 5000ti 200i ~ 200 i = 2x10“ sec = 200us Time saved 25. — 2-bits required for active one’s, 5-bits are required for remaining 23 bits. Therefore 7 bits are required. Among the options 10 is the minimum one. So is the answer is Option (C) 26. — memory size =8kx16=2" x16, So, address line = 13, data line = 16 27. Branch address = PC + Displacement Instruction Occupies 3 bytes Then PC=342038+3=342041 Target branch address = 342041+(-31) =342010 28. Branch address in base indexed Addressing mode = base + Index + Displacement =480220+9+(-31)=480198 29. E Ac Initial cri 0000 0111 1001 1100, After 1* shift 10000011 1100 1110 After 2° shift ¢ 0 0100000111100111, After 3" shift G1 0010000011110011 0 1 100 10000 0: After 4" shift 4 9 o 30. 1 1001 0000 0111 1001 at After circular left 1 1 Ali E 0010 0000 ac 0011 AC = 20F3 ve Classroom Program + eTuior’ Online Test Series ay be reproduced or ulzed many ere en To gato is bok “DAtra raves by Gatsorum Eaucaional Sanveas Pv(TeISATEFORUM Computer Organization-II Computer Science Engineering Test ijele Duration: 90 minutes Maximum Marks: 50 Read the following instructions carefully: 1 Write your roll number, your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. ‘All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. 5. This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each. 6. Unvattempted questions will carry zero marks, ‘The question pair (27, 28) is common data questions. 8, The questions pair (29, 30) is questions with linked answers. The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un~ attempted, then the answer to the second question in the pair will not be evaluated. 9. NEGATIVE MARKING: For Q.1 to @.10, 1/3 mark will be deducted for each wrong answer. For Q. 11 to Q.30, 2/3 mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ie. for Q.29, 2/34 mark will be deducted for wrong answer. There is no negative marking for Q.30. 10. Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall, 11. Rough work can be done on the question paper itself, Website: wam.cateforum.com ‘Email: suppon@gateforum.com ‘BAe reserve by Gaeforur Eavcnonal Sowioes Bl Lit No para Ws boo ay Bw fpradions or viz is any en woul ‘ha wien germissn. suse ts quaston caper al www qatementer com, ea(Ea Test D: 2128 ICSI Computer Organization 10, * Q..No. 1 ~ 10 Carry One Mark Each Instruction level parallelism is achieved through (A) Multi processors (B) Array processors (C) Pipelined processors (D) None of these ‘The advantage of pipeline processing is (A) Design of control unit is simplified (B) Design of ALU Is simplified (C) Instruction throughput is increased _(D) None of these ‘The reasons which prevent the pipeline from operating at its maximum speed are (A) Resource conflict (B) Branch problem (©) Data dependency (0) All of these Re ordering of instructions by the compilers can be useful (A) for avoiding NOPs (B) for improving the throughput (C) both (A) and (B) (D) none of these In case of write back policy if data is not available in cache (A) It is directly written over RAM (8) It is first brought into cache and then update both cache and RAM (C) It is first brought into cache and update only cache (D) None of these Amount of time required to access L1 cache is 4ns, having hit ratio as 80% and main memory access time is 1ms. What is average access time? (A) 200005ns —(B) 200006ns_—(C) 200007ns (D) 200004ns A cache needs an access time of 20ns and main memory 120nsec,what Is the average access time of CPU (assume hit ratio = 80%)? (A) 30nsec (8) 44nsec (C)35nsec (D) 45nsec Whictrof the following is similar to EEPROMS? (A) Disk (8) Tape (c) CoROM (D) Flash Drives Which of the following result in data hazard? (A) Output of previous instruction required by current (8) Unavailability of instruction (C) Unavailability of Hardware resource (D) None of these ‘Assume there are 4 stages in pipeline with each stage taking ins, 2ns, ins, 3ns. Operating system in pipeline mode over non-pipelining mode will be benefited by (A) 1.33 (B) 1.66 (2 (0) 2.33 “+ Comespondence Course + TatGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘DA ie osorvad by Gaitoran Eaucalanal Senvcas Pr Li No parol ra booker ray be reproduced orlaed many Tam wth he wien prmasion a1‘Test ID: 2128 (CSI Computer Organization-1 Q. No. 11 - 30 Carry Two Marks Each 11. Match the following: ' List I List Ir (a) Activation record (1) Linking loader (b) Location counter (2) Garbage collection (c) Reference counts (3) Subroutine call (d) Address relocation (4) Assembler (A) a3 ba ct 2 (B) a4 b-3 ct a2 (ad b3 2 at (D)a3 b4 c2 at Consider the following program: int array A(L...4,2..00010); sum = 0; for int sum oto 9; um + A(0,i); Consider following specification. Data cache size is eight blocks. Also assume that each block contains 16 bit word; data and memory is word addressable. Now suppose a 4 x 10 array of number each occupying one word, is stored in main memory of size 40 word in column major order. If direct mapping is used, which one of the following set will be mapped into 0 block? (A) A(0,0),A(0,4),A(0,8) (B) A(0,0),A(0,2),A(0, 4) (©) Both (A) & (8) (D) None of these 13, RAM Is called DRAM (Dynamic RAM) when & (A) It is always moving around data (8) It require periodic refreshing (C) It can do several things simultaneously (D) None of these 14, Using a sequential implementation, it takes a total of 320ns for each instruction:- 300ns for the combinational logic to complete, and 20ns to store the result (in | fegister). This means that the throughput will be about 3.12MIPS, You switch to a 3 stage pipeline by splitting the combinational logic into three equal units taking 100ns per unit, and each registers take 20ns to store the result. a How long will it take for the first instruction to execute in the pipelined implementation? (A) 300ns (8) 360ns (C) 260ns (D)200ns + Conespondence Course + TarGATE + ICP-Iniensive Classroom Program + Tutor Online Test Series ‘Tvags esorves by Galo Edwetonel Soves PUK Napa ol fis booket may be repreduced 7 sTaedivany om wih tho wit parmision 82eee fae 1 Cages npc 15. We are to simulate a cache of 16 words, 2-way set associate cache with 2 word .\ cache lines and LRU replacement policy is used; assume the cache is initially empty. x 16. q’ The following sequence of addresses are generated (the addresses are given in hexadecimal), where all references are instruction or data fetches (no stores): 62 63 64 98 65 99 66 99 67 68 69 6A 63 64 108 65 109 66 109 67 68 69 6B Which of the following is correct? (A) Set 1 Contains 63 (8) Set 0 Contains 64 (C) Both (A) and (B) (0) None of these In the figure, A is a parallel - in, parallel - out 4 bit register which loads at the rising edge of the clock C. The input lines are connected to a 4 bit bus W. Its output acts as the input to a 16 x 4 ROM whose output is floating when the enable input E is a 0.A Partial table of the contents of the ROM is as follows: Address | 0 Data | 0011] 1111 | 0100 1010] 1011 | 1000 | 0010 | 1000 time MsB. Rom The clock to the register is shown and the data on the W bus at time t; is 0110. The data on the bus at time ty is: (a) 1111 (8) 1011 (C) 1000 (D)0010 ‘TAirighe wowed by vwthout he wrt poriss “+ Comespondence Course + TarGATE + ICP-Iniensive Classroom Program + eTulor+ Onl yorum Esato! Sarees Pv Us. No pa of is bool may be reproauced or ilsd Test Series many tomey Test 1D: 2128 (CS! Computer Organization 17. \ 18. ny Following gives the code on which you have to evaluate’ the cache performance of different cache designs. For all cases you should assume that the address of the array foo is 0, cache is initially empty and an integer takes one byte of space. Assume that i, j, tot, zent are in registers (the only memory access are to foo). int foo[256]2] int 1,5, int tot = 0; int _zent = 0; O;i < 2561+ +){ for(j=0;4< 2;5++){ tots = foofi] i}; + + for (i= 0,1 < 256;i++){ for(j=0,)<23+#){ if (foofifj]= = 0) zent +4; } + ” Suppose array is stored in row major order, in main memory of size 4096 byte and block size is 8 byte and cache size Is {024byte and block size is 8 byte. Which of the following element will be mapped in to cache block zero? (A) foof129][1] (8) foof64]{0] (C) foof128]{0] (0) Both (B) & (C) Assume we have two dimensional arrays as size 100 x 100 each element occupying 4-bytes and array is stored in row major order. Further assume RAM is 1MB and cache js 4k with each block size of 32bytes. X: for (i=0;i<100;i++) { for(i= { 7 print (alii); + + Y: for(i=99;i2 0;i-) Fc { for(j=99;)20;) { print(afiTi); print (afiti)s y 3 yj < 100; j++) ‘Dal rghs esorved by Gaon EacatoralS ‘wnat writen parmeson + Comespondence Course + TaGATE + ICIeee Test 1D: 2128 ICS! Computer Organization How many cache miss will occur in case of associative mapping assuming initial cache is empty. (A) 2371 (8) 2372 (c) 2373 (D)2374 19. Assume that the times required for the five functional units, which operate in each of 1 the five cycles are as follows: 10ns, 8ns, 10ns, 10ns and 7ns. Assume that pipelining adds 1ns of overhead. What is the speed up factor? (A) 4.5 times (8) 4.8 times (C) 4.1 times (D)6.5 times 20. In a non pipelined processor if a and b represents throughput and latency ww Tespectively then which of the following is true? (A) at/b (D)none of these 21, Hazard free form of f (w, x, , Z) is re (A) x'zey'zexy' (B) x'z+y'z! (©) x'zey'z (D)none of these 22. CPU has 32-bit memory address & a 256KB cache memory the cache is organized, 7) asa 4-way set associative cache with cache block size of 16Bytes and 1 word is » +” equal to 1 byte. What is the size of comparator required for tag matching? (A) 4-19 bit comparator (B) 4-16 bit comparators (C) 16-16 bit comparators (D) 16-12 bit comparators 23. What can be solution to conflict miss (in cache)? (A) Increase cache size (8) Increase associativity (C) Both (A) and (8) (D) None of these 24, A CPU has 32-bit memory address and a 256KB cache memory. The cache is 1° organized as a 4-way set associative cache with block size of 16 bytes. What is the number of sets in cache? (A) 2” sets (B) 2 sets (© 2 sets (D) None of these 25, A digital computer has a memory unit of 64K*16 and a cache memory of 1K words. The cache uses direct mapping with a block size of 4 words. What is +“ the size of the cache by including tag bits? (A) 1024 bytes (B) 2048 bytes (C) 2240 bytes (1D) None of these 26. Assume innermost track has diameter 1cms and outermost track has diameter 10 Vand if there are 10 tracks in disk and disk is rotating with constant angular velocity with capacity of innermost track IMB. Total capacity of disk is, (A) 108 (8) 55MB (Cc) 9MB (0) 54MB (ensive Classroom Prograan + + Correspondence Course + TaGATE + ICP. yutor+ Online Test Series ered by Galtoran Eduoaional Senicas Pi Li No par oi bookat ay be reproduced or zed any Tom tan prmssion 35(Te SATEFoRuM Theory of Computation-I Computer Science Engineering ret: PELL Duration; 90 minutes ‘Maximum Marks: 50 10. uw Read the following instructions carefully: Write your roll number, your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet (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. Each question has only one correct, answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each. Unrattempted questions will carry zero marks ‘The question pair (27, 28) is common data questions. ‘The questions pair (29, 30) is questions with linked answers, The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un attempted, then the answer to the second question in the pair will not be evaluated. NEGATIVE MARKING: For Q.1 to @.10, 1/3 mark will be deducted for each wrong answer. For Q. 11 to Q.30, 2/3 mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks-only for wrong answer to the first question, ie. for @.29, 2/3'¢ mark will be deducted for wrong answer. There is no negative marking for Q.30. Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall Rough work can be done on the question paper itself, Webster wane cateforum.com Email: suppont@gateforum.com ‘SA gre reearved by Gaefonm Educalorl Sevicea Ui. No pa is Baoat may be repronicad of lized nay or wi the witan parmisenOscuss ts qbaston papal aww gtementorcom, eal1 ‘Test 1D: 2129 ICSI Theory of Computation-1 Q.No.1-10 Carry One Mark Each Finite automata can be used in (A) Lexical Analysis (B) Syntax Analysis (C) Semantic Analysis (D) None of these Finite automata can be used for (A) Editing the text (B) Implementing recursive function calls (C) Evaluating arithmetic expression (D) Infix to postfix conversion Identify the equivalent machines from NFA, DFA and E-NFA. (A) NFA and DFA only (B) DFA and E-NFA only (C) E-NFA and DFA only (D) NFA, DFA and E-NFA Infinite languages are (A) All regular languages (B) All non-regular languages (C) Some regular languages () None of these 2 Ae (8) {9} (C) fe} (D) None of these Star height of (a*)* is (aya (B) 2 (3 (D)0 Regular languages are not closed under Operation. (A) Concatenation (B) Substitution _(C) Subset (D)Cycle Identify the Regular expression which denotes all strings of a’s and b's where each string contains at least two b's. (A) (atb)*ba*b (B) (a+b)*ba*ba (C) (a+b)*ba*b(a+b)* (D) None of these For given NFA with q states. It is possible to construct equivalent OFA with maximum of states. (aya a (c) 0 (D)2* More and mealy machines are used to act as (A) Language recognizers (B) Output generators (C) Both (A) and (B) (D) None of these ‘TA ighe revered by Gateorm Eabeatonal winout he witen persion onTest I 129 ICSI-Theory of Computation-1 Q. No. 11 - 30 Carry Two Marks Each 11. Chose the correct statement for the following regular expression over the 12, 13, 14, symbols 0 and 1. 0 (0+1)*0 +1(0+1)*1 (A) To represent all strings over 0's and 1's (B) To represent all strings at least one least (C) To represent all strings which start and end with same symbol (D) To represent all strings that starts and ends regular expression 1’s . If any language is described by a regular expression, then that language is. (A) Regular Language (8) CFL (c) CSL (D) Recursive Language Consider the following DFA: Which of the following is true for the above DFA? (A) It recognizes the strings which contains ‘ababa’ as substring (B) It recognizes the strings which contains ‘abbaba’ as substring (C) It recognizes the strings which contains ‘abbabaa’ as substring (D) It recognizes the strings which contains ‘baba’ as substring Consider the following two finite state automata M; and M, "© ©50+-© Which of the following statement is true? (A) M; and M, are equal (8) M; and Mz are not equal (C) Not decidable (D) None of these Conespondence Course + TuGATE + ICP—Intensive Classroom Program + eTulor? Online Test Series Tezervd by Gisloum Eaieatonal Services Pr Lia) No patio ha boca may be eproauced a ullabain any Tom wien permission _sey Test 1: 2129 ICSI Theory of Computations Oe The minimal DFA that accepts all the strings of a's and b’s ending with ‘aa’ contains ( (A). states (8) 4 states (C) 5 states (D) 6 states \is. Let qo and q; are two states and qo is always initial state over the alphabet {a,b}, the possible number of DFA’s with two states qo and q; are (A) 16 (8) 32 (C) 64 (D)80 17, © Consider the language L = {ab? wb? / we (a+b)*}; Lis vA) Regular (8) CFL but not regular (©) CSL but not CFL (D) None of these 18.: The minimal finite automata that accepts all strings of a’s and b’s, where the number of a's is at least ‘n’ contains (A) n states (B)(n+1) states (C)(n+2)states _—_(D) (n-+3) states ab ap @ +O ) ab ap © Owr®© The language accepted by the above DFA over a’s and b’s is where i) Length of the string is divisible by 2 1i) Length of the string is divisible by 3 (A) Lonly (8) iionly (©) iandii () or ii or both 20. For a given two finite automaton M, and M,, which of the following is not decidable? (A) Whether M, accepts empty language or not? (B) Whether M; accepts finite language or not? (©) Whether M, and Mz accept equal language or not? (D) None of these + Cones ‘Coune + TaGATE + ICPIntensive Classroom Program + eTutor+ Online Test Series ‘SAirgheswsarved by Gatsnur Eaueatoral Sortces Pw. Li. Noa fis Book ay be reproduced o utized inary fom ‘wirout be won sarsson 93‘Test ID: 2129 ICSI Theory of Computation-f 21. Consider the following NFA: laa] ta) [40,41] 8 (a2) Cai42] {o, as] [a0, a3] [Dead] > [40] | (40, 42] {as} | [40] [a2] | [Dead] (8) > [ao] | (40, a1] (a0, 41] | [o. a1] [a2] [Dead] Lai, 42] | [a0] [Dead] | [Dead] co} > [qo] | [40, a2} [40,41] | (do. ax] {a2} [Dead] fax, 42] } [a0] [Dead] | [Dead] [a2] fava [qo, ai} (qo, a:] (Dead) > [40] | [40,41] (qo, ai] | [4o, a) [a2] [Dead] [Dead] | [Dead] (a2) (qi42] [Dead] [Dead} ‘Dirge sandy Ga wine tan potmision iassroom Program + eTuior+ Online Test Series TN pa oll book! maybe repraduzad or ulin any om 94Ero Test bi 2129 ICSI Theory of Computations 22. — Which of the following regular expression generates the set of all strings not containing “baa” as a substring over input alphabet {a,b}? (A) ax(b*a)* (8) a*b*ab (C) a*baba* (D)a*(ba+b)* 23. An NFA has 10 states out of which 3 are final states. Maximum number of final pi States in converted DFA is (A) 895 (B) 894 (C) 896 (D)897 24. Find the number of possible finite automaton with two states qo and qu, where qo is always initial state over the alphabet {a, b} which accept empty language. eas (8) 8 (©) 16 (0)20 25. For the given input symbol <, the output produced by the Moore machine is ‘A’ and the output produced by the Mealy machine is ‘B’, then which of the following is true? (A) A = the output associated with initial state, B= « (B) A =e, B= the output associated with initial state (C) A= the output associated with input symbol, B = (D) A= €, B = the output associated with input symbol oe {26| . Consider the following Mealy machine. oly one “yo o os uy w 1x Which of the following is true for the above machine? (A) Produces output as ‘x’ and 'y’ alternatively (B) Produces output as 'y’ if the last two symbols are same otherwise ‘x’ (C) Produces output as ‘x’ if the last two symbols are same, otherwise 'y’ (D) None Common Data Questions: 27 & 28 Following two FA's M; and M,, accepts all strings of a's and b's where the number of a's divisible by 2 and number of b’s divisible by 3 respectively. + Comespondence Course + TaGATE + ICP_Intensive Classroom Program + eTutor Online Test Series ‘DAighe eared by Gaisour Edseabonal Sewions Pa Ud No pao it Soot may bo reproaucedo uiazedin ary fom ‘winoute wien samen os(eee rome Sere er 27. Consider the following FA: Ms Which of the following is true for the above FA? (A) My =Mi= Mz (B) Ms=M2—=M: — (C) Ms = Mi U Mz (D)Ms = Mi Mp 28. Consider the following FA: Ms Mee Which of the following is true for the above FA? (A) Ma = Mi- Mz (B) Me =M2—Mi — (C) My = Mi U Mz (D)Mg = Mi Mz + Comespondence Course + TarGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘Darah esorved by Gualonen Ecatal Srvons Pi Ld) No pat of Bis bool may be reprodiced or Wgedin ary fom winout te wien pomisson 96eee Test 1D: 2129 ICSI Theory of Computation: ‘Statement for Linked Answer Questions: 29 & 30 Consider thé folowing FA: } 6 Cond DD ab 29. _ The language accepted by above FA is (A) L= {a"b"/m2 0,20} + (B) L= fa" /m20,n233 (©) L= {arb"/m24,n2 4} (D) L= {arb /m21,n2 0} 30. Above L accepted by FA is (A) Regular (B) Non-regular (C) Not deci ble (D)None of these + Conespondence Course + TaGATE + ICP intensive Classroom Program + eTulor+ Online Test “D Arighsrsarvad by Gatelonum Eduatonal arrest Pv Ld No pv of Ps Bool may be eprodinad oF wld many form ‘witout te wien permission ooICSI Theory of Computation-1 ‘Answer Keys al2 (sfof[a[cec[s[c[«6]alz7]ec clo loli] s {alc |iz{a|is|o |is| 5 as {a lae| c [a7] a [as| 5s |i9| 0 | 20| 0 |] 2/6 22d #230 ecu soa eb |a2se|ars7d|e2on cs |az7a DE |uzel| ae 29 |p | 30| A | Explanations: 1. FAs used in lexical analysis to recognize tokens. 2. Fused as text editor to edit the text 3. NFA, DFA and E-NFA are equivalent 4. Infinite languages may or may not be regular Ex: - a bis not regular for n> 1 (a+b)* is regular 6. Start height over one symbol is always 1 (a*)* = a* 7. Regular languages are not closed under subset but closed under finite subset L, = {2°b" /n< 10} finite L, = (a+b) *is regular L, cL, is closed L, ={a°b" /n2 1} is non-regular L, = (a+b) tis regular L, cL, isnot closed ~ under subset 8. a) (a+b)*ba*b > It will not generate bba b) (a+b)*ba*ba > It will not generate bbaa ¢) (a+b)*ba*b(a+b)* > It will generate all the strings containing at least 2 b’s, 9. Maximum 2% states, minimum 1 state required 12. For any regular expression, we can construct an equivalent FA; the language accepted by FA is called regular language 13. Given FA recognizes the strings which contain baba as substring 14, Mp accepts string ‘aa’ but M; doesn’t + Conespondence Course + TarGATE + ICP-Intensive Classroom Program + efwior> Oaline Test Series "TArrghts served by Gatatrum Eoatonal Sanioss Pvt Li. No profs booket may ba epredieed or and in Ary fmm ‘thou the tan permission 98‘Test ID: 2129 ICSI Theory of Computation-1 b 2 15. = 3 States 16. Final onc Final a (a inal 2x2x2x2x2x2 = 64 Possible DFA’s 17. L = {ab? w b? /we (a+b)*} For given lafiguage, equivalent DFA is possible, therefore given Language is, Regular language 18. Example: No. of a's at least '2’ Contains 3 states ap ‘ No. of a’s at least ‘n’ Contain (n+1) states 19. The given DFA accepts the language where the length of each string is divisible by 2 or divisible by 3 or by both 20. _ Emptiness, finiteness and equivalence are possible in FA 21. Initial state of given NFA is also initial state of equivalent DFA + Conespondence Course + TaGATE + ICP-Intensive Classroom Program + eTutor Online Test Series "D Airis ovarved by Gator EGuontonal Senicos Pt Li No par is book ray be reproduced or aedin ary fom ‘wihout he wien passion 99FORUM Bed Test ID: 2129 {CSI Theory of Computation-I A 8 Ftad fla,a) Cel Uae] |64e.a:] C63] __ are New States (qo, 4s] | (0, 41] [41,42] oS —> New State (a2) [Dead] [4o, a:] {a1 42] | [a0] [Go, ai] [Dead] | [Dead] [Dead] Make all the states are final which contain final state of NFA 22. a* (ba+b)* = {¢ ,a,b,aa,ab,ba,bb, Substring ..}Doesn’t contain strings with ‘baa’ as 23. An NFA with 10 states the converted DFA will have utmost 2" = 1024 states. ‘The NFA has 3 final states. So number of subset of remaining 7 elements are 2” = 128. Maximum no. of final states in converted DFA = 1024-128=896 24. Q } Gor a: oor a: — Non-final << a OFA GO Binal) a0 | door a: G0 OF a: 2x2x2x2 = 16 @ 22 = 4 ~ (2) No. of possible DFA’s = 16+4 = 20 25. By readinge, the output produced by Moore machine is the output associated with the initial state By reading <, the output produced by mealy machine is + Conespondence Course + TarGATE + ICP—Intensive Classroom Program + eTutor+ Online Test Series "DiAirghes esrvedby Gaatoram Educational Sarveus Pv Us No prof is book may bo ropresucedor ilaeain ary fom ‘winout he witon permission 100{Leeatzronum Theory of Computation-II Computer Science Engineering tet: [2] 1] 3] 0 Duration; 90 minutes Maximum Marks: 50 10. LL Read the following instructions carefully: Write your roll number, your name and name of the examination center at the specified locations of the ORS. Using HB pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code. All the questions in this question paper are of objective type Questions must be answered on Objective Response Sheet (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. Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as a wrong answer. This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each. Un-attempted questions will carry zero marks. ‘The question pair (27, 28) is common data questions. The questions pair (29, 30) is questions with linked answers, ‘The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un~ attempted, then the answer to the second question in the pair will not be evaluated. NEGATIVE MARKING: For Q.1 to Q.10, 1/3 mark will be deducted for each wrong answer. For Q. 11 to Q.30, 2/3 mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ie. for Q.29, 2/3 mark will be deducted for wrong answer. There is no negative marking for Q.30. Calculator without data connectivity is alowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall Rough work can be done on the question paper itself. Website? wow.gateforum.com Email: suppors@gateforum.com ‘BA igs raved by Gata Eaucavoal Sarvene PV Ud” No pa ls Bookie ray ba reproduced or tizodin any frm wiout tha writen permission Dicuss ts quosion por a we. gatementor.com, aICSITheory of Computation-t Mv nu an Q.No.1-10 Carry One Mark Each Push down automata is equivalent to (A) FA (B) FA with one stack (C) FA with two stacks (D) FA with three stacks PDA can be used as (A) Lexical analyzer (8) Syntax analyzer (C) Semantic analyzer * ~ (D) Code generator PDA can be used for (A) Infix to postfix conversion (8) Implementing recursive function calls (C) Evaluating arithmetic expressions (D) All of these Which of the following statement is correct? (A) DPDA and NPDA both are equal (B) DPDA and NPDA are not comparable (C) DPDA < NPDA (0) NPDA < DPDA For every context free language, we can construct an equivalent (A) DPDA (8) NPDA (C) DPDA and NPDA (D) None of these Crus are languages (A) Type 0 (8) Type 1 (C) Type 2 (O) Type 3 Which of the following order of elimination from the given grammar produces “simplified CFG?” (A) Useless symbols, e-productions, and unit productions (8) Useless symbols, unit productions and <-productions (C) Null productions, useless symbols and unit productions (D) Null productions, unit productions and useless symbols Consider the following grammar: Sans , A+ bBb BoA/e ‘The above grammar is (A) Free from unit productions (8) Free from null productions (C) Ambiguous grammar (D) Simplified grammar “$ Comespondence Course + TWGATE + ICP-Intensive Classroom Program + eTutor? Online Test Series Argh served by Gatsnum Eauestorl Sewions PL. No pat lf Book! may Bo epredinod or vlad in any om warout ha win prison, 103ey Test ID: 2130 {CSI Theory of Computation-tI 9. Which of the following operation is closed under DCFL but not closed under CFL? (A) Intersection (8) Concatenation (C) Complementation (D) Substitution 10. The language L = {a’b" [n= 3} is (A) Regular (B) CFL but not regular (C) CFL but not DCFL (D) Non-CFL Q. No. 11 - 30 Carry Two Marks Each 11, Identify the simplified CFG for the following grammar. S— AOA|18 A ADA | AIA (A) S AOA |1A (8) S+ ADA|1A A AOA] ALA [AQ |A1|OA [14 A> AOA|AIA|AO|ALIOA [1A] 0]1 (C) S+ AOA | AO] OA [14 (D) SAQA] AO [OA IIA 1011 A AOA| AIA] AQ|AL|1A [0 |1 A+ AOA] AIA} AO] ALIOA [1410/1 12. Number of productions in an equivalent CNF for the following CFG is S+a AD AaB |BAB Bob Dod (a8 (8) 7 (6 (D) 5 13. CNF grammar may contain (A) Null productions (B) Unit productions (C) Use less symbols (D) All of these 14, Which of the following problem is undecidable for CFL? nv (A) Equivalence problem (B) Ambiguity problem (C) Inherently ambiguity problem ——_(D) Alll of these ,15. The complement of the following language is, WOW | We (a+b)} and W* is reversal of W CIs input symbol (A) DCFL (B) CFL but not DCFL (C) Not CFL (D) None of these Ls 16. The language L ={a'b" |n2 1}U{c"d" {m=O} is (A) DCFL. (B) CFL but not DCFL (C) Non-CFL (D) None of these 17. The language L = {a’b” [n> 1} {a"b"" |m 24} is (A) DCFL. (B) CFL but not DCFL (C) Non-CFL (D) None of these + Conespondence Coune + TaGATE + ICPIntensive Classroom Program + Tutor Online Test Senes ‘Sighs resrved by Gael Educational Saricss Pvt id, No par ols bok may ba eproduced or ulzeain ar Tom ‘inoue wn pam. 104Gee Test: 2130 [6S1-Teory of Computation (28. The language L = {WCW | We (a+b) *} is (A) DCFL. (B) CFL but not DCFL | (©) Non-CFL (D) None of these | 19. The language L ={a"b’c” [n> 1} is (A) DCFL. (B) CFL but not DCFL (C) Non CFL (D) None of these ) Consider the following CFG: ” So AB A>BCla 2 BSCC|b C>atas ‘The rank of variable A is A) 27 (B) 3 (4 (D) None of these C22. If A+ XY is the non redundant CNF, then the rank of A is / (A) Less than rank of X and less than rank of Y (B) Greater than rank of X and greater than Rank of Y =< (©) Less than Rank of X and greater than Rank of Y (D) Greater than Rank of X and less than Rank of Y 22. Transition function "8" for PDA is (A) Qx ExT Qxr (8) QxEUfe}x > Qxr (©) Qx EUfe}x > Qxr™ (0) QxExr+Qxr* 23. / C¥K.algorithm is used for CFG's to test the problem of _* ) Finiteness (8) Equivalence (C) Emptiness (D) Membership 24. To generate '¢" length string, the height of the derivation of tree In CNF grammar is (A) logis 1. (B) log"? (C) logs—1. (D) log? 25. Consider the following grammar G E> E+E/E-E|E*E|(E)| id ‘The number of derivation trees for the string id-+id*id—id is (A) 5 (8) 6 (7 (F) 8 26. Consider the following grammar S> aba A> aA|DAIB Bobb ‘The language generated by the above grammar is (A) All the strings which start with ‘ab’ and end with ‘bb’ (B) All the strings which start with ‘ab’ and ‘bb’ as substring (©) All the strings which start and end with different letter (D) Alll the strings which start and end with ‘bb’ and ‘ab’ respectively + dence Course + TaGATE ¢ 1CP-Iniensve Classroom Program + eTulor Online Tet Series oar gs reserved by Galeton Edcaloal Serves Pi, Lid, No pa of Ps bookel ay ba reproaized or iliadin ary Tom” without win permission 105eaTEFORUM Test ID: 2130 (CS! Theory of Computation-It Common Data Questions: 27 & 28 Consider L, = {a'b'c"d" |m.n> 3} L, ={ab" [n> a} L, = {(a+b) +} 27, Intersection of Ly and L. is (A) Regular (8) CFL but not regular (C) CSL but not CFL__(D) None of these 28. L,-L, is (A) Regular (B) CFL but not regular (C) CSL but not CFL (D) None of these Statement for Linked Answer Que: ns: 29 & 30 Consider the following grammar Saas Ab BD BoA 29. Which of the following is a valid string from above grammar? (A) abbabb (B) bbabb (C) abbbb (D) bbbbb 30. Number of derivation trees possible for above valid string is (a2 (8) 3 (C4 (D) 5 + Conespondence Course + T&GATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘TArrghte sored Galowm Eccaiond Sevens Pt Ld, Napa ol Ps Book! may be repredizador ulaaain ay om wut a wetan permission. 106a Test ID: 2130 ICSI Theory of Computation-II Answer Keys 1 B 2 B 3 D 4 c 5 B 6 c 7 D 8 c c 10 B 11 D 12 A 13 c 14 D 1s | a | 16] a |i7|e[1s|c|i9/c |20/ o | 2| 6 22 c 23 D 24 A 25 A 26 A 27 A 28 A 29| c | 30] A Explanations:- 7 1. PDA =FA+1 stack 4. No. of languages accepted by DPDA are lesser than the no, of languages accepted by NPDA 5. Every CFL can be constructed with NPDA 6. _CFL'S are type 2 languages in Chomsky hierarchy 7. (A) Eliminate null productions (B) Eliminate unit productions (C) Eliminate useless symbols The resultant grammar after applying in the above order to the given grammar is called *simplified grammar” 11. S-AOA/1A A AOA | AIA First eliminate null production S > AOA] AO|OA [2A |1/0 A+ AOA | AIA] AO] At [0A 1A 10/1 Next eliminate unit productions and use less symbols, but already free from unit productions and use less symbols 12. Saad A> 2B|BAB Bob Dod Equivalent CNF grammar for the above grammar is SCE Casa ESAD A> CBIBF FAB Bob Dad Total 8 productions “+ Corespondence Course + TarGATE + ICP_Iniensive Classroom Program + eTulor+ Online Test Series ‘DAlngh erarved by Galtonm Educators Senrces PL, Nopartotsbos aed or edn ay orm ‘rout ha wien permission. 107ay 13, CNF grammar may contain useless symbols but not contain null productions and unit productions 15. L-={wew* | we (a+b) *} is DCFL We can construct an equivalent DPDA and DCFL’s are closed under complementation. 16. L, ={a"b" |n2 4} is DCFL L, ={c"d" | m2 0} is DCFL Here L.UL, is also OCFL Note: Union of two DCFL’s may or may not be CFL 17, l= {a'b" [nz 1} is DCFL L, = {a"b?"}m 2 1} Is DCFL Here, LUL, is CFL but not DCFL* 20. Given, CFG is not finite; therefore rank of variable A is not possible for infinite language 21. AXY R(A) > R(X) and R(A) > R(Y) 22. 8: QxEUfe}xr +Qxr* 25. id+id *id-id . JIN JIN J, a I ZN SINZIN @T7IN SYNGE LO wgly ee eae ei) JN, ZN “Si UN! i viN' ZING" a & = & 7 id i* el id ic ia ia Hence, 5 derivation trees ‘Test ID: 2130 {CSI Theory of Computation-Ht Conespondence Course + TATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series ‘DiAvrgh sorved by Gaston Educniona Serveus Pv LE Nopar ol is bool may be rrodseea or izadin ary fom whole writen prmasion 108(eee Test ID: 2130 ICSI Theory of Computation-II 27, farb"c™d” | myn 2 1} is CFL L, = {ab [n> 3} is CL Here, LoL, =¢= regular 28. [arbrc"d™ | m,n 3} is CFL L, = {(a+b) *} is regular L-L, =@ = regular 29. Sa AB = abBbB > abAbB ~ abbBbbB “abbbb is valid oY. aa | aA Na MIN ZINA i ieee! JN, ! Hence, 2 derivation trees + Comespondence Course + TaGATE + ICP-Intensive Classroom Program + eTulor+ Online Test Series ‘@ Alright resarvd by Gateiorum Educational Senvcos Pv Li. No ato fis booNo ay be oproaueedo Wizedn any Tom wou he won permission. 109Theory of Computation-III Computer Science Engineering ‘Test ID: Duration; 90 minutes ‘Maximum Marks: $0 10. ML Read the following instructions carefull Write your roll number, your name and name of the examination center at the specified locations of the ORS, Using 14B pencil, darken the appropriate bubble under each digit of your registration number and the letters corresponding to your paper code All the questions in this question paper are of objective type. Questions must be answered on Objective Response Sheet, (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, Each question has only one correct answer. In case you wish to change an answer, erase the old answer completely, More than one answer bubbled against a question will be treated as a wrong answer. This question paper contains 30 objective type questions. Q.1 to Q.10 carry one mark each and Q.11 to Q.30 carry two marks each Un-attempted questions will carry zero marks. ‘The question pair (27, 28) is common data questions. The questions pair (29, 30) is questions with linked answers. ‘The answer to the second question of the above pair will depend on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is un- attempted, then the answer to the second question in the pair will not be evaluated. NEGATIVE MARKING: For Q.1 to Q.10, 1/3" mark will be deducted for each wrong answer. For Q. 11 to Q.30, 2/3" mark will be deducted for each wrong answer. For the pair of questions with linked answers, there will be negative marks only for wrong answer to the first question, ie. for Q.29, 2/3" mark will be deducted for wrong answer. There is no negative marking for @.30. Calculator without data connectivity is allowed in the examination hall. Charts, graph sheets or tables are NOT allowed in the examination hall, Rough work can be done on the question paper itself, ‘Website, wamcgatefarum.com Email supporn@gateforum.com ‘Si rights resarvd by Gatafonar Eccatoow Seves PL LR Wo pari this booat May Be esredused or ulzad in any im wit witlan permission Discuss hs queston paar at wan. gatementor com. the wien permission, Oscuse aanCee Tes 131 ICSI Theory of Computation-IIt Q. No. 1 - 10 Carry One Mark Each ’Read and write head” of TM (Turing Machine) moves to the right direction only A (no left direction) then the language accepted by TM is w <@ So 10. (A) Regular language (8) CFL (c) CSL. : (D) Recursive Recursive enumerable languages are recognized by (A) Finite automata (B) Pushdown Automata (C) Linear bounded automata (D) Turing machine By reading any string, which of the following may be possible for Turing machine? (A) TM halts in final state (8) TM halts in non final state (C) T™ enters into infinite loop (D) All of these The languages recognized by halting turning machine are called as (A) Regular languages (8) Recursive languages (©) Recursive enumerable language —(D) P ~ language If the language L is recursive enumerable but not recursive, then complement of Lis (A) Recursive (8) Not recursive (C) Recursive enumerable (D) Not recursive enumerable Which of the following problem is decidable for recursive languages? (A) Equivalence (B) Finiteness__ (C) Membership (D) None of these Which of the following operation is closed under recursive languages but not closed under recursive enumerable languages? (A) Intersection (B) Complementation (C) Substitution (0) Homomorphism IfL and L are recursive enumerable, then L is (A) Recursive (B) Regular (©) CFL (D) None of these Turing machine can act as (A) Language recognizer (8) Transducer (C) Enumerator (D) All of these If all the strings of a language are generated in alphabetical order, then the ™ — language is (A) Regular (8) CFL but not regular (C) CSL but not CFL (D) Recursive but not CSL + Comespondence Coune + THGATE + ICP-Intensive Classroom Program + eTutor+ Online Test Series No parol his bool maybe repredized or uilzed nary Torn 113Test ID: 2131 ICSI Theory of Computation-III Q. No. 11-30 Carry Two Marks Each — > % | (4,,B,R) (42,B,R) (4.,B,R) % x (q,,b/R) (a2,b,L) d Y - 2 | (Gal) (abl) (4o/B,R) | (44,8R) (4rb,R) Zz a} - w . Identify the entries of W, X, Y and Z to accept all even length palindromes over the alphabet {a, b} and the blank symbol B (A) (4,,B,L) (42,8/R) (@2,B/L),(4,B,L) respectively (B) (4,,B,L), (4,2/R),(@:B,L),(4./B,L) respectively (©) (@,B,L),(a,8/R),(45/B,L),(44,B,L) respectively (D) (a,,8,L),(4,,2,R),(a,/B,L),(4,,B,L) respectively 12. — Which of the following statement is true? (A) The post correspondence problem over one symbol is decidable (B) The post correspondence problem is undecidable except over one symbol (C) The modified post correspondence problem over one symbol is decidable (D) All of these 13. If the language L: is polynomially reduced to the language l2 and ly is e polynomially reduced to Li, then which of the following cannot be true? (A) L, is decidable and L, ts undecidable (B) Li is regular and L; is CFL (C) L; is recursive and Ly is recursively enumerable . (0) None of these 14, Which of the following is correct statement? (A) A problem Is called NP complete if and only if it is NP hard and NP problem (B) A problem Is called NP complete if and only if it is NP hard and P problem (C) A problem is called NP complete if and only if it is NP and P problem (D) All of these + Conrespondence Course + TarGATE + ICP- Intensive Classroom Program ¢ eTutor+ Online Test Series ‘Trig osored by Geet Eatcatonal Sowoas Pv Lid, No pal Ws Doo! maybe reproduced or uilzad in any Tom ‘nto he writen pomission aaTest ID: 2131 ICSI Theory of Computation-Iif ©. — Which of the following statement is false? (A) If the problem x, a x, then satisfies x, a x, (8) If x, a x, and x, ax, then satisfies x, a m, (C) If x, ax, then satisfies x, a %, (D) Allof these 4 ile. Which of the following problems is NP complete? (A) 1 - SAT (8) 2- SAT (C)3- SAT (D) All of these 17. Let L,,L, and L, are same type languages and L, ol, =L ‘J For which of the following languages the above intersection operation. is undecidable? (A) Type 0 (8) Type 1 (C) Type 2 (D) Type 3 18, Total recursive functions are simitar to (A) Recursive languages (B) Recursive enumerable languages {C) Can't relate (D) None of these 19. Partial recursive functions are similar to #1 (A) Recursive languages (8) Recursive enumerable languages (C) Can't relate (D) None of these 20, Recursive languages are closed under (A) Kleene closure (B) Substitution (©) Homomorphism (D) None of these 21. Recursive enumerable languages are not closed under (A) Union (8) Intersection (C) Max (D) Homomorphism 22, _ Ambiguity problem is decidable for ‘i (A) Regular languages (8) CFL (C) Recursive languages (D) None of these 23. Halting problem of Turing machine is ps (A) Decidable (8) Undecidable but partially decidable (©) We can’t say {D) None of these 24, Consider the following instance of PCP with two lists a.) A={001, 011, 11, 103} B ={01,111,111,010} Which of the following sequence is a solution to the above instance of PCP? (A) 3, 1,4 (B) 3, 4,3 (93,41 (D) No solution 25. Ifthe problem x, reduced'to the problem x, and x, is undecidable then x, is ,J__ (A) Decidable (B) Undecidable- (C) We can’t say _(D) None of these 26, If Hamiltonian circuit problem is reduced to the problem x, then xis, ~ (A) P but not NP (B) NP but not NP hard (C) NP hard but not NP completes (D) NP complete + Corespondence Coune + TasGATE + ICP-Intensive Classroom Program + eTulor+ Online Test Series ‘S Avge rvorvd by Galtorum E@veaiona: Sonces Pr Li, No(par oie Booka ay be reproduced or wzedin an fam whut he writen pormassin 1sGes ‘Test ID: 2131 ICSI Theory of Computation-IIT Common Data Questions: 27 & 28 Let G, and G, are regular grammars and G3 and G, are context free grammars. The language generated by any grammar G is represented by L(G) 27. IsL(G,nG,)=6? (A) Decidable problem (B) Undecidable problem (C) We can't say (D) None of these 28. ISL(G,) cL(G,)? (A) Decidable (8) Undecidable (C) We can’t say (D) None of these ‘Statement for Linked Answer Questions: 29 & 30 Let Li and Lz are regular languages, Ly is CFL and Ly is recursive enumerable language, U is reversal of Ly 29. Ls =(Ls/x) U4 and x is input alphabet, then Ls is (A) Regular language (B) CFL (C) Recursive enumerable language _(D) Non recursive enumerable language 30. tn(tsnt,) is (A) Regular language (B) CFL (C) Recursive enumerable language —_(D) Non recursive enumerable language “+ Conespondence Course + TaGATE + ICP-Intensive Classroom Program + eTutor? Online Test Series ‘Slight resovedby Gatstram Eaucatonl Sarees Pv Ld. No aro! Ps book may be rproaceed or loa any Tom ‘wth wn prmasion 116Test ID: 2131 ICSI Theory of Computation-IIl Answer Keys ajal2}o;j/3{/o]}/4}]s|}|s}o}6}c}7]B8 a | A o | 10 | o | aa{ c | az| d | 13 | ag 14 | A 1s | c | 16| c | 17] c | 18] a} a9] 8 | 20/ dD | 21] c 22] a | 23| 8 | 24| c | 25/6 | 26| » | 27| A | 28| 8 29 | c | 30] c Explanations: 1. If head moves only in one direction, then Turing machine can accept regular languages. 3. Turing machine may halt in final or non final state or it can enter into infinite loop by reading the string from given language 4. Halting Turing machine always halts either in final state or non final state. The language accepted by halting turing machine is called as recursive languages. 5. Recursive enumerable languages are not closed under complement operation, but recursive languages are closed under complement. Given language is recursive enumerable language only but not recursive; therefore complement of the language is not REL. 8. IfLand L are recursive enumerable then L must be recursive. 9. TM can act as recognizer, transducer and enumerator 10. If strings are generated in any particular order, then that language is recursive 12. PCP and MPCP are undecidable except over one symbol. 13. If Lyis decidable, then L; is also decidable 14, Ne NP-hard NP-complete NP complete problems are in NP and also in NP hard “+ Correspondence Coune + TWGATE + ICP-Inteasive Classroom Program + eTutor+ Online Test Series ‘T Aighs rosea by Gaara Educatonal Servees Pt Ls No pr ols book! maybe reproasead or wae any orm ‘without te writen pormistion, a