I G,\ TE-211115 I I o( 11

COMPUTER SCIENCE & ENGINEERING

ONE MARKS QUESTIONS (1-30) 5. A program P reads in 500 integers ln the
range I(1. lllOI represent1ng the scores oJ'
54)() ~tudems, fl then prints the l"requcrnc~
Whnl does ~tc follo11ing C-slatement of each score above 50 What would be Ihe
declnrc'/ best way tor P to store the fregueocies'l
int t • () ti n t . ) : a. An arra~· of 50 numbers
a. A function thni takes an integer pointer b An array of I 011 numbeiS
as nrgum~nl nnd rl.'lttmS an tnleger c. An array of 5(111 numbers
b A function that ta~es nn integer as d A dynamic:illy nllocated array of 550
argwnent nod rolums an mteger poimer 11wnbers
c. A pointer to a runclion that t akes an An undirected gtnph G has n uodes. l.ts
integer pomter as <lf!,'UIIlenl and returns adjaceJJC)' n13trLx is ,g1ven by (Ul n " n
an integer square malnx whose (TI diagonal elements
d. A function tb:tl takes an mteger poimer nre o·s. and (ii) non-diagonal elements nrc
as argument and returns a l'unolton 1·s. Wh1ch one of the follo\\10!! IS TRlJE'I
pomter a. Graph C hru; no minimum spanning.
2. An Abstrnct D~m Type tADT) is, trec(MST)
a. ~am~ as an nbstrnc.t class b. Graph G has a uniQ11e MST of cost n-1
b a data lype thalcnmtol be it1slantiated c. Graph G has mnltrple disllncl MSTs.
c. a data rype for which only lhe each of cost n-1
operations del"med \lll it can be u.sed, d. Graph G hlls multiple spanning trees of
but none else diOerent costs
d_ all or the nbm·e. 1 The lime complexity or computing the
3 A common property ortog1c progranurung trrulsiti,•c closure of n binary relation on a·
languages and fw1ctionnl languages 1s: set of n elemen1s is known to be:
a. both nre procedw::U lllJlg~~;es a. O(n)
b. both are based on 1..-culculus b. O(n Jog n)
c. both are declarati1·e c. O(n1 "l)
d. 0(IJ1 )
d. both use Hom-<llaliSes
Which one or the follo11mg are essenUaJ 8 Lei A. B nnd C be non-empty s~I.S and let
felltures of an object-OU"llted X=(t\- B) -(' :tndY = ( t\ - C)- (B -C)
programming language') Winch one of 1he followm& ts TRUF.1
u) Abstraction and encapsulauon a. X=Y
(it) Stnctly-typedn~s b. X c Y
tiii)Ty pe-safe property coupled 11ith sub- c. YC:X
lype rule
d Nona ofthcoe
\II')Polymorphism m tne presence of
10bcrt IJJ11ce '). The follo11ing Is the Hnsse dtagrom of the
posell\a, & c c~ el . < I
a. (i) and (ii) only
b. ti) 1Uld (11') Olll)
c. (iJ. (li\ 1n1d (in only
d. (i), (ill ) ru1d (iv) only
 .! o!l1
a 14 'llte gmumwr A -+ 1\ A 1 (A) I c ts nul
suiwble for pr~'Ciictivc-jXIr.<ing hect<uoc the
b d gmnunar is
a, ambiguous
e b lefi-recursrve
Tl1e poscL ts' <>. right-n.'CUJ"Sive

u. nol :1 11\liice d an opcrntor-grnmmar

b. a lallicc buLnot u distnbl!u.vc latLtCC 15 Cnnsidi!r !he follm\ll'lj\ dretuL
)(
a. n ilistrlbuLiw lnU><!I! but n<>t n 13oolcun
nll!cbru
i.l a Boolean algebra r
to 1..<:1 G be u simple connc<:tcd plunar gwph z;
wilh 13 vertices 1111d ] I) edges. 111cn.. the
Jlumber of fuces in tb~ plnrutr umbcddins Which one of the follcJ\1 m~ is 'I RVIJ?
,,r~ gruph is- a. ris inl.lopcndenlc1f X
~ <1 b I is mdependent of V
h. 8 c. t' is independent of Z
c ') ~ None of X. Y. Z is redundant
i.l D I (1. n~e range nf uneg,;,I"S thai crul ll~t
II. Let G be 11 !luuplc groplt \litll ~(I VCJLk(.'j4 rcprese.nled Q) un jj bit 2'~ con1pl~meot
nnd lflll ~Jges. 11te >i?.e nr U1e mininnun number syslemts;
WJteli Ct'ver ,,r
G i~> !\, Then, the siz., uf a. -z•·l l<H2"'1- Il
the tntl,\ imtml inclt!p<"tldenl st\L nf (1- i~ b ~2"'1_ J )ICH2°' 1 -I)
B. 12 c. -2(1' 1 to 2'"' 1
b B d ~2'~1 + l ) to~2·-'·l)
1.!. l A$S Ulllll S
17. l11c hc:xndrourml rel""'i<clllll!Jim of o57" os:
d. More than 12 a. I AF
12 Let f(li) 1Jto U1e conunuou.~ Jll\lbtthililr b. 07!1
Jen,ily ftmclion or
a rlmdom \'nrUibl~ x. c. 071
01c probilbLiitv !hut a< X l> b. .,;:
o;l. 32f
n j'(h - o)
IS l11e switching e~1>ression oolrt'spOliding lo
h. / (1>) - / (t•) itA.B, C.D)=~{ L 4_ 5. 9. ll.ll)is

c. r: j'(.•)•l• a. BC'TY +A 'C1) .;- AB' D

b. ABC ' +ACD- s-c·o

I~
d. c .if (.<)tl<
fhc s•l {I 2, -1, 7 8. 11, 13, l~f ts ij
c. 1\CO' +A ' l'lC" + i\C' D'
d. A'BD ~ ACD' + Bco·
II> Which (lnu Qf ob~ tollo1•ing is IIU<l for u
gTilUI' und.:r muJLIJllk•alion utodolu j5
ru~ in•·""'os of 4 utld 7 (If~ respecuvel y- CPU bnvtng n ~'ingle intutrupl request line
anti a !lingle inlerrupl grn111 llnc1
a. .land 13
n, Ncilhc:r vectored in1crrupl nt>r multiple
b 2undl l inlerrupling a"'·ices nre pos~il:ile
L! -l:uhl 13 b Vel!lorccltmemtpts are not possolll~ but
i.l 8 ruld 1'1 ntulltple m1crrupting Jcviccs arc
possilllo
 ) ul 12
~. Vectored intctrttpts tu~d mult1ple d. F1ndln~ the t.JJ\C ad~• that
interruptfrtg do:vices ore I)Olh possible com:spnnd$ to an IP address
.1. Vectoo-ed interrupt is PIIOl!ihle Inn 25. The mn.xirnum windo\1 size foo• d•ta
111Uitiple anterruplinz d"'•ices ~re not transmcssion usin.!l the selective reject
possible protocol 11 ith n•blt frame sequence
20. Nonnally llSef po·ogr:un; are prevented llllUibc~ is:
from handliu!! I! 0 diJ:,-.:tly by !JO •. 2"
irulJ'Itotiuru. Ul Uu:nL f'ru• CPU• boving b. 2"'1
""'plldt U<J instnoclions. 5uch I ()
prut~:etion is ensured by hnVill!- tb~ l!U "· 2''· 1
lnslJ'Uclions privik£cd. lo a CPU Witll d. 200!
memory mnppcd 1 0, there ~ 011 ~tic.it 26. tn • uttwoo'k of LAN:I c:onncctod by
II(J m•truclion, Which one of the bridgl15. packets ore •ent from one LAN to
tollowlng is true for a CJ.'l' with memory another through i.ntermediote hridg~
mopped 11()'1 Sin~ n1~re tlum one path may e.xist
.1. 1<'0 pr'Ol<:ctitm is ensure.! hy l)pcrnting bctwc<n two LAN!l. pad~eto rna}' 1\oVoO to
•yUcm t'c)ulintM he o·outod tllrougb mulli11le bridge~. \Vh) i~
b 110 prott:ction is ensured by .3 Ihe ~ponning, 1ree ~ lgori1h111 ·~·~ f(n'
hardware trap br\dge-routlng?
c. 110 prot.xllou is ensured thu•ing sy•tern
a. Jlar s hortest path routing between
L..-\.
>;~
~nfiguration
d. 1•'0 prut<:ction L~ nl1t pussiblc. b !lor nvoidlng loops in lhe rouling polhs
c. for fuull lolcrnncc
21. What is ohe swop .space on the di~l\ used
l'ol"! d. For mlnimi:tlng col lis1on~
n. llavong temporary h1n1l pages 27. An or~ani?..ntil!n ha$ • clllll~ B networ~ nnd
wi•h~ tQ funn •uboclll lb1"6-l olcpartJucnls.
h, Saving prooes< do!JI
The •uhnet m:1$k would he:
c. Slm:ins Lhe •upe~··hlook
•. 255.255.0.0
1L SIOrin~ device drivtrs
b. 255.255.64.0
:!2. lncre.1<ing the RAM of • computer
typically iJuprO\·es p~-cforn,.u<\e becaUMe> c. 2}5.25S.I21W
d. 255.255.252.0
01, Virtual memory Increases
b. l.nr,geo- Rr\~t~ .rr~ lit•ler 28. Which one of the followin,g l!l • k~y laetor
for pretemng H' ·trees to binnry search
c. fcw"r pago faults occw lrees lor mdexing doL1hase relnilons'l
<L Fewer segmentation r.. ults llCCUI' a. l)a!Gb~le reiMiQn! h:ove ·a huge nllm ber
23. l':l~kcts of thu Same ~es~ion on a)' be routed .,r reoords
throu,gll c.lllTefeut pnths in. b. DatliMse relation& nn: $OMed on tho
"" TC'P, l)ut 1l()t unr primary ~coy
b. TC'P •nd UIW c. a·•trees require l""s memoo:y thnn
.:. l DP. but not TCP binory search trees
IL 1\'eothco TCP. no1' UD'P d. l)ata tr:m~fer fi·om disb t, in block5
24. nc addJ'I:SS I'CSCIIutic.m pTili.QCOI (ARf') i$ 211. Which cone of tho fnllowing ,tatentenlll
ll!led for. :tbuut nonnat f()nns i11 .FAI.SF.?
n. Finding tl1e lP 3ddr~ ll'on1 U1"DNS u. BCNF is stricter than 3NF
b. ]: mding the tP address oJ' the d<•fautt b. l.o!l111e&S. d~-pOJldcncy·prcscrviJijJ
gal<ZWO)' dl"'omposition i:nto 3NF !.- alwoys
pQOtsihk
c Find in~ Ihe fP ••hlress th~l ~~rre.pnnd~<
II) u M;\(" address
 ~ ufl~
c. Lossless. dep~ndenoy-preserv1ng The above CQ<le compiled wtUJoul rut)
decomposition inl•• l:ICNP is always error or wanting. If Line I is deleted (he
possible obovc code "ill show'
<L Any relation with two allributes is ul a. nu c~:unpiJc warJ1l.og p r error_
l:lCNJ-' b. mime compiler-\voming.s nm IMding, hi
30 l.d r be u r~lution ua,lnnce with l;Cbemc R uuintended result,
: (A. B, C. D). We deli ne r, = n A.B.c{r) c. some compiler-warnings due 10 type-
ond r, - n...o (r). L'1 s - r1 • ,,. whe••o • mlsmntch c'·enntnlly lending to
denotes nalwnl J~>in Given tlwt t~c unintended resnlL~
dcCQmpositioo for r tOIO r, and r: ls lossy. d. couu)ilcr e.n:or.s
which one oflhe f<'~l ll'wing is Tn.te'l
J~. r•ost(•rder tmver<al 1>f n givcn blnary
a sc:r search tree. T produces the l'ollm' ins
b. r u s= r SO() lienee of keys
c. res tO. 9, 23. 22. 27. 25. I 5. SO,\j5, f>ll, 40.29
Whlch oue or the lo Uuwmg seqt•euces of
keys e<ln be Lhc result of 1lD lurude<
tra,·ersJI ol' Lbi: tree T'l
1WO MARKS QUESTIONS (31o80) tl. \1, 10. 15, 12. 23, 25. 27, 29.<10, 50, (!(),
<l5
3 1. Cott-.tler d1e followins C-progrnm: h. 'J, tO, 15. 22, 40. 50, 60. 95. 23. 25, 11.
...i.d too (lat. " · i.llt - . . ( 29
tnt k • o. 1 • o,
.i f ......, fttull l c. 29. 15.9. 10, 25, 22. 23. 27. 4(1, (,(),50.
k • o 1 ~or 1 • e I 10: l))
aua • .,.. + ll:r
d. 95.5(), 60.-10.27, 23. 22,25. 10, \1. 15.
eoou. """' '
pori.lltf I ·w. • ,11.1 1 29
34. A Priority-Queue ts implemented a.~ o
iDt. ..U..I I I Mn."· IIcal'· Initially, it bas 5 cicmems. The
tn.e a • 2011. .._ • Ot
f ool• · _ , , level-order U'liVCrsal of the heap is given
-..rt..tti•W\o•,.-.» r below.
I .
10, 8, 5. 3, 2
Whut ducstbenbnve pmgm1npnt1f,' 'l'll'u new alcllJculs · 1· uud ·r ure iuNCr1ed
Jl. 8. 4, 0. 2, 14 w the heap ut !IJUI 11rder 'l'lk! level-order
b. 8, 4.0. 2. 11 travcr..<tl of lh~ hellp :tl\ct lite lllllCrtiuu ul
the clentcuts is:
c. 2. 0. 4. 8. 14
0, 10. 8, 7. 5,3. 2. I
<L .2.. o.·U. 0
b. 10. 8. Ud. 1. 5
32. Oonsitlet the following C.progmm.
~. 10, 8. 7. I. 2, .l.S
double t .o o tdouble) ;
d. 10. &. 7, 3, 2, 1, 5
int ..u. •"'• db: 35. Ilow many distinol bl nal) sdroh trees an11
ctocab1..-
be ueatc<l ont of 4 distinct keys'/
a. )
b. I~
c. 2~
- l o fooldoubl• • II d. 42
r.tum a ;
36. In n complete k-nl}· tree. "''ery mlernol
node hus o~actly k children. ·n1c number
 5 of 12
of leaves in euch o tree wid\ n Internal h. t/ (x.) flc:lchcr(x) - • :3 1~1 f~tutlan!(y)
nodes i•: likt;ll (y. s)ll
ll , uk c. J (y)\f(x) fteaohcr(x) > filt\ldcnt(y )
b. (li· l)k 1 m,.,. (y, x)JJ
c. z(k-lj 1 d. 'I (xlf 1eacl1or(x) J(y ! {shJdlJlll()')
,1. n(k- I J - •likes (y. xm
37. Svppose 'f( n) = "2T(n!2) + n, 1'(0) c T( I) = 42 L<li R and :; b¢ o.n~ IWI1 ct)ulvo l.mcc;
I rclabons on o. non-empty set A. Which one
ofth" fo llowing slolcme.nto L~ 1'RLI1:'1
\Vhich o ne of the following i• tALSI!?
1 u. Rv S. R, ·.S •re hutl< ct)ui:valcni!C
"' T(n) " 0tn ) n:btion~
h. T(t•) : O( n l~~&n)
b. Ru S i• :m cquiva luucc rei• lion
c.. 'l'(n ) = 0( 11~)
c R1;Sis an equivalrncc rel;~lion
d. T(n) - O(n lol!n)
d. ,\Jeitht:r ~vS nor fV-1 S os 'Ill
38. Let OWE) be on undir.,.,u:d g.r.tph will• eqmvalence relahon
pQ~itil"e edge weigh!$. DiJ"ksltll '~ sing.lc:
43. L~l t: B--.(' ~md g: A •B btJ lwo fron~tions
~oureo: shortest path algorillrm c.111 bo:
itnplem enled ~sing lhe bina~ h C11)3 dnla
;md et h = f o g. C.iven that h 1~ nn On I()
sl.t\IClurc witlo liuu: CJ.Hn)>le.<ily: function 11 hi~h unc o)f the ti>llowing is
TRIJE?
n.. U(,\~'!
a, (nnd & shnuld holh l)e onto fuoctious
h. t)(iE( + \'I to~ lVII
b. fs hould be onto but g need not be onto
c. O( \l log (V i)
c. g •hould be onto butfueed not be onto
tl. LI(((El IV) log lVI!
d. both fund & need m>l b~ ouM
~.9. Suppose there ure r lo~tn 1sorted lists ol
~4. What is- the roJniowm 'l"mhcr <JI' 1/Ttl~'!td
I n!log n j cJom.:nt.> c~cb. TI1c tlmc: pulrs of no n-nogntive numbers that should
Cl>mplcxily orpmducin.s • sortcillisl of'~ If be chosen to ensure that lh<.>rc are two pairs
lit<$<: eltmcnto is: (IJ inI: Usc a h~p ihtll (a, b) nnd (c. d) '"the chosen set such th~t
<trueture) a c mo d 3 ond h d mod 5
" · O(n log hilt n) ll,4
b. ll(u fog n) b. 6
e. Q(n log n) c 16
cl. Q(u''=! d. 24
.W. Let P. Q and I~ be Uorcc atomi< +S. Con11ider Utrcc drc}sion III'Oblents Pt. Pz
ptepositiwonl •ssations. Let K denote (P v and p,_ II io known thnl P1 is dl:dd~b!c a.nd
Q) ' R :md Y denote (P > R) ~ (Q ~ Pz t$ undce•dable. Which one of the
R). Wh1ch one or the following i• ~ fullowin& i~ TRUE?
lJIUIOiogy2 a. P, is decidable if 1'1 is reducible to 1',
a. X y b. I'J iJ> ondccidnblc ifP1 is rcduciolo toP,
b. X- •Y c, p, ill unclcciiblolo if P1 is roiluc'l'blo to
c. v ... x PJ
d. PJ i~ d<~iihble ifP3 i~ n:<luoiblc 111 PJ.,
d. .., y • X cqmplemenl
41. Wlvu is Uto J.IrsL order predieow coleulu•
46. Con~idcr Ill" sci H of nU J l< 3 matriecs of
-~ tatemcnl eq,lli,•olc:nt to rhc following•
the type
Every lcacbcr is Jikod b) some s tudent
;t, V (:<) lteaaher(x)-+ 3!y) lstuderot(yl~
l.ilu:.s (y. x )fl
 6 ur 12
d. .1111 inlinite
number of solutions
0u fh J"] Wh~raro the oin nvaloo ofth~< follrming 2

r x 2 matrix·~•

[2 -1]
() 11 (

wh<re a. b. c. d. e tmd fare real uumbc:rs

Qnd nbc '"- 0. lJndcr ihc matrix
-4 5
n111hip(ication opemtiuu, the ~t II is· a. -J lUlu I
a a sroup b. 1 oud 6
b. u mon('id hut not u gn1up c. 2 nml 5
c. u «>migroup but not a monoid d. ~ nnJ ·1
d. oc:lthcr a gl'oup 110r u .scuugruup 50. L.!t GtxJ : 11(1·xf1 :
·17. Which one .-,rth~ lolhm'in~ gnlph~ is NOT i:,.., g (1).1. wl1ere 1-•1<l. WlmtJS !!(i)'l
plnnor'l

"·b.
l
o. fl l
tl 2i
c. 21
51 Box P bas .2 red ballsund 3 bluo broils and
box Q has J Nd bulls ani;! 1 bluo ball 1\
ball 1s selected as t'ollows: (i) select o box
(ii) cboo~ u boll from lh~ liilloctcd box
Slt<h lhat each ball in the box. is equally
liko1lv to b¢ cbosen. The probabilities of
sdcding boxes I> und Q urc lr3 nod 2!3
reSf"'Ciively. Oiv<n thul u ball Selected in
the above process is a red ball. the
probability Utntltllllme from the box Pis.
Q, 4119
b. j /19
c, 219
a. Gl d. 19/.30
b. 02 S2. A random bit ~Iring (If lc.ng~1 n IS
c. 03 oonstruc.lcd by lo~tng a Jh.ir cOin n trmos
and seniug u bit to 0 ur l d~pendiog uu
d. G4
outcomes head und tail, rcspo<~tivcly. Tho
-IR. Consider thu fnllowi11g S)'Sii:lll uf probub.i l.ity tbnl. two ~'llcb rnndoml~
cquntiqn~ in three rcul l'arlab1cs 1<1. 1q und g•uerat~d ~I Lings ure tiQ Iidenticul1<;
x,. a. 112"
2xr - xl - Jx, ~ r
b. J.l /n
Jx1. I 2x1 I 5K1= 2
c. lin!
-x 1 4x3 I x_, = J
d. 1-1 12"
Tbis system ot equallOIIS hus 53. Co.tts tder th~ maQbiuc M:
a, n(l .'<('I urin n
b. a unlquo sollllllln
o, mo re lhan o nl! but a fint.tc .r1uwbcr ol
soluhons
 7 of 1:'.
57 Cons1der !he langunges:
L, =t""'l j,... (O. tfl
L, • w•w'J,..,tO.II'}, who1d f• • "!""'•hymbol
J., = wwjwEIO.lJ' )
Whrch one oflhe follt)wing is TRUE'I
fbe tanguug-~ recOI!fllUd b)' M ts· :t L t iSa dctcrm1mstic CFt.
u, ( " e ta. b f • fcvery a. 111 w IS followed
b L! i~ a determimstic CA.
by e.xuctly two b' s j
c. L1 ~~ a CFL. but not <1 \JCtl!frnlnlsue
b t" Ed a. b! I eWI) a ln w 1s l'ollo1•ed C'FI.
by or lcasr rwo b's l
d L, IS a determ101~tic CH
c I" e :a. 111'1w conmm~ the ~ubstnnllc 58 Consider Ute folloll'iJlll two pl()blems on
' Ubb' )
unduwted !J111Ph:r.
d (WEill, b) 'l w does nor conram ·aa' as
a G1ven G(V, £), tlo.ls G hnve an
a subString I
indcpendcnr set of size jVj -..1~
Let N, nnd N1• denote the cl!t$.Wli of
languages ac<:eptl'<l by nou-dctermmlsua
p G1ven G! V E), ooes G hnVI! an
mdepcntknl set of size 5?
linite automata and non-deterministic
push-down nuromata. resp<.-ctivoly Lei Dr Wj1ich one nf the followmg is TRUE'
and Dr denme the ciJISSCS of lnnr,uages a a IS m P and II Is NP-compleje
accepted by delennmi$UC 11nilc automain
nnd dc1ernnmM1c push-down nulomnta. I> u i~ NP-<omplete nnd ~ is in P
rc..~p<.>el• vely Which one or Ute followmg Is c. Bolh t:t and 11are NJ>.cmnploie
rRLfE7 d Bolh 11 and jlwc i 11 P
u, Dr c Nr nod D~ c: Np Consider rhc grnm111ar
b o, c Nrnntl Dr N0 E ~ E- n ! Esn n
c. Or - Nt Untl Dr - N• flora st.lth!l~c 11 I n x n. the handl~s lu J.be
d Dt ~ Nr and 0 1, c Nv nghi·SI!ntential form ur th~ rcducri(m :~re·
55 Ccuslder th.: lunguages a n. E + n and E + n x 11
Lt 1n"b"c"' 11.. m > 0! and ~L! : n"b"'c1" b n. E I o and E 1 ll x o
+ n, m > o: Which one or rhe (ollowing c. n, n + 11 rutd n - n \ n
~tntomonts is FALS~
d n, F + n and £ x 11
a 1. 1rll.: IS a conle><l·fll!e language bO. Cons1der tb~ grammar
h L1u L" is a cunt~M-free lanJ,:uage S - • (S) j u.
c. Lt and l.1 arecome~t-frc~ tunguugcs U!t tho nwnbcr of stntcs in SLR( II. LR( l l
d Lt"'L' IS n context sens11.vc longungc untl LALR( I) par$Crs for the g.rnmnrur IX!
56 l.~t L 1 be o rct"llrswo IQnguuge. :md let L! "" n: ar1d "' respee!fvely The followmg
be :1 rcc\lr!ilVely ehUh1erublo bu1 not 11;tationship holds good:
r~urs1ve langqage Wh1cll ilne of the a n a < ll t< OJ
folio" ing i.s TRUE1
I> n1- " ' .... n1
~~ I~Is recur~iv"' und 1., IS rec:11r~wely c. 11 1 II• n,
enumerable d n1 = n: = n,
b. /1 IS I<'Cur.;ive nl!d 1., is not Consider line number l of the follo1'~''8.
rettursiVely enumerable C-progrom.
,. w .. 1 .,
c, 1., n11d L, are rccurs1vely cmuneroblc
d T, IS n:cun;ively enumernhle ~nd /_, ·~
recurSJ\11!
 l!oJ'12
Identlt:y the compiler's respou~ about litis Clo ...

~~.
line while ercnlingtho oi]joc[-modtdo:
tt- Nn compilation crm.r
b. Ouly 11 lexical em1r
dl
c. Only syntactic errors
Th$ llip-ll!Jj)$ ure p~.>sitivll u<.lgc tri.ggered
d. l:lmlo I~Xlcul ruod ~yn~UCticerrors D FF~. Eocl1 st:lle is designoled '.IS o two
02 Con. oder Ute Foll•l wins circuit mvoh•IUJl u biT$Tnltf!: Q.,QJ, I.CI lh~ irritiol MOl~ ~C)()
po>itiv.: edge tr!gg"red 0 FR The: •lnlc lrnnl!irion soqncncc is·
ll

b.

Consider the !ollowmg tinting dlnJ.!rrun.

c.
Let/\1 "'P"'""m the logic lc1·e l on 1h" hnc
1\ on 1he i-tl1cl(lck period .

d.

~0
l.~>t A· ''-'PJ1lllel1 1 tho ()()ntplcm~nt of /\. Cuosi&.:r u th ~ ward_nlm,:ltiru: in~tru\:1ion
The correct output ..:qucncc on Y over tho
ch;ck periods I through 5 is: ADD A!RO J. laJJ
The Li l'ln operond {dcbtioutoun) A{ROr'
a. AoAt A IAJA.
u."'-.,; indexed addreSl>ing mode with RU a~
IJ. flu /1 1/1, {1, i\4 the mdex register The second opi>rand
c. A , A1/\2 lu 1\4 (oo•n·c<>J ~((/)0" uses indiri>ct oddrilSsing
d. AJ A, A~ AJ A; mode. A and n arc lllCOlOfY addrcssc•
ri>S1dinl! at tile second and the ilurd 11ords.
63. Tho: f•\II<~Wh\g dlngrnm r" pru!i<lnL• u liolit~ respective!~ ' The lirllt word or 0Jo
smte mttchiue which tnkes as input u instruction ~pecllias t.b~ op<:od~ the ind•~
binal)l number from tho l.w~ slgnititnnl register designation nnd the .source aod
hit destinution addressing modes. Dttring
exocutiM of ADD in~lructitm. th..: cwu
o_pcrllnds ·are odded olld stored on the
dostinat.ion (li rsr QpcrnndJ,
!'be number of monlory cycles nc.:dcd
dunog II"' ~xecutiou ~ycle uf tbe
Whfch one of the l.ollowing is 'l'RUll'l lustrucltun is:
"- h """'flllle:l r~ <.ltHil!'lem~ul .,r th~
iupUl UUU1bct
b. It COn'op\ltos :z·s OOntplemont <>f llw ... 5
input number
J. <'
c. It iJJcrem~nts the input number
(16. Match cnch of the high level lnngungc
d. It decre ments !Joe inpulJlunober smtemenL~ given on the left hnnd siue with
Consider d1c foi!Ciwi ng clrouit !Joe ruus1 nulurnl nddlt!!ising mode frt>m
thc}se Iistod I)O the nsht ha11d ~We,
L All] = B[Jl-
 9 v i 1~
2. Whii~ (• A..-. ): device interfoce rogisl~r lllld CPU or
3. iot lemp = •s: n•~•nor)' is ne@ligible, \"1••t L
< the.
minimum pediJimnnoe gain of opernting
(n) 1nd!n:otnddn..,.•in~
U1e device under intermp[ mode over
(b) Lnd""ed &ddrcl<slng oper.Uing it under program. controllcxl
(o) Autoincroment mode?
a, (l,o). {2b). (3,a) 3. 15
b. ( l.o). (l.c). (3.b) b. 2S
c. ( I ,h), (2,e). (3,:.) c. ;;s
d. (Laj. (2,b~ (3.o) d. 45
01. C'<>nstder a dirw1 mopped C{ocJ1e of sozc Y.! 70, CO!uidcr " Ji~k driw with lho foUowi~g
Kl! with blook ~ize. 32 b)~es. 11•• CI'U sp<-'<lifientions!
generates 32 bit Mddre>.'!l.:s. The number uf 16 surfaces. 512 irnokl;F$urt'r""', S12
bit;, •tocdctl f(l[ cnolto indeltins nud 1110 secto111 tnJCI:. 1Kll1~cu!or '"ullion sp<led
number ofwg bill urc N$p¢clivety: 3000 1p111. Tho; disk is opcrmed in uyck
a. 10. 17 stcnling model 1vbcnlby whcno\'er on~> ol
b. 111.22 hyte Word i'l ready it is •ent to memory:
~imilnrly, for \\riling, the: disk interiilce
o. 15. 17 n::~ds :1 4 "ytc: 1\'Qrd l'j"m the: memO!') m
•L 5. 17 each DMA oyd.:. M~n1ory cyuk lime il-10
68. A 5 ~lllge pipeline<! C"'l 'U """ l~e followina nsc:c. The n1aximum ~olag~ Q[ Lime
sequence of st~,ges: tlwl lhc CPt; gel.§ 'biO<Jked <lt!ring Dl\lll\
operaTion is:
JF • U18LnJOiiiM1 fetch 'lrom lll.~h'U<lti<MI
nunn-ory1 .. 10
RD • lnslructioo dc:eo<l~ nnd rogisler rt:atl h. :!5

LX • E.-.wule: ALU oper•tion for data and o. 40

atldn:ss computation. d. SQ
l\ lA - Dnu1 memory nC<:ess - for write 7L ~~1ppo•e n processes. 1•, - P•• share m
ao.:.:.s. lht: regisr er rl:lld at RD stage ls identical resnu1-.::e ""'"'· which can be
~~bed. restrvcxl :md rdea~etl 011c at a thue. 11••
utll,'<iru um re<ourw ro<jUu'etUent of pro<.'CS>
\Vl3 · Regi•ter write lmok.
P, i.. • 1 11i11:r<: I, 0. Wbiul\ OJUl of the
CoMider the following li.:<:JUill= of following is n Jmffioicnt condition for
io.s truct:ioll5: en•uing thnl dendlook does not occur'/
l 1: L R(), Joc:l; ROoo M(locl)
t,: kRO, RO : ROooRO+RO tl. "'l.. '1 < IIJ
1s:S IU.RO; l\looR2 - RO b. 'tL & <m
Lolouoh stage lltko: ouc olook uyul.:.
L'
What t~ the number or clo"k ~yclcs I'Mken
to u<n'nplete the alxwe ~e<1ucn~e of
o.
,., ,,, <(rll'+ n)
iruU'Uelillttli $turtin~ trow the fetcl! of 11 •
d. L ',<(lll'n)
a. 8 •••
b. 1() 72. Consider the foUo\\ ing, CC!dc frngmto.~l:
u. ll 1t ( ( -1) - 01
( .. ..s, ~t·M . W\a• . • · M tt l
d. 15 ...._ ( ... e;-1; pd.m;fl•W. W \JI"• • • . .,, )

69. i\ dwi"" 11ith dttrn tnm•fcr rhl~ LO KB'"""' Ll:l u.v be: the \laluc:s pnnttd by tho pur~::~~t
ill C<)lln<-clcxl ro :t ('PU. D~l:t i~ tran.•ferrccl process. nnd x.y be the values printed ·by
byle-wiJe. 1.4 1he int.,pl overhead be -1 tl1e child pltl<luss. Which one of Lbu
v-~ec 'l ne byte tmf1Sfer lime lletween the followmg is. TRU r;·1
 10 of12
a, u = x + IOand v =y The set of all tuples that must be
IJ, u = x + IUundv .-y additionally deleted to preserve rel\:tential
inte~ty when tbe tuple (2,'1) is deleted is;
c. u- JO = xand v = y
a. (3.4) and (6,4)
d, tt- JO= x artil v;oy
b. (5.:!.) nnd (7.2)
73 1u a packt't swltclljug network. packets ar·.,
routud tfotn source tu dc">tloa~on (ll~>ng, u
c. (5.2), (72) and (9, 5)
SJn,gle p•th havtng two in.tennediate. nodes. ~ {3,41, (il,J)aml(6A)
Tf lbe messu&e size is 24 bytes and ""cb 77. t'hc rehuiou hook(lillc. price) comains Ute
packet conrains a header of:; bytes. lhen title~ and prices of different books.
tho optimum packel size is: ASsuming thfll no twu bi)OkS hnvc the
IL 4 same price, what does the lbllowinll SQL
bl () quel'y list?
selet",llitle
a. 7 from book ~s B
(l 9 whu. (scl<d oqu•t(")
rrom book as T
74. Suppose the round tlip propagancm delay
where T.price > B.poke) < 5
lhr a I0 MIJ[)S Ethemet 1m-ins 48-bit
jammlos signal Is 46.4 irs. The mlnlumm a. Titles of the four most expensive
rrmue size is: books
a 94 b. T ille of" ~te lifl~ most inexpensive·
b. 4 16 book
c. 464 c. Title ul' tlte flfllt most expensh ~book
d. 5 12 d. Tilles of tlle !h•e most expeosive hooks
75. Let Et tlnd El be two Cll(l liC$ in an ~I R 78. Consider a relation scheme R = (A. B. C,
tljagram with ~imp1e sing.lc-valned D. E. If) on which {be (allowing fuoctiooal
attributes. Rt and R, -are two relationships dt'!>eudeucles hold! tA-+B. BC-+0, &-.C
betW(lelt Et and E1. where R1 is oue-to- C. 1)-)A ). what ar< the candidate keys uf
many una R.2 1$ tnany-to-many. Rt and R1 R'?
db not havt nny utmbulC!> ()f their Ol\'n. (\. AF.. BE
Whnt is the minimnlil number of tahlcs
requiJed 10 represent this si1t1ntion in tbe- b. AE. BE. DE
rehttii)JUII model1 c. AEH, Bl!l!, 13(:H
3. 2 d. AEH, W~H. DEH
b. 3
" 4 Com.rnon Dab for Quesrioos 79. 80
d 5 Consider the lhllnwing llatn path oro CPIJ
76. T ht f<)lli>win& tahle bas two attributes A
mtd (' where /1 i.s the pnma1y 'key 1tnd C is
""'"9 "'""9
the foreign key refereoolng A widl on-
delete cascade,
A c
:1 4
3
4
•
3
The ALU. the bus and all du> registers in ihe data
path are ofldentical size, All operntions iocludin~
s 2 incrtmentation of the f'C and the OPRs are 10 be
7 2 c11rdcd out in rtic ALU. Two cluck cyclds are
9 s liocded fill' mC1itory read operation - the first one.
6 • for loadiTig address in the MAR and the nexl one
 JJ of 12
f•>r ln~ding <L~ta ftmr1 !he meTJtOJY 1!11$ inll:l ~~e cL 0(11")
MOR. SL (b) Sl1Ppose w~ tuodi:ly the 8 bpv~ ftUlctlou
foo () SJid !<(Or• tlte Vnlnes ·of roo (i), 0=
79. 'The ins1ruction "add RO, Rl" has tlte l < r t, lll! Ol!~" when l11ey are compu(.cl
:registl!t tm11sfer in.terprelllli!ln RO = RO I WiU1 Otis modlllcatlon, !he tin1e
R I The mhtimlllll number of clo~l: cycle;; complexity far function foo ( ) is
needed fot .execution cyCLe of !hi.!! !rignific-.mJly Teduce.L Th" spac:;,
it!.•i.!UCDOII is complexity of Ihe m<XIified flmcHcm wordti
be:
a. 2
a. O(l)
b. ~
b. O(u)
0. -1
c. O(n4)
d, j
d. O(u!)
80 The inslnu:ticm ~call Rn. sub" is a two
word in$truetion. Assuming tlmt PC is
incremented dndng the fetch cycle of Ute Statement for Linked Answer Questions 82a &
lim word of ihe iru;truction. liE register 82b:
trnnsferlnterpretalion ts Let X anO 'flte I:IY<' -verticc;; iJl S mdi.rcoted graph
Rn <= PC +t; G = (V, S) hamtg distind posi:th.., edge weights.
PC<= MIPC]; LQt LX, 19 be 8 Jl'!rlition ofV ;mch that s EX and
The minimum number oF CPU c,lock I E ) ' Con$1der llie ~clge e ''"':rug tbe mitlimwn
cycles ne.,ded during tl1e execution cycle weigh! amongst 11ll tlro1e edges lltaL have one
vertex mX and one ve.dex m Y
oft.hislnstruction is:
a. 2
b. 3
81. (a) Tite edge e must definitely belong to:
C, 4 a.
b. th" lltinimum weighted splinning true
d. 5
l'fC
c. tlte wcig,hJ:ed sl10rt&.ltpath from s·toi
Linked Auswer Qut:Stions: Q. 8111 to Q. 85b
d, each pa6Lfroru s to I
carry t'l'(l lll nr ks eacb
Statement fo r L inked Ausw~r Questi on ~ 81a & e. t)le •\leigh led lcmg~ Jr•lil 'fium s to 1
8lb: 82. (b) Lei ll1e wmghl of :m e edge e denol.e
llte oonges1ion on rhal edge. The
CollSlder tl~e folJowmg C·functlon·
conges.tien on a paih is defined to be dte
cloubl.e Coo I lot Ill I
ma.'<imom of the congestions on die· edges
"'" i l •u.:
double of the path. We wi~h oo 1iml the path fro111
if (n••O) retarn l1 0s s to t having nrinhunm congestion. Which
·~I one of the following paths"isalwayssucb a
.... o.oz patlt ofminimum rongestion?
- u..o • .l<nf .h+l
- +• CooCU t a. a path from $ to t ill the minimum
..ceb&AI ..-, weiglrt spacing b·ee
r J
b a weighted $lwrted1mthfro.m s tor
c. an Euler w!llkfrom $ to C
d Hmnlltenian pnth from s ro l
81 Cal Tiie space oonwtcxity of Ute above
function is;
Staiemwt for Linked An~wer Questions 8Ju &
• . 0( 1)
8J b:
IJ O(n)
~. O{n!)
 12 or ll
Cons1der tbe following oxprcssu;m grammar The proQt Pi and a.dead/me d1 Profit P, [s earned iftbc
scnumuc rules for e"l>ression evoluatiou arc sUited task is co•npleted before the end of the d1" u•1it or
next to each granm1ar prodttction. time
e-...-
1 e ·•· E
1e Y e
E-..o- -.vo~
E!"..... e•.•., • e-....
E"'.nf ;~.... It ...... .. 1 s
T.
II
) .
T.
ll
...
10
s
...
D
1
T.
16
7
...
2$
)

(o) Arc ull tasks completed in the schedule

83 (n) The libol'c grammar and the scmunuc t·hat J;il'cs mn~imum -profit'/
rules arc fed to a ync<! t!lQI (\lhieh is an,
t.A I..R(I ) parser gcncrnlor) for parsmg nnd ~·. Allta.:;ks ~re conlplctcd
CI'Dluallng nrilhmetic expressions. Wb.icb If T 1 and T0 ore lei\ out
one of the foUowing is l.f:\lc about l.h~ c, T, and T.arc .leJtuut
nction or yacc for thl! gi vcu grumm:~r."
d T1 and T. ar~ len ow
a. It detect~ I'CCiirslon and eliminates (b) What is tl1e maximum prolitearned~
recursion
b It dctect.s reduce-reduce conn icl and n. l47
resolves b. 11}5
c It dclccli! shin -reduce- conf11ct, nnd c. l67
resolves the conflict lu.favor ol' a stuJi d. 175
O\'Cr a reducc acllou
d It dutccts shin-reduce conflict. nnd Statement for ); inked Answer Questions 85o &
rcsolws the corilliaL in fll\'or of n 85b:
reduce !lvor n ~hi n ncti()n
Cons1der the following Hoatil1lt point fonnnl
(b) t\ssumc the COfliltcls 111 f'nrt (a) of tins
question nrc resolved and an LALR( I) ·~ l~ 81 0

parser rs ~:enerated for pnrstng araOunet:tc II I I

c:~.']JressamlS as per the gh•eJl grammar.
Cons•dcr an expression 3 x 1 + I. Wlin1
\
St:n bit
\
~ccs'~
\
~l.totin::l
precedence and associoti1 lty prapert1es £,(liCW!f:'llt

docs no! gcncralcd parser real izc'1 Maullssn IS n pure li-nction 111 sigu-IJ1ag11ilude.
a Equql precedence :md lefi follli..
associmlyity~ expros>iml is 1wnluated
lo 7 13
85, (uj 1'be decimal nwnbcr 0.239 ·'- 2 bns
b. Equal precedence nod right the following bexade<;unpl rcprcsentutlou
nsOOcinti vity exproS5iuu is cvU]LJ11Wd (witJ•out non11nl i~ation n11.d rounding oil):
toY a. HD24
c. Precedence of· X' is hl,ghcr than ilinl of b. OD4D
•-t: and bolh operators arc lcfi C, 40 OD
nssociatLVC~ cxprcssmn IS cvnluatcd d. ~1) 30
1()7 S5. (b) The llom•ali7,cd representation for Ute>
d Precedence of '+' is higher than U1n1 !lf al>o\'c fonnni IS spcci fied as follo~>s. Ihe
-x·• 11ud b<llh opernlors = Iell mantlssa has nn implicit I preceding the
asSoclnlivc; expression i~ c1•ahultod to birtat) (radix) poinL Assume Utat onl) O's
~ arc padded in lllillc s!tilllng a lici!L
The nonnalized rcpresew.nlion of Ute
Slarement for Linked An>-wer Queslion1> 84a & nbo1·c number (1),.239 ~ 2'3 ) is·
84b: n. IIA 2(1
b 11 34
We :1re given 9 1nsks T,. T1• . , r. The execution c. ~9 DO
oC Ihe each task reqmred om unit of time. We can d. 4A EM
execute one task as a lime. Ench task T1 has n