I ol 11

1==:== INFORMATION TECHNOLOGY

ONE MARKS QUESTIONS (1-20) b. o•t w•
c. v• 1o•w•
A sci of Boolean connectives is d (0+ W1{ll+ I )()I (0+ I)•
functional ly complme if an Boolean 6. Let N be an NFA wuh n stales and let M
functions can be synlhesiv.ed using those. be the rnlnuuized DFA wtlh m states
Which of ibe followmg sets of counectil•es recogruzing the same language. Which of
is NOT funclionally CQmplete'l the follomngts NECESSARI LY lrue'l
a. EX-NOR a. m s 2"
b_ impliquion..negation b 11 ~ 111
c. OR, negalron c. M h!!S one 3ccept state
d. NAN D d. m=t'
sample space hllli lwo events A and B such 7 The following bit paltem represet11s a
lhal probabiliues. floating poinl number '" LEEE'. 754 single
P(An B)=l/2, P(A)a Ill, precision fqrma~
P(B)a 1/J. What iS P(AuBH I 11.1()(10() Ill 0 IIIQ(\1.)01)()()000\XIO\f(IO()O()
a. 11 /12 or
The value the number in dec•mal Corm
IS
b. IOll2.
a. - ICI
c. 9112
b_ -13
cl 8112
c. -26
3 \\'hal is the chromatic number of !he
d None of the abo\•e
follo11 ing graph'/
Consider the foliO\\ Ulg Boolean rUllCUOil
of fouf\ an abies
/\A,B,C,D)~ }._{2,3,1>,1,~,9,10,11,12,13)
lbe fw1ction ~~
a. independent or one variable
b. independeol o(lwo ,·ariables
c. independem of lhree variables
a, 2 d. dependem on aUtl1e r ariables
b, 3 Whru Boolean function does the circuit
•>
(!, 4 below reali~e·?
cl 5
-t What is !he si1,e of the smallest MIS
•

-
fMmd.rual lndependent Set) ol' a cbn,in of
mne nodes'!
Q. 5 '"''
b ~-
c. 3
d 2
5 WIJtch of the following re<&.ular
a. X: l .r-
C:>.1Jrcssions describes lhe language over
I0, l l cousisllng of strings that CQiltaUt
exactly IWo 1''1 c. ~Y+J:::
Q. (ll+ l).l l(0-1)·
d X.)l + )c
10. i\rrnngo the following functions In bo• hS rm alphn
inorea•ing •symptotic order: bCllhS uat -,., bela <~ SAl\ ffi
.,,
A, n [n.l'rumotion Tecltnolog)•
0 er• SAl\'E
c. •'" bash$ unt betJJ
1) , n tni' o The output of the lll$t command will be:
tl 1.000000 ,. u. MnthomatioM inlimtuation Toolu.10logy
u n, tlt, e. h SAME
h d. ~.c.e.. b h Mnlhernntics lnfomtntion Technology
c. a. c.d.e. b c. lnt'ormotion 'I echnolog~·
4. •· "· d. b. e it, lnf(llln•tinn Technolqgy S;\'II.IE
II For prQblemo ,'( and Y. \ is !'.' P-¢<nnpleic IS. i\ pr<l<:essut'lhll l h11• CAn')', ov.:rflo11 nnd
and X 01l<IJJoq tO Y 1n ·pol)'nllmial time. sign !lag hits us p4rl all' its program ~tntus-
Whicb of Lh" l'nlltlll·ing is TRUE? 11 ord (4 W) pcrt'unn• 4dditiQn of Ute
u, !f X oon11e JOI""'' in pol)'liOJilia1 L[Ule, lotio" lnl! two ::·s uuallpkm•nl oumbtt'l!
Ut<~l •o ~U~o Y 0 100 llUl a nd 11101001, ~ftor the
b. X is NP·cOinjllolc execution or thi~ nddiliOn ope~:atiQII. the
c. Xi! NP-hard status of tho cany. O\'ei'Jlow and sign fllags.
rospoclivd y will lac:
d. X i~ in NP4 but not ncocsnrUy ~..
a. l. L O
oomplete
IL Whicb oftbc rollnwing i• rnuE? b. 1, 0. 0
o. 0. L 0
n. The cost of senrchfus em \ VL tree l'
a(l()g n) l>utthotl)ro hinary "'"'""tree d. l. 0. 1
isO(n) 16. A paging !!<>heme uses a 'l'mnslotioo Look-
II. Tht ll<lst ilf Stal'l>hm!l lin A VL 1M> is aside SutTer (TU3). A 'll.l:l-oo=• lake.•
Ui log n ) but llidl of d .:ompldl" blnaf) It) ns •nd u mum
a~.
'"''""'"Y "'*'"~ t3k"" Sll
\Vlaut t• the ciTccti\·~ acct:l>di Hl<> (in n• )
lrt~ is O(n logii)
lf the 1LB h.il JilUO i~ !>O"h a.nd there is OQ
u. 'fbc cosc of -SCAI'ohiug n hinurv ~urclt
pagc-fuuh?
tree i• 0 (log n) bul thnt of an AVL lrta
B. 54
is fJ tn)
b. 60
d 'l'he llOSt or ~"~11lhing ''" · ' VL tree is 0
c. 65
(n log n) lmt thot vi' • h.nory sea!'llh
tree LS O(n) d. 7>
13. i\latcll tho ~I'Ogramruing ptuAdigms lUid 11. Find if the following st11tcmenl~ in the
lnngun~cs giYcm in the fullo,\'ing t.lbl..:~ ¢ont"''' ol' sollw~rc: (.:sting "re 'rRUt.: '"
P'i\LSG.
l'ltwclltmll
1n ,_..,..,
n Obitot orienlld
~ ~1011
b Lim
"" (S II StillemcoLLot>•·eragt "'"'tnllt guarantee
Cl(coulion of loops in H prog•·•m
Ul Fund'-! • C Fortnft 7l Pooool under test.
11'1) l.olic ldC+-t s..nt.otk. J.,.. (S2) Vsc of indepenlh:ni plllh tc~tin.g
,,, 1·<:. U.-tl. I.U-h, IV-a t.:rilerion gu12rnnlces e~eculi<m nf
caeh loop in • l"l•gr•m under tc~l
b 1-a. IJ-d. Ul-<l, IV-b ntOtd thou QUQO::,
~. HI, II·<>. HI-h. IV-a
tL 1·<>, ll-d. m.a.IV-h
•• Tntc. True
b. True. Fal•a
14. Cons1der the execution of Uiil followin& c. fulse, True
coaumands ln u shell on o Llnux opea'llling
d. Fulsc.11alse
.l4Y,Slem.
bMhS c ol olpllll
IS.
~laUtcmotics
bush$ iu •I ph a bolll
 ..! ul J:!
9600 asvnchrooous mode wllb odd
Ul
plll'ity onJ t1~n Sh>p hi ts'" the rrumu'l
:1, I 0,1)()() b)1es ' C •MS· )61-J61•.... tJ64 - I• - 2)+1)
J64:··f
h, 12,()()() bytes
·-
1

c. 15.o0o bvrcs ,_16S·l64 - (36S- ..-I) _

c; J6S'
J . 27.000 bytes
•c . )&5 . J64 . )fil ··"~-lr-2)•11
19 \vl1tch ol' the Jbllowing is TRUE ''nly vi' t 164# :
XML butllJO'l HTML9 l6S· J04 .. ·-(.l65-r+ll
n. Itis dcm•cd li:om SGMI . d. 165"
b Jt de..:t:ibes cootohtattd laynut· 14. Tho '-"Xponcnl ,,r
II m ahe prim"
"- II allc~ws ll"-'r d~lined tugs futtorizatlon of3001 L•
d. li iucslricted \lillY II) be used with web u. 27
browsers b. 28
20 Provide the best nmtcjlin!! between tho
"· 29
t!ntri.:s 11\ the tWt\ C()lllmns gi\'t.:n in tho.:: d :10
tnble belnll' 15. fn how ltnll)' wnys can b blue bnll~ and r
11 Pro.n • J<rvcr .Q) _t!'itt"'o\ 1.111 red bulls be distributed inn dishnct boxe!l'l
ua KoZaA oc.-.. bl Cocbtn•
(ub-l)t(-.r-1)!
1111 SLIP c1 P2P
IV DNS ~ ppp II, (n -I)! 61 (II -I)! rl
a. l·o. IT-d. ID·c. lV·b (H(hr)-J)!
b H. TI-d, ill-.:. LV-a b ("-1)1 (n-l)! (h+r)l
u. l·u, 11-c.JI I·Il.IV·b Ill
d 1-b, 11-o.;.. lU-(I., IV-u ~- iirl
(n+(/o+r)-1)1
TWO MA..U QUesTIOM8 (11·75) d nl(.hr-1)!
26. Cnnslder Iho lield C of complex numbers
with uul.lilifllt nod mulriptic-utioJn. Which of
21 Whrch of following iitsl m·dor
the
the follo\\ing Jl:lrm(s) u subtield of C willt
ti·•rn1ulno ;, logknlly vu.lid? (Jere n (x) ts u
addition nnd muhirlicatio n"
[it'll order lomwlu ""h ~ u~ u frro
(S I) the set of real numbers
vuriablo. and f~ is u iirst order Ib n nub'"~'
ml l'rl!e ' 'nonble. (S2) {ntibl u arltl hare mtiuuul11umbct'!l;
IL- £,11 ~ (:!r, o(z)~-+ [vs.P-+ cr(z)j (S3) tn+ibl n' + b') ,;J I
[x, P -+cr(s}}-.. f.8 ... (vz.a(..r)ij a. Oolv Sl
b •
b StandS~
c. k:t..a(•) ... P)-+(\Iz.a(•HP)
c-. S2 and S~
d. l<".r. a{.r)l-+ 11-+l'v..-. orCs>-+ PI d. Sl nndS2
22. Whrch.of rhe follow lug is the IICj!lJtion Clf
27 0 is u .simple undirwtuu (Lmph Some
[ \lx,a ... (~.,8 -+(Vu, 3 v, r))J ~ vortices o r G are .,r odd dO£""'· Add o
u. j2. cr-+ (v,.. p _.(:lat. VY,, »I node ,, lo a und tOOk~: it odjac.:nl to ooob
odd dcgrc:c vcr1cx of 0 . The rcsultan1
b. (!!r,a -+ (Vy,p .... (:a., 'lfy, -,r)» groph i~ sure to he
c. rw_.._,
~-
... (;v.,..., ... (Vo,3Y.~r)» o. rcgulur
13>; tz II(\'] , / 1\ (3a, \ly, ..,, ))J b. complete
J.
23 Whtu i~ th<~ rr"l)nbility tltot itt u rbod\))nl~ c, Hnmilt(rninn
chosen group e>f r pi!Oplc ul lcusl llute d. Euler
people lln,·c the ~ntn<> birlhdoy" 28. Consider the tollo"1 0(L "Milsse diagtnlllS.
1__.:.):::65:..:·3:;64:.;_
.._.. ·..!:0:..:'>:..5-_:r...:+:..:LI)
365'
 ~ of 12

vveo
32. lf lhe final srntes and non-fmal slates tn 1he
DFA below are interc,hanged. then which o
lhe following lanJ,'liJiges over the itlphabel
ta. bl will be uccepted by 1he new OFA'l
{II Iii] \"') (IV)
• •
Which nil uf Ihe al)<)w represenl·a la1t1Ce~
a. (i) and (1\1) OJUy
b. (Ill and (in) only
c. (in) only
<t Set of all stnngs thar do nt\1 end with
cl ll), (ii) and (iv) only
nb
29 II' M IS a square marnJ< with a z.ero or
b. Set aU slnOg$ ~131 be~,~o wrtb either
derenninant, whtch of the followu1g
'
assertion(s) IS (are) correcl'1 - anaor a b
c. Set of all strings thai do no I con lain lhe
(S I) Each row of t>S call be represented as
substrin.~; ttb
a linear c.ombiuatiou of tho o~1er rows
cl The set described by lhe 1·egulur
(S2 J Each column of M can b~ represented expression b•~~a•)bs)•b•
as. s Linear combonation. of ~1e ocher
columns 33 Consider tl1e followmg Languages.
(S3) MX =0 bas n nomnv1al soluliou L1= la'b'ckj i = J. k '<:: Il
(S4) PS has nn inverse L,,.,(a'b )• = 2i.J 1 k '<:: O)
a. SJ nnd S2 Wluch of the follow111g Is true?
b. Sl nnd 54 n. L1 is not a CFL but L2 •s
c Sl and SJ b L1n Lt = ~~ and Lt IS non-regular
d SI , SlandS3 c. LtL L, is n01 a CFL but L; is
10. CousJde1 the function f( x) = ,;>- -2x - I d. 1ltere 1$ a.4-state PDA d1at ~cepts L1,
Suppose an execution of the l'iewtOn- bullhere IS no DPOA tbat accepiS L~
Raphson melhod to find a zero of f(x) J4. Consider a CFG \\1th d1e folloWIIlg
starts wtlh aJl approxsmation Xll = 2 of '\. productions.
What Is !he value of ><2. 'the approximation S , Ai\IB
of x thai lhe algori thm pmduces after two
A-> OA AOII
iterations. rounded to three dectmal
places~
B - OfiOOjl
a 2.417 S 1s d1e sum svmbol, A and B are non-
termiJlals and 0 and l are the lc.munals.
b. 2.419
The lnn.guage.generated bY this g:rnmmnr 1s
c.. 2A23
a. {0" IO!"ln ~ II
cl 2.425
31. I I' f(x) IS delined as follows, what fs lhe b 10'101I01 IL J.k <!:OJ v 10"10""1n :;:, q
minimwn value of ll.li:J for x e (O,lJ? c. {01 1 0'ji=j ~ 0 f U fO" I Otnln;:,l f
d The !11!1 of all scrin~ over t 0. I I

!
lS M'lwzs! contalning ar least two O's.
f(.r) • b I 2 35 Wh1ch of che ro1Jow1ng, lauguag,es is (ru-e)
Jl +- othttWi" non-reguJ ar?
)I

a. 2 L, ={O"' l "l () $ ms n s 10000 )

4 ~ I w I w reads the same forwnrd flnd
b 2_!_ backward
12
L, = tw E (0. ll 'lw contains sn even
'~
c.. -6 number orU's and an even number of l's
a, L1 aud LJ OJIIy
d. 2~ b L1 w•d l.t oo.ly
2 c. L; only
 5 OJ J ~
d. L1 on!) b_ ADD (X). (){)-
36 C011S1det the rniiOI_.ng IWII llnllc ~. ADD·fl\/, (X)~
mnomntn. M1 nccep!s l 1 1111d M: ntcepcs d ADD·(X!. (;<)
L~ 3'1 Con5Id.:r u Cl'll where nll th~ mstrucuons

~~~
tC!jture 7 Cli)Ck cycles t() ~omplcte
execution There uro 140 mstructinn> rn
the IIIStriiCII(IO ~t It js found thnl 12$
----~L~-- ~
control .'itgoals ure lleeded lo he generated
Which Me llfllle li>l lllwmg i~ 'I RUF."
by lh~ CilniJOI Ullll Wrulu deslgniOI! the
o Lo =t., borizontul micropmgnunmcd control WilL
b Lo c l z smglc nddress tield fotmnt is used for
c L, n L1= !I> brnnch conn'OI logic Whnt is th~ mull mum
si,,e ul the ~()ntnil ll'()td tmd ~clnt rl\1
d Lo V Lt "' Lt
ttddr~:;s 1\!gi;LJ:r
37 C(lllSJtkr the followmg stut~ dougrutt1 ,md
iiS realtZlltiun by u JK nip ntJp il 125. 7
b 125. 10
c 115.9
d 135. 10
40 A n(Jn pipclfoetl ~mgJe cycle prac~AA/Ir
<>peJutln~ fit 100 M ~l t. Is convened u11tt a
$vnchronol!l< ~·pcliu~d pt·oces~or with llvl!
stng~ roqulnng 1,5 ti:'\!C. I 5 !1."'-'<!. l nS<.'C .
cu
I 5 nsec and :! 5 psec, re!ij!CCtfvely, The
l'he combin~rionalc•rcuh ge:ncmles J and
delay of the latches I$ 0 S nscc:-. I he
K.ln terms of'- y n"d Q SP.,'C<Iup or th.: ptpel i n~ proccs~or lllr a
The lloolettn expressrons 11 u J nnd ~ nre ltll'ge number of instru~tlons is
~. xeyundx!B.v
"· 4.5
b x ED y tmd .x (fJ y b. ~ 0
c. 3 33
C X (fJ )I 011t/ .t f1> ;v
d :;u
d ~·El)'<mdx$y 4I Assume lhOii n mam memory with oniv -1
38. Assume the LA (J(}t ls the eflc.:uvc pages. 1::1ch of 16 b) ws, 1S inutally empty
~ddri!Ss uqual to (b~ romems of locauun Tl1e CPU generateS !be foliO\\ ing S<Xjucncc
X. \V.tth X •ooremented b~ 0110 word length of virt~ uddr.:ssl!s wtd uSes tbe Leosl
all.:r the emcuve addres~ t5 calcul~ted, RtlCently Used (UUJ) page replncement
l.A -{Xl J$ U1e ellmlve nddr~;-s aw al tel pUlley
the contontlt rll' IOClttinn X. Willi X 0,4.ll.20,24,36,olol , 12, 68 72. so.
8~.111. 32,
decremented b) one word length before 88, \12
th~ clleclivc llddress >S cakulateq LA =
How many page faults doos dus S\.'qWnce
(X}' is th~ ~tTect\ve address equal to the cal!l<c' \\~uu are tb~ page nmnb<Jt~ of the
COnll!lllS of hx:ation X, Wllb X pageS ptC${llll in the main memory ut th~
lf"'.'remt!nt~d by on~ 11 ord lenglb ancr !h~
end or the ~equence'l
~IT....:tive udd~s rs cniL•ulnt<d Th.- f(jrmut
!L 6 and I, 2,3, -!
oF the instmclllm is (opellde, sovn:e
desnnation) winch means {destination <- b_ 7and L 2.4_5
wurcc or do!.>;lln:ufon) Using. X liS a ~rack c 8 and I, l , J . 5
pointer. which or tho following d 9 and I l, 3, 5
instructions CllJl pop Lbc lop two clcmenl$ -12. ll te two numbers giwn below are
frQm the smelt, perfoon lhe udddJou multiplied using the Booth s algorullm.
Qperuhon und push lhe result lx>ck I!' the Multiplicand. Ol(l l 1010 1110 1110
srnck Multlr licr. 1111101111011 1HH
a, ADD (Xh {Xl
 6ol I!
H, '" (\IOU)' ul!dili0/1$/SUbtructi(Jil~ ON llJ_ MABCKVFPH
required for the multiplicotlonof llJe. ohove Pt~k tbe tme stntemenl fromlhe f<lii<>WlJlg.
two numbers? a. I ond ll nrc pre order and fn order
... 6 scq.uenccs. rcspccth·cly
b. 8 b. I """ 111 nre preorder and p<!..<;l order
c. le) s..:qucmtA;!s, rcs_pt.~tivel~
d. 12 c. Jl i5 the 1n order sequeocc. but no tiling.
43. If we usc ll.ndix Sort lo sort n in loge.,; m mole tan be silld abqut h<: mber two
Uoe range to112 • nl l forsoJue k 0 wbicb is !;.,qloi!OCCS
iodependeo1 ofn. doe IIJne toke• ' 1\oold he d. II nod W are tile preorder nod io order
a. O(n) scqu.:nocs. respcctivoly
b. 0(k11) -47. Consodcr the foUowitlg 5cqucnccs qt node<
for the ~ndi~cte<l ~ph gi \'Cll bclo\V
c. O(tl log nl
d. ~)(n ')
44 . Whc:n II - 2"' ror SOIIIC k ~ o. llkl
rt.-currcuce relation
r (")~ ../2r(11 1 2)+..J,;. r( L) ~ J
ovnluntc~ 1\l

u. ..J,;(ipgu-1)
b. ..{,;hi/!, II I. uhelilgc
e. ..[,;log ..[,; o, ubeJbg d
d. 11 Jog ..J,; OL udg~bef
IV. ndhcgef
<15 l'or the lttldircC!led. 1\CT~Jn,-d gtoph gi\ICn
below, whkl1 llf Ihe following iiel[Uc'lle¢S A !XlpU1 Fir,;~ Scurch (Dil"Sl i~ $tuned ~~
uf edge-,; rcprc.o;c~ll:s n correct e."ecution of node Q. The nodes ore llste<l in the order
Prim '~ u11!'1ri tl Ull Io cC!U ~-tnu:t H Mi niJllniU U1cy Qf\! lirsl 1'is1te<l. Which aJI ol' ""'
Sp<uouJn~ Tr«e'l above s (are) pq$Siblc outpu1($)?
• a. lund nJ Only
b. J! rutd Ill oul)
c., 11, [[I oJld IV only
d. 1.11 und IT! only
-IR. a.~•sider u lltlsb tuble .,r siz~ I I thul llS<'>
open addressillg 1\~tb li11ear probing . Ld
h(k) = k mud ll be the hash (unction uS<!d
~ (!L b). (d.11, (t: o). (g. i). (d. u), (g, b), A ~C<Juen<...., nf r<'()(1o'ds "ith k<.oys
(c.¢), (f. h)
43 36 !12 87 I I -1 71 13 J-1
b (b, <). (c, 1), (f, d), (d. u). (IJ. h). (g, h). ~~ inscncd into an imtinlly empty hash
(h. f). (g. i) table, the bu1s ol which ore. index<-d from
c., (II. 1), \L C)o 1d. OJd'l. b). \C. C ), (f, bJ, ?..<:ru 10 1<:11, What is th~ index nf the bin
(g. b).(£. l) inhl which the lost rewul is i11serted?
d . (l\. g), (8, i). (h. J). (f. c,. (f. d), (•1. '11). a, 3
(a. b). (c. u) b. 4
TI1e followiog ~U'ee
nre knmvn to be 1he ~. (1
proorder, 10 order md ll\~~1 order ~qucoccs
d 7
or~ bin lU) tree. But il is not ~11\)\\01 "hich
is -which, 19. Wbnl is IJ1e oulpul printed by the tbllowing
T. MBCAFl-IPYK
c code?
U. KAMCBYPF! l
 7 of 11
52.

.' ..............
•Jneluae <•td Lo . ~> A C pfQgram ls given below
' ru
I
~M tn f 1
,.-..
eha~ 6( GI ~ " wo~ld•
1nt 1 , j ,

t orfhO, j =-S : i <(j t

I
pn.ntf 1 ~ \:: \ n ' , a~ j
•tl .. J '"' ol j · - j)
I.e

.._ .....
i .Jf
..._ •I'I'CU 1 • 1 ( · • •·
a.r•urtlh
u.., ,.,, .....
f ....
•r . -rt. I'll". •• • . tt •) It

r-u... )0; , ..,.

' Qo • 7"1 • _j l • • ii-JU1•
I
n. dlt0\1
b. Null suing
Wllat should be the contents of the arrny
c. dlrld
bat the end of tlJe program'?
d. 11'01'011'
5(), ConsidCT the C" program below, What does " h
a.
il pcint'l
U.QQlWS. <U4lo.tD
~tLne .._.. , • .• , ~ • •• a • PI b • t.p
"~· "I
YO.t4 ..,., tint •· .1oe
I
b' n d
bt.
~
C.Vt
• • , •• h : b • ~~
b. h e
c !
lfotd ....-p] (}nt •• • .fat: •b)
t
n c-
c, c h
J !
Jnt - -b O
I cl
n o
Utn..l > na.l. t --.ltf11Ua1.t ..a1 1
Ht~ • AWill ~ ....,...1-f"'*\•1.
it~l ._ """"'' ( ..,..lUo~~~u-.1.., c.m-lll 1
tu~a l • I e. t1 '
Pl'lat.I.C'"td, td' • ...-!, JIUIQ I ,-
b I
53. The follo\\~ug
is a code witl1 two tlut:ads,
a. 5. 5 producer nnd l.bat can run in
consun>~:r.
b. 5.4 p:u;~JJeL Funher, S and Q are bi.o;u:l
c:. -1. 5 semaphores equipped wiili the suwdard J>
and V opemtions
d. -1. 4
·~ s • 1. 0 ._ lh
51. CoiiSidcr the C progmm given below. .i nueu- XI
WI1at does it print? ~,. , ar r·eer-r
t include qtcl.lo. l\> Whl ••• t hle lela ..u.t•• t;CUe Jdo

- -
f'IS, I •IQ)I
1nt . ..tnt) ~ . P~t): coo.--.(.K);
r Y COJ1 VC.Slt
int 1.1:
iClt -a(IJ = (_ 1..2.1, t. S , 6 ~ 1 , 1 ):
Which of tlte Collowing 1s 'TRUE 1lboul the
torCtcO; i <lt 1••)( program ubove'l
aU J • a U I • l: a. The process can deadlock
1++:
l b. One oftJK! thn::td.H an starve
.1--: c. Some of U1e items produced b) the
(O<'Cj•?: 1 ~1 j -- 1(
i.nt i ._ j/2: prodnccr 111.1} be lost
•!11 • a fil - 1: d. V alues generated und stored in ·.<' by
l the producer w1ll :~lw:J)'S be consumed
priQttc•\d . \d• .i. a (lJJ;
bi:fore tbe producer can gener.ue tLIJQw
~. 2..3 ~·ldttC
b. 2. 4 5-I. An operaring S)SICm unplcmcnts n policy
c. 3. 2 l.bal requires a process to release all
resources before makiug a request lor
d. J , 3
 -·Oil
ll ofl 2
another resoullle. Sdect t~c TRUE Tuk
>tatomout from tho Jollolllng: Tl .
~. B<1th •IDrvationlll1d duudlu<:k cuu tiCCur T2 Tl
b. Sta.rvalion can ocour but deadlocck
n Tl
T4 Tl
l!llnnui o c.cur T$ T2
c. S1urvnliou cuuuot necur bm deudk•.:k T6 Tl
can occw• T7 TJ. T4
d. Neither Stunatfun n!lr dciti.lltJCI; cun T1l T4
T9 TST7T8
OCC·Uf
TIO T6.T9
53. tf ~•e lllUe·sJjco u."'d 10 the rouutl-robin
scheduling poliuv is more than thu Answer tbe Jo llol\'iog,quesliuils:-
m~ lllUJU 11m~ requu"d to execur.. lUll' (Ql ) Wloat os the m:.xionum nttUJber ol
ptuccss. ~ten the policy will !aSks tltut cun L"' don.: concurteutl ?
u. tf~geu.:rat~ h' ~hllrtesr Job fin<t (~2) Whnt ts the minimum rime required
b. degenerate to priority scheduling to cqmrletc the pmjccl. ns.wmiog thnt each
c. dcg<:nurarc to Jlrstoomc first $crre task rcquirus 1111~ lim~ unit and lhoN i$ 1111
d. non~ <>rlha ahtw• rustTicrinn 1>11 lhe number "flasks thai cun
be U!>nd in fl'ltlllldl'l
56. Mal~b Ill¢ JoUow.n!!. flng bits used 111 the
context Ill' 1 trlual memO'!) man4gemcnt on
u. 5.5
tltd le!'l Stde ll'otb t h~ tlitlereut purpo!!Cs uu b. 4, 4
~Je ri!\bl sode of ihe table ~low e. 4.5
u. 5. 4
IIJ o;!1Y lo~ :59. A snf\w= engin""r is required to
~V* impl~o\1"111 tWO Silt~ uf ols,oritltms r,,. n
>ringle $:1 of mlllrix op)rutiuns in an <.~bjcat
I) Vllld li'IRC ' Ortcnll:d progrJmnti ng lnngotaj!e: t·hc tW(I
a. J-d. ll·o. ffi·b. rv-o se~.s of nlgcuitluus ""' tn pnwide prccisimts
b. l·b, 11-o. IU-a. LV-d af I 0'1 and Ill.., rcsf"'QlT\'cly, She dooi.d~s
o. l•c, 1!-d, In-n, fV-b leo implement two clnl'tl"s. Lo" l'rcc;isi(ln
d, 1-b. IT-o. ffi-d, IV-n Mnlri.~ dnd lHghPTeeisio-1 MuhJX;.
pmvidin!! prccostOlll< I o·J and I0 .
57 Which ol' tho follo\\1nj! nn: NOT
rc~rectivcl}
OOIIStdorC<J When Onnoro<tlll!\ J\onction pnlni
tl>r a s<'lhvnrc pmJcct? Which one 1>f tbe li>ll0"1'1 8 i~ tb" ~~
alte·malll c lor the !mplemcntation?
CO I) E~'ternru inputs and <'Ulputs
(S I ) Tlii: 111'0 ,;ht.S);o!S sb<.11lld b.! kctll
(0 2) f'((o!!fauuuiJt~ lwoglutg< In he tlsed
lur lhe.impl.,mcutuliuu mdcpcndcnl
CS2) Low Prcctsoon Motro~ s.hould b<>
(() ~) Us~r tnl.!noclions
d~nved from !Hgh l'rooision Mulrix .
(0 4) Ext~nonltnl~rf1H:es
(SJ) High Preoisiou MatH.'< sbuuld be
(C~ 5) Number 11f pmemmmllf• 1n ohe deri ved frouJ Low l're<:isiou Matrix
soAwaro r ro.iccl
(S4) One tlu~s .ltCJuliJ IJ<> .idrived l'rorn tlt\l.
10 6) l'nesused by 1hesy~1~m other. the hiemrchy Is itnntatcnal
u. 02.03 u, Sl
b. 01 , 05 b. S2
c. 04.06 c. Sl
tl U2.05 d. S4
S8. A ~vrt\1 or" pif>j~ct plun h11.~ ldontfli<d ton (,(), Wttfcli •lf lhc f\lllowing requorc menl
tnslv; "lth ench hnvin~ dep.;ndunci<lll us spociticul1clns <lllll he vnlidated?
given in the following loble;
S I: ll' d1e system fails during any
Oj)"ruiit)U, th<Je ,o;)>nuld 11!)1 ~ UIIY
lossofduto
 '' ul 1:!
S2· The ~')'stem Jllust provid" rt'!SOTI11bl~: A I MOps sutcllilu link coun<.~CU; two
portbrnwnce ""en und~r mnXlmum ground <ilntions. The 3ltitude of the
load conditions satellite is J6.504 k and speed of the signal
SJ· rhc snfl\\ un: e~ccutnble n1us1 be is 3 X I0° tll/S. What should be the puckct
d~pluyublc lmder M'i Windo" s 95, slzc f,u· a ~hannd ntiH7.Ution Qf 26% fot u
2UOO llJJr.l XP smellite lln~ using g~>-b;\ck-127 sliding
S4: US<.,- mtcrli\cc windows must llt on u wmdow protocol? Assume thol the
slimdtlrd momlor's SCI\.li!JI acknowledgmeut pud;ets nre ncgligibk in
n. MmtdS.1 si£e uud tlwt ther~ Ul'l! 1111 .:.rrors duriuj;
C001JilUIUCObOn
b, ~ ami S2
II. 111) by (~
"- S.l t111c.l SI
b. 60 bVL<.'S
•.L S2 rutd S I
c. 2411 hy•es
1\ 1 l.ct R (A. B, t,. I>) he u n:lntionnl s~hemn
1vilh the Jollowmg 1\mctionut d 9(1 bVl&!S
dC.1JCndencies: A~B> 13~ (C~O wul 65. The mmtmum frume sv..c rcquucd for 11
CSMA/Cl.> bu~l'.d ~ompul<-1' tretwork.
D-+B. The <k.'l:ompo~itiou of H urt.o tA. mnnlnj! ol lGbps on n 200 m cnbte with o
f:!), (1:1. C) 1mcl ( B. D)
link speed o 1'2 ~ 1()0 m/s JS
a. giVes a los~lc')S JOm, uml1s dl11endenc)·
pn:sen•lng a. 1 25byle~
h 25{) l!)'tc~
b. gi1'<!S u losslcss join, but ls not
llepend<'UC) pn.-.erviug c. 500 bytes
~. docs no\ gil'c 11 lossless JOitL but 1s d Non~ of lite above
clep..•ld<11CY prCSl'l'Vm!' 66. Duta trnnsuJiUi!d on ~ link US<!s Ute
d cloes .n ol give a loss less join and JS not following 20 l)llnl\ :.~Jh<!me for <!ITOr
depeJh.leucy prtlSI!rvin[!. i.lclcc.timt ·
()2. Lei R(A, B, C, D, b. P,<.i) tll! a J:c!Uilonul l!uch se<fUt:OCI! Of 28 btlS I~ IUTUII!!ed Ill a •1
j;eh~mu in which lh.: folloWl11J:! runrtional x 7 UJitoiX (rows ru ttJrouglJ r:~, oud
dependencies are known to hold: culunms II; through d 1) :md i~ padded "ith
i\~CD. DE-+P. c ..... t~ 1)->C aud 13-. a column do nnd ro1v q or parity bits
G 'l11e rolatJona1schenl:) H ·~ computed u~ing the l:i1•U11 parity sch~mc.
F.&llh bit Of ~r>1wmt do {rl'lSpc~tivel) , rtlW
a. inBCNF n } g1YCS the pant~ or th~ com.':;ponding
1J in JN11, bill not tn HCNF rim ./respectively, column), fhese 'ltl bits
C. in 2NJ'_ but OOLIO JNF ore tnuc;mitted over the data
d not in lNF Unk.
63 Uttnsider Ute fnllow[ng, thl\.oc sdtcdttles of d, d, d, d, d, d, d,
lrunsactions Tl , T2 mtd T3 [Notation; In 0 I 0
"·I 0 0 I 1
the following N'o'O r~'Prcs~·llls Ute u~tion Y '•r, I I 0 0 I J I 0
(R rut lt:~ILl W fot writ~) pertonn~d h) r, 0 0 0 I 0 I 0 0
tnttlS!tctiott N 1.1n \lb,jcct 0 .)
~&ll *' a.. SC - M M" 1& ..U. la J.W '•r, 0 I
I
I 0 I 0 l •
~at Jlllt 1M a. ,.. , . LM w •• u. tlli: I 0 0 0 I I 0
&Ill 1M *' -. 2M , _ • l U. 1• ua ID
The UJ1Jie slt0\1 s data recewecl I)" u
Wluch of Ute rullowiug ~lUI"nteUL~ ;,; re-ceiver ruu.l bus Jt comtptll<l b1ts. Wh;t IS
TR11f1 U1c minimum possible vo.Jue ol' u7
d S I. S2 llnJ SJ IU'C alJ eonlli~l a. I
<!tJuivaletllll! each other
b. 2
s
h No [\VO ur 1' S2 rtn<l 53 llJ:e conn lCI
eqwvulent to euch otha
d
L'. S2 is connie! oJ!llU V~l<'~lll(l s:;, but nut
10 s1 fl7 Two popultlT muting algoriU1ms are
Dislilllco! V~'Cior (DV) rmll link SMe (l.S )
,1 S J t~ oouOict "'1\livnleutlo S2. but nol
rou1tng Wllach or the followmg are lnol!']
to S3
 It t of I~
S L: t:uunl to mfinity is ,. problem onl~ c. Sl and S3 Otlfy
with DV and not IS Nllting d. 52 Md S4 llniY
S2: To LS, Ute shortosr path nlgoritbm i~ 70. The .lolnl JlUUiber or keys requited lo r u set
"'"only 31 one uode o f it iudividuals to be alM In comnu miculc
S3l In DV. tbe slwrtestpaU1 ~tlgorithm IS "itlt each other ~M>ing secret key 1111d pttblic
run ouly at one nod¢ key cryptcr..y.stems. respectively ore:
S4 DV fCC)Uires lesSer llUmbcr of a. n(n ·I) nnd 2n
notworlc mess~ges limn 1.!' 11(11- l)
b. 211/U/d
u, Sl. S2 und S4 <>nly l
b. S2 and S3 1111iy
n(n- 1)
a. s I. S2 Wid 53 Old)• c. -'---'- uud'211
2
tL S I und f,i4 only
68. Which ol' the following !rlaicmenls aru 11( II- t}
J. -.!..-..!. tmd II
·rn tJF.'I 1
S l. TCP hnudle• lx>th congt!stion uud
llo w co lllr<ll Cem81on Dota . . _.._ (1'1, 72 A TS)
l!i2: IJ DP handles te>ni_!ll$1i•>n bUI 11~1 noll\
o<mtrol A 13inQr) Search Tree lllST) SIOM vnlue~ in the
S3 . .Fust retrnnsmit deals w1th cou£estiun rouge 37 tt1 573. Consider tho following ~cqucnces
butnut tlll I v control t'fi\-JY:P
54 : 51~11 ~tan mechanism deals w1 1h I. 81, 5.37. i02, 439. 2S5.. .l76. ~05
both ctl ngcstion and nl'lw contrill 11. 52, 91. 121.. 195.242. 381.472
o, S I, S2 nnd S3 only 11 142. 248. 520. 33(). :ws. 270. 307
b. S I nnd S3 only IV 550. 139. 507. 39:>, 463. ·102, 270
c. SJ nnd 54 iluly
d. S2, S3 oml !'l.l ool~ 71 . SupJXIS<! the BST hnt; bc!t!Jl un~tJCCcssfull~
(i') Tho three wny hapd~hakc for TCP searched for key 273. 'Wltith ull QC Ute
\Jonnccnon cstnblishmcol i~ _shown below above sequences list nod~> ill llle order tn
Cl14nl •
I S.IWI' whioh 1ve c,tuld have eucOunllm)d ~tllm in
I the !letlrch?
a. l.t aucl Ill only
b. I and m only
"· IU ~tnJ.I I V utlly
d. HI only
Wbich ot' l11c: foOowin~ ~slcm~Jllll nre Which of Ote following stnh:mcms is
'11WE'I TRUE'!
S! : i..os• orSYN ACK from the server ~. l. U nud IV nrc '" order scqueuces nf
wlll nc,.1t establish a conncctjon three different BS'r~
52: Loss or ACK from 1J1e cUenLcannot b. I is a preorder sequence ol oomc BST
~srublish
rha (\OJJnt.'lllion wiih ~39 as- the root
83: The ser\'cr moves USTEN ~sYN_
c. II is un in order sequence oJ S<tute 13ST
RCVD..... SYN_SENT -> whe1-e 121 is the 1'0()1 and 52 is" leilf
ESTABLISHED i11 the slole machine d. IV s o PQsl order sequence of some
1)11 uo pocket loss BSTwi1l1 149 o.~ the root
S4: l'htt ~rwr mnve.• LISTEN-.SYN _ Ho" mam dls1io~1 liSTs CIUl be
COIISlfiiCied 'witJIJ disllfic I k"ys'/
RCVJ)-tmiTAB(.ISHED in rho
st;lrc muchino "" no )]IIC~el· los$ a, 4
o. S1 lllld 83 only b. ;)
b. Sl nnd ~only Q, 6
d. 9
 l l of12
Corumoo .Outa for Question 7.& and 75: Statement for Linked Answer Ques tions 76 and
C'onsidcl lht follo\vlng rducional sch~ma: 77:
Student (school-id. sch-rol1-oo. soame. saddress) A llinilry tree with h > T nodes has n, IT) nnd h,1
School (school-is!. sch-n<i,me, sch·nddr~. $Ch· nodes Of cit-glee one, two (lnd three respecrivcly.
phone) 11te degree of a nt!de is defln~ as Lhe number of
its ucighhow·s.
Eimllmenl (school-is!. scb-roll·ml, crollno,
e.-.;ammm1e)
liJI'.nnResult (el'OIIuo oxarmnaue. mad<.sl
76. lh cllll be e~prcssed. ll$
ac n• - n: - 1
74 Wilat does d1e followtn~ SQL quel) b. n 1 - 1
otLtpu.i?
wf"··- · «\""'
flt:Lilt:t
r11~
t· !
it1cql c-. ~~ ~ ~-.u~
M!Ut:: lt,adol:lohl<i • ~1·1.6
,. c. ["':ill]
"".• ......,. • .,._ , . . . , ... ,.•• 11.-
~ ll , f:ll.tl llft' d. 11,2 - 1

""'
._.,.~ • l.U ).IQ 11 • •~~1 ).d n1 ~~

·~ ·:~
- L.I4 77 Starting witb the above rree. while there
Ci~ . . ~1.·i.ll
!!W'llec ~ i· • " 2li~J
remains & node 1' of degree two tu ~te tree.
9dd an edge between th'c t\Vo nmghb<lurs
a. for e<rch sch<>OI With onore than 200 of,, and Ihen remove v fi'Mt 'the tree. How
S!lrdents appearing in exam:;, the name mnny edge~ will remain nt I he end of the-
of the scltool and tbe number of I00s process?
scored by its students a. 2*-nl·3
b. for ench school with m~re rhan 200 b. 02-t-2• DL-2
students in lt. the name of Ute sebool c. n,-oJ
aud the uuUJbor of' IOOs scored by it> d. u.z - u.• - 2
srudeots
e. foJ' each school \villi more thart 20.0 Statement fo r l.ink<d Answer QucstiQn~ 78 and
students in ir, tho name of the school
79:
nncl the number ofits students scoring
I00 in at least ooe exam A C'FG G rs given wiur the following prt>duccions
1.1, noUting; the query b~s u >'Ynta.~- l'ITW
where S is the smrt symbol. ,•\ is a rron-termfnal
and a nnd ban: temrinals,
15. Consider ~te foUowiJlg tuple relational
csknlus query: s-.uS ) A
,,,.fi..._. ........... ,.,
... ...........
......... ·--·-
11•1~ ............ ,
....._.
......... , "'
~ ....
tf• I• • ......, .... ...........,. '••t•10»t
A.~

78.
nAb I bAa e

Which ,,r
the following Strmgs is
genernted hy the gtnmmnr above?
If" n· student oeeds to score more than 35
a. uabbnha
mru:ks ro pass an exam. what do..-.s the
que.l)• return'? b. aabaaba
"'- n le empty set c. nbababb
b. schools with more thllll 35% of its d. ll:lhbaab
students elirolled iu some exam or the 79. For the correct answer 111 Q ,78' now many
·oUter steps ar~ required to derrve the string and
c. schools with a pass percentage nbovc how many parse trees :JJ"e there'?
35°~ over Jill exiiJJ'IJ! taken together• a. 6 and I
d. sc~ouls wlth a pass percent;ogo abvve b (>and2
;l5% over each e~-am e. 7 and1
d. 4and2
Linked Answer Qucsti~~t•s: Q.7G 10 Q.85 carry
twu markl; each. Stale.me.nl for Linktd A nswer Qurstioos 80 and
81:
 12uf12
Cou.<idl!l' u computer \\1111 a 4-way set-ru;sooiauv~ P2 :
nwppo.:d Ciich.: of llle followmg ~h(JJ'uctcrisucs: u
lotnl of I t--ID of main memory. a word size of J
l)ytc, u hlocl; :rizc or22R wortls and wcacbe si?..c of H In <• 111
SKB p <>nt! 1"-\d•. n I:
)
el s e {
priqt_f f .. \d· , n._\ 21 1
81). n1e nwnber of b1ts m Ute TAG, SET and f1 r.t21 •
WORD Iiclcl;;. rcspecl1Vely aro:
lL 7 6. 7
b. 8. s. 7 11. Botl1 1'1 und P2
c. II. o. 6 b. P2 only
ll J)_ ·1. 7 c. PI 11oly
81 While ucccssing Uu~ mllJllQl)' locution d. Neult'-'r 1'1 n11r 1'2
OC795II by U1e CPU_ the contents of !he
TAG field of the corresponllh.t~ cache line Stntemeul ftlr l.inkl'tl An~w•r Qui>$1iun• 8-1 :ond
Is 8!\:
n. 1M KX II l<lOU l:lt!sl X hus fP mtdress 192.168.1.\17 und ts
b. IHIOOIIW connected through rwll romcrs R1 and R2 to
e. OIXI I HXXI :moU1er hosl Y with ll' .tJddres:~ 191.161!.1 .&0.
d. llOOtnlllt Router .R1 hns U' nddn:.'<Soi!s 192)68.1.135 oml
192.168.1.110. R1 has 1P addresses 192.163.1.67
Stntemrnt ror Link<d Ansrrtl' Questions 81 ond and 1'12.l6S.l 155. n1c ocu:oask. l,lSeJ io the
83: network tS25S.255.255,ll4,
C()t~•1dcr the code fragment wnmm ut C bclt" V'
void f ' 1nt nt OJVen the information 11bove, how ulany
I distinct subncts are guur!ll1tccd Ill aJr.,adv
if In < = 1 J I o;{il;l in the 11d wod;
pl'intf~ "\d~ . n).·.
) a. I
else ( b. 2
ftn1 2l ; ~- 1
P t lnt (l•\ d • • n'\2) 1
d. ~
&'5 . Which IP nadr"'!s should X configure its
gutew~y u:t~

82 Whnt does It 173) prml'l II. f 92. J68, ( ,()7

a. OLO I HIIHI h. 191.16N.l , I I()
b. OICl lollfll c. I ~2.168. 1 135
e IOI IOlOL d. J!I2.16K.LI55
J lt)HII I()2
S3. Wlue1h of the loll<>wlnj! implemcnwuons
will produce the same Glllput lor If 173) as
the nne (rom Q. 82?

i f (n / 211
I (n/2 1: