I GATE - 2007 I or l·l

I INFORMATION TECHNOLOGY
ONE MARKS QUESTIONS (1·20) b DB repository
c. Aircrafl night controller
d Signal ｰｲ ｯｾｳｩ ｮ ｧ＠
Suppose there are two colns. The firSt com () A processor takes L2 ｣ｾ ﾷ ｣ｬ ｣ｳ＠ to complete rut
gives beads wilh probabilily 5/8 " hen
inwuclion 1, 11te corresponding p1pehned
ｴ ｯｳＮｾ･､＠ while the second coin !;ives beads
processor uses (, stnges willt llto cyecutidn

om
1\;_ch probability t/4. One of ｾｊ ･＠ two coins
times or 3, 1. 5. -1. ,.; and 2 cycles
is picked up al rnndom with eq unl
pn)babifill nnd tossed.. What is the respec\ivel> What is llte aov'111ptotic
probability of obtaimng bends? speedup assuming !hat ｾ＠ vel) large
a, 7/8 number ofinslructio11s are to be execu1ed'/
b, 1/2 a 1.83

.c
c. 7/i(. b 2
d 5/J2
c. 3
d ｾ＠
ｾ＠ ｾ＠ J Wh'al IS the Whicb of the follo\110!: tnput sequences

ce
1 Lei A be I he malrix [ 7
for a cross·coupled R-S lltj>-flop realized
maxin,tun. 1·alue of X 1A." whefe lhe '' all1 II\ o NAND gates rna) lead lo an
ma."'imum is taken over all .x !hat are ｕＱｾ＠ oscillation'/
1utlt eigenvectors of A'? a. It, Oo
ra il. 5
5+../5
b \11 , 10
Co 10.01
b -- d. 00, II
The followioll circuit. implementS. a two-
m
r- 3 input AND g<Ue usill/,\ 111'0 2-1
d. - -
5- $ mulliple.xers
2 • I
xa

3, Consider a weighted tmdirccted graph m th

po$itil'e edge 1\eigbJs nnd let u1 be au
edge in tbe graph, It is known ll1nt the
shonest path from tbe ｳｯｵｲｾ･＠ venex s to u
.e

hns weight 53 and ll1c shortl'St path from s XI Xl -l O

to " has 11eigh1 o5 Which one or lhe What are the values of XL X2. X3 'I
foJIQ\\ing !;latemenls IS always ｴｲｵ･ ｾ＠ a. X l : b. X2 = U, X3 ｾＭ｡＠
;t. 1\'Cight(u.v) < 11 b. XJ = b.X2 = 1.X3 = b
w

b wetght(u. v\:s 12 C'. XJ = a. X2 = b,X3 = I

c... we1gh11 u. v)> 12 d. Xl= n,X2 = 0.X3 = b
d. 1.-eight(u,v) <:: 12 I) Consider an ambiguous grammar G and its
w

Itt the Spirnl model of sofiware disambiguated version D. Let ll1e language
del'elopment. tho pnmnty delerminant in recognized by the t"\\o grammars be
selecting acul'ilies In each tteralion is deooted 1>.)' L(G) nnd L(D) respectil'ely
w

a. Iteration si1e Which one ol' lhe folfo11 iog is true'/

b. Cost a L \D) c L(G)
c. Adopted process such as ｾｯｮＡ＠ h L (D) :::> L(G)
Unified Proce;ss or Extri'Jlle c. L (DJ = L(G)
Programming d L (D) IS empty
d Risk Ill Processes l'J t111d P2 use cribcul_nug in
5. Which of the follo11 mg systems JS a nJOSl the foltowi ng routme to achaeve mutual
JikeLr candid<lte ex!llllple of a pipe ru1d e.xciUSIOII. Assume chai criticnl_ Oag IS
filter archalecture'/ lmuaht.ed 10 FALSE In the mam program
a. Expen .system get_exdusi,·cs_access ( )
 2 of VI
( (iii) T·imeont value .is set to twjce tlte
if (critical_tlag = FALSE) ( propagation delay from lhe sender to tlte
ｾｲｩｴ｡ｬ ｟ ｦｬ｡ｧ＠ ='rR'LII;; ｲ･｣ｩ ｶｾ＠
ciitical_region () ; ｖＮｾｊｩ｣ｬ ｯ＠ of Ute foUowillg choices ltold1
CJ.iticul_tlag =FALSI£; ｾ＠ (i) !s f'll,se, l}ul (j.i) illlll (iii) l\l'e. tn1e
) b.. {l) and (!ii) are f>il!!e, bul (H)[$ true
J o. (j) and (ii) are f>lis.t) but (iii) is trOii
C(lll$J<Iet Ute·followmg sta\eJnents, <L (j), (jj) wod. (i.i 1) w¢ false
(I) H is po;;sib1e lOr both P I and P2 to J4. Consder " TC P. connedlon -iro a ｳ ｾＧｬ ｴ･＠
access critical _seg[Oll concurrently. where. tltere are no Olllstandlng ACKs. 'Tite

om
(ii) Tlu.s may lead wa dtllJdlock. sender ser!ds l wo segmentS back ｬ ｾ＾＠ back.
Whloh of tlie f<illowing .bold>? Tlte. sequence number:< of ihe 1irs1 and
a. ＨｩＩｾｦ｡ｬ･ｮ､＠ (Ii)is lrue seCQnil segments ｾｲ･＠ ｾＩＰ＠ and 290
\), Both (i) and (ii) are fillse Je$11ectively. The ｦｵｾｴ＠ ｾ･ｧｭｮｴ＠ wns losl,
c, (i) is 1roe and ( ti) is .fulse but the second .segment was .reoeh-ed
cl. Both (i) and {ii) are true ｣ｯｾｏｹ＠ by the reociver: Let X: he tlte

.c
IL Let a 1nemocy l tavc four Jrc-e blocks of aruollllt of dala carried ln ihe .first segment
size$ ·lk; 8k, 'ZOk, 2k. These blocks are (in byte§). and Y be 6te AGK rumt ber sent
allocated foU.owing Ote ｢ｾ ｴＭｦｩ ｴ＠ sb:aregy, by dte receiver 'The value$ of X and Yin

ce
The aUocation reqoesll' arc stored in a Utat order) lll'e
quene11S sho!"n below, a. 60 ana 290
raItt IJ I&IJIJIJ ｉｾ＠ lflp& I
The time at which ll1e requ<:St J'br J1 1Vill
b. 230 and 191
c. 60 nnd 23J
d. 60 muJ 230
be completed will be 15. Coru.-idcrlhe following rwo statements:
a H\ (i) A hasl1 function (tltese are often osed
b. 19 far ｾｭｰ｡ｴｩｮｧ＠ digiml sigtuJtnrell} is an
m
ll. 20 injective fun.:tioil
d. 37 (ji) An l'llCrypti.on technique such a!l DES
Jｾ Ｍ The add=s seguence geuernted by lradng ·perfomos a penuufati<)lt,OtL t.be etemen.ts qf
xa

a particular progrnm axeCU'Iittg .in 4 pure fts i nput alphabet

demand paging system with 100 bytes JJCt Which on• of t.he rollowing optiooll! is
pasei.s valid for u.e abovtt two i<!altllnenl!;?
0100, 0200, 0430, 0499, 0510, 0530, 0560, ｾ＠ BotlJ'olre flll51'
b. Slatemalt (i) is tnoa and. Uw uther ls·
.e

0 120, 0220. 0240,026.0,0320.0410,

Suppo:>siO tflat the ｭｾｮｬ｜ｴ ｹ＠ Cll11 store orily false
oi\0 page and lf x is the address wllicll " · S tdleJUenl' (ii) Ｑｾ＠ 1rue ao1d ltoe otlter 1•
CSUS<'$ a page fuult Uten ilie bylcs from false
w

ｾ＼Ａ､ｲ･ｳ＠ x 11;1 x+9ll are loaded nn to U1e d. Bodt.11re tme

memory. lfow many page faplts will 16 Tlte minim11111 pooiti"einteger p Nltth Ihal
<><:Cur'/ 3• modu!CI 17 = liE
w

a. 0 a. .5
b. 4 b. 8
c. 7 q, l2
w

d. s il. 16
13. Consider the follawing shit.erroe.ols ah.,ut 17 Rxponeoliation ｩｾ＠ aJwavlly used operation
tlle limeoul ｶ ｾ､ｵ ･＠ used iu1'CI'. in public key cJyptogtllphy. \\rtUch of Ute
(i) 11le timeout value is set to Ute RIT following options ts tile ti.ghtesr opper
(R01mtl Trip 11rne) measured during 'I'CI' l1ound oR 1ho JtwnbeJ· of mulnpllcations
ｾｘ＾ ｮ ｲｯ ･｣ｊｩＨｬ ｯ＠ esl•blistl!Denl f<>r the ･ｾ ｴ ｴｩ ｲ･＠ rcqnll·ci! ro compute l>" n•odulo 111, OS!>,
duralion pf lite OOMectiM. ns m1
(li) Appropriate ltFr e!lfitnation algorithm " · OQog 11)
is used to set the timeout '\oalue of a TCP b. oc..{; >
CQIUlectlOIL c . Oqlflog n)
 ｾ＠ ul I.\
'L O(n) .-c'Oftlcnt>
18. A lirewall i$ to be eontigured to ol1011 One: ｯｬＧｭ ｾｮ ｹ＠ lmc•
ｬ ｯｳｬｾ＠ in ·a privotc network to freely Open </Cocttent >
TCP C<llltlt ction• nml ftcn.d ｰｮ｣ｫＮＭＺｬｾ＠ nn TOC.
open cc>nnection•. However. it will nn)} One of mnn)' content ･ｮ ｴ ｲ ｩ ｾ＠
:•llow ＼Ｚｊｾ ｴ･ｭ｡ ｬ＠ ｨ ｯｾｴ＠ tn s'-nd ｰ｡ ｾ ｫ ･ｴｳ＠ Oll < TO\>
＼ＺｊｾｪＬｴｩ ｮ ｧ＠ open TCP eoru1ct:tion• or ＼ｊｂＭｯｾ ＿＠
COIIJlCctiOn$ lhat Ol't' being ｏｰ＼［Ｎ Ｇｴｬ ｾ ､＠ (by Comider the XPath C:.'\'ptc$8ion. • [not
ｩｮｴ･ｲｾ＠ I ｨ ｯｾｨＩ＠ bnl not aiiQII them lo open Ｈｾ･ ｬ ｦ Ｚ＠ TOC) J
rCP cQnnectiQM ICI h()SL< in lhc ｰｲｩｶｮｴｾＺ＠ What wouhl l•c the resu II ul' the: ｾｩｶ｣ｮ＠

om
oul\vor.l-. To achic<.e lhis dee minimum .KPlltb <.'l<jlr<OibiOn wh<:tc the current nude ;,
c..pnbillty ufthe ｬｲｾｷｯｕ＠ ghuuld he thot of ｂｯ＼ｾｫ ＿＠
Ｎｾ＠ A oombinotiotwl cirwil a. l'he Title and Content element•
b. A finite automaton b. !'h.: Content Mtd TUC elemenlll
c. A pushdown outomuton wl!b one ｾ ｌｬ ｣ ｫ＠ c. The: Tltlc lUld TOC olcimc:nlli
d.. A pushdown automnton with two d. !'he 'J'itle Content :mel TOC elements

.c
ｳｴｮ｣ ｫｾ＠
I fl Gi\'eo below ate some ｬＺ ｬ ｾｉｌ＠ lb1e>,
img,
src upicl.. jpg... widlh •'-250'

ce
haight="'256" border=\)" ｕＵｃｚＰＱｯｰ ｾ ］＠ ｭｰ
?. I, \Vhioh one; <>I' tl1e.<e ｬｩｵｴＭ＼Ｚｾｲ｣･＠ l<1gic
ｬＧｦｮ ｵ ｢ｾ＠ is- \'ulid1
＼ ｭ＼ｾＺｰ Ｎ ｮ ｡ｭ･］＠ ｬ ｭ｡ｰ ｾ＠
..::.area ｾ ｨ｡ｰｾ＠ ｾｰｯｬｹＬＮ＠ u. "•(P(<)=> <.>1 -•1) => (I ""TP(.rl)-=> (<'>t)(r)l)
ra 75.
Cords= ".SO. 50. 50. IOU. 100. lUO. 15.

bref 'il.htm J'",;.

too. so·· "-
J, :UlP(,vl Q(>))=>(('!o'P(.tJ)=>('hQI•JI)
ＧＨ ｬＧＨ Ｌ ＼ｬ ＧＨＡＮ ｴＩ Ｉ］＾Ｈｩ ｾｐｬ＠ (3.<(1(.<)))
..-area jhnpa Ｂ｣ｩｲ､ｾＺ＠ coortls,...H)(I. 75. 5'" d. V.<J)'PI >.1) :=> :;yt..rPt.•,J'I
m
hrel=-'-_lcgi-bin O.pl?vl=asL: ab""":< age"'> 22. TI1c tt-;tpc-zoid•l cnolhod i• used to tvo luote
Ｂ＼ｾｊ･ｬ＠ sb.,pe=··def'llull'' ｨｲ｣ｦ ｾＢ ｭ Ｎ ｨｴｭｬ＠ Ｂ ｾ＠ I
1
n>ap- lhc nuntc:riClll voluc of t'IL< . J
With ref.,renco to tho HTML ｩｮ ｯｾ＠ g,ivcn •
xa

nlmve, ｃＨｭｾ ｩ ､･ｲ＠ the ｴ｢ ｬ ｫｬＬｾｩｮｧ＠ ｦｲ､･ｮｴｾ Ｎ＠ Con.•ider lbe followms values for the step
(il C'li<k ing un the: poinl ｾ ｳｯＮ＠ 75> dQ<:S not size h.
b•,•e uny effect (il ｈ ｲｾ＠
(ii) 11tC \1 Ch brOI\8ef C3n ldctUiJ)' the ｾＡＱｬ＠ (ii) 10 J
.e

ｾ ｵｰｬｩ ｣ＮＱ ｨ ｬ ･＠
within th" tO the ｭ ｯｵｾ･ｴｬ｣ｫ＠ (iii) 10-'
imnge nnd the ; ub.<C<jUCiit actitm to bt> (ill) 10-$
tnkcn without addilional te.<pltn"" lionu For which of !hese yulucs of the ｾｴ｣ ｰ＠ •ize
h, is the computed value gnarontu d lo be
w

ll>e wei) <erver

(iii) The ､ｯｾ＠ in Lht cgi-bin 1-RI . will ｢ｾ＠ cun-c.o:t to sev\31 decimal pL1c:es. Ass ume
resolvod l)y Lhe web hr(IWSCI' before tt Is th.il lhctc arc no round-off cn'O"' tlcc m
w

ｳｾ ｴ ｩｏ＠ the 11 cb ｾ｣Ａｃｉ＠ er. compu!Jltion.

(iv) The 'i'd.html'' ｲ･ｱｵｾｴ＠ when .otenlto the a. tiv)only
rn n mrr n:quo:st.
\\C!b ,erver '"' " n:sull h. (iii) and ( iv) ｯ ｮｬｾ ﾷ＠
w

El<acily how marly of the ｳｴｾ｣ｲ ｮ｣ｦ＾ｬ ＾＠ giutn c (ii), (iii) •nd (iv) only
above •re com::ct? d. (i), ( il). (iii)1md ( iv)
23, A panial order P i$ dclin.:.l un t)lc sci nl'
"·
b
()
1 nul\lr•l numb<:tll Ｎｴｾ＠ ｦｯｬｩＢ ｾ ﾷ＠ H•'fC x/y
c. 2 u,·rwtO!I ｩｮｬ･ｾ＠ di\'isio.n.
d. 3 (l) (0,0) £ p
20. ｃＧ ｯ ｮ ｾｩ､･ｲ＠ tho XML document fr•gmcnl (ii) (a.b) ｾ＠ I, if and only if a•o 10· b0 ,\ 10
given below: and (a 'JO, b' LO) "' P.
<Book> CoMider Ute foUo•' lng ordered pain!
<l'itlcPOAl'E 2K7 ｬ ＮＡｸ ｡ｭｰ ｬ ｣ ｾ ｦｬＧ ｩｴｬ ｯ＾＠ (i) ( 10 1. 22)
 I nt j,l
rii) m. tOt) function, consider u.e following
(iii) ( 14j, 26.S) sulemenl8.
!lVI tO. IS3) (i) ｔｨｾ＠ funetion 1 tCJminol<'i fur tinoleh
\\1tich uf lhc<e mdcroo ''"""" nf ｮｯｬｵｾ＠ many different' • Iue. of ｮ ｾＮ ｌ＠
numhCillarc: contained ｩｾ＠ f>l {ti) The funQtion flenninale$ lor infmitcl)
a (i) and (iii) many differml v:>lue< of IL I
b. (ii (JIId (i\) (iii) Til<> function f does nol lmnioatr for
ｾ＠ (i)Qnd(h) finitelv man\ different \'3lues of II?L
d (ui) .lnd (I\) (IV) The rur;clion f docs DOl lcrmin•te for
A deplh-linn sean:h o; P•-rfunncd ''" ｾ＠ infinitely many dilfcrt:nl ,......,. nf n_ l

om
•lircctcd ｡ｾ｣ｬｩＮＡ＠ I!T•ph. l.<-1 dful .ICJwl.c lhc Whtcll 1me of Ihe folln\Oing O(llmn.< ,. 1n1c
11me at \\hich \crt.,; 11 ;. \i<dcd fQf lh, nflhc ohove1
finottomc •nd flu I the IJme at" hieh the dff a. (i} ood (iiil
.::til 10 01c vcrtc:x b t•Tmlll31C:S. \\'h.:h of b fi) and (i>·J
the foUo"in! ;tattm<nh is ｨ｡ｾｳ＠ Ｑｊｾ＠ for c. liihnd (iii)
.u cdga tu.'l in the gnplt'/

.c
d. (oi) md (i\1
• dl•J d[\ I 28. Consider a h•.!Ch function that di.,tnuuh:o
h d[uJ fl' I key• unifonnly The h•.to table ｾｩｺ｣＠ iK 20.
c.. Jlu] flvJ Aller h•shing nf hnw mony kc:vs will the

ce
ct f\u l qvl t•robability lllal any """ ｾ＠ hu•hcd
.lS \\hat is the l•rgcol ｩｮｾ･ｧ｣ｲ＠ m such ｬＱｾｴ＠ <:ollide, witJ1 IIJ1 exi;ting l)l)C Cl(CCild (),5
.:very slmpl.l connccltd grJph \\ 11h n a. j
ra , c:rtlc:cs ttnd n odg.c:'! c.ontnln;. Dt ｬ｣ｾｵ ｴ＠ m b 6
dil'fcrcnt!pnrumiJ:! ln:<:ll'l \!. 7
n. 1 d. 10
b. 2 29. When seorching fqr tho: key voluo (o(l in a
1!. 3 hinan ｳ･＼ｾｲ｣ ｨ＠ ｴｲｾ･ Ｎ＠ nodes ｾｯ ｮ ｾＱｩ ｮ ｭｧ＠ the
m
d, n k<lV ｾ ｬ ｵ Ｎｳ＠ 10. 20. 40, 50. 7(}. 80, C)() DI'C
20. fons ider " joh• J 1, ):. , .... . '• ｾｵ｣Ｎ ｨ＠ tlllll job ｴ ｾﾷ｣ ､ Ｎ＠ not noccssarily in U1c ot"da'
J. ｨ ｴｵｾ＠
tJ.'<cC.ull<u' timu t1 o111d a nnn·tl<:gutivc: gi'nm. How many diflCn:nt onlcl'll "'"
ｬ＠ "1. ll>u wlliglucd mcnn
xa

inlcgcr ｨ ｷｾｩ possible ln wlticb these l..ey values can

C<>mpMion lome of 1l11; ,j1oh• i; defined Ill ucour on Ute • =h palh Jiom tho mol to
•• the node contniniJ!S the vo1uc 60'1
be · 1
L'*·'· \\h•'Tl! 'I 1, IS LhQ completiOn
tl 35
b. G4
.e

,L
... w c. 128
d. 50.10
time ot';nh J. ａｾｳＱｮｩｧ＠ ｴｨ＾ ｴ ｨ･ｲｾ＠ 1• unl)
ｾＰ Ｎ＠ Sllj)pos<: vou are gi\1:n an unplem.:nt>IIOn
one rrrn:e.«nr ., ailuhh:, '" \\ h.tl l>rd..r
w

of a queue of integers. The Opcr:UooM IIJol

t!'tU$1 the JOO• be exc.:Uied 111 ordor tn
em be pcrf'otmed on the qucu.: 31'C:
minimile tl1c 1\Cil!htoJ mean ＮＺｯｭｰｬｾｴｩｮ＠
(1) a Empty (Q) - Mlll'llJ true if the 11ueuc
tiiTlt ｯｬｨｾ＠ job<?
w

u; ernp!y. I'• is¢ othenn•c.

ｾ Ｍ Ｑ｜ｵｮＭｾｲＮＬｩｧ＠
order ｯｦｾ＠
(ii) delete (Q) - d::lcteo the cl<-'lllC:Ulottbc
b. ｎｯｮＭｩ･ｲＮＺ｡ｾｭｧ＠ onJcr of" , &onl ur lhc qu<Uc .... rctum.• iiJ uluc
.:. Non-mcn:ll11ng order of\\ ,t.
w

{iii) m.•c:rt (Q, i) - in•ert. the mleger 1 at

d Non-mon:a<•na order Of\\ , 1,
the rear of the qucoe.
27 lbd ｲｵｮｾｉｊｯ＠ I "ddincd •• follo\\5
Comider lhc follO\• ins funetion:
1JII ItlnI II) I
if(n • I)Muml ,
\ <>id ((que= Q) I
lnt r.
｣ ｩ ｳｾ＠ if (n ｾ＠ 2 - II) n:IUm t1n l2).
tr{!isF.mply ((,)))
elM' rc:lmn f( 3rl-l).
i ｾ＠ delete (Q)
l rcQ> .
As•wninl! thai •rhitranly L>rgc tnlegcr<
imert (Q.i) ,
.:.-tn be ｐＢＧｾ ﾷ ､＠ •J • ｰ｡ｲｾｭ｣ ｬ ･ｲ＠ to the
}
 S elf 14
l I
ｾ Ｇ ｾ｡ｴ＠ operat.lon ｩｾ＠ perlormed by lht obovc; prinu· (""toe". p<lp(J 1;
ｊ ｵｮ｣ｴｬ･ｾ＠ rz I
n. Leavi:S1ltc <tucuc Q uuchongc.t \VIt•t is the uutrlut of tbo ｰｲｯｧｴＺｾｭ＠ fot tile
b Rever5es the order of the ･ｬｭｮ ｴ ｾ＠ in fo tll)wing input'!
tho queue (l ＵＲﾷＳｾ［Ａ ｾ Ｋ＠
.:. Deletes the clement ｾ＠ Ute lion! of Ute .. IS
queue Q :tnd ins<:rt• ｩｾ＠ Ut n1e ｲ｣ｾ＠ b. 25
keeping ｴｨｾ＠ Other elemenlS in the Mamc c. 3(1
t)nler d. (5()

om
d. Euttltitl! Ute <tucuc Q 33. ｃ｣ＡｬＮｾｩ､Ｚｦ＠ tbc pi<J!Iram hclow in. a
3L Coll5idcr lh<: C progr.uu givoabelow: hypotlwticallanguag.: wluclt :ttlows globnl
¥indllde ＼ ｳ ｡､ｩ ｯ Ｎ ｨｾ＠ ｶｯｲｩ｡｢ｬｾ＠ :tnd" c:hoice nf c:o 11 by ref=ce
!nt main ( ) 1 or c.'lll by va lue ｭ･ｴｨｯ､ ｾ＠ of ｰｾｲ｡ｭ･ ｴ ｡ｲ＠
int sum 0. maxsum 0, i. n 6: passin_g.
int a( .I - (2. Z.- l 3,·L2); in1 ｪ ｾ＠

.c
f'or ( i = 0; i " n; •++ J I
ifli = 0 IIulil--.o It ｾｌｩｊ＠ '-illi-111 { Ji l ogr'ilrn ma in()
if(sum mo.uwn) mA.uum •UW: j iutj GO:

ce
sum = (n[lJ - 0) 'I a[i) ; 0; ,: 51);
} calllllJ);
e l.s esum • a(J I; pnol iJ:
ra l
if (5wn ,. maxsnm) max-sum = .sum:
pnntC ｲｾｩＮ､ ｜ ｮ ＢＮ＠ maxsum}: procedure llx.y)
f f I LOO:
What is tho ''aluc pritlli."tl out when lhi> X 10:
m
progrnm i• executed? y = y + 1:
i\. 9
h. 8 Which ono: of the following options
c. 7
xa

ropruscnlB the cnrrccl nutput of the

cl (i ｰｲｯｧ［ｾｭ＠ fi)r tit¢ mo pnrnmeter ｰ ｾ ｩｮｧﾭ
i\2. ｜ｏ ｲｬ ｾ ｩ､ｴＺｲ＠ ｬ ｨ ｾ＠ fOIJIJWiug (' p111grnm. ｮｲ ｴｬ｣ｨ｡ｮｩｾｭ ＿＠
#Include -tdio.tt ll.CiiU by value: i"'10. j><tO: C•11 by
#defim: EOP - I rcfer<mcc: j: (JQ, j:70
.e

voicl ｰｵ ｾ ｨＨｪｮｴＩ ［＠ 1• ｰｵｾ ｨ＠ lhe argument on th" h. Call by vatu.: i=SO. j=liO: Call by
ｾ ｴＮ｡ ｣ｫ＠ •t int pctp(VIIidt: 1° pop the hlp ul tho> rtfcrc;nec: i=SO. j=70
$ lUCk • 1 c. Call b}' vulucr. ｩ ｾ＠ 10, ｪ ｾ ＷＰ ［＠ Coli by
w

"";" n｡ｾｅｲ＼ＯｃＧＨ＠ ); refen:nce: i= l00. j"'60

d. Coli h) v;tluc; i= l()(), ,F{iU: ( 'all hy
int main( ) ｲｬＺｦ･ｴ｣ｾ＼＠ ｩ ｾ＠ 10. }:70
w

f int e. m. n. r. 34. Consider' Urc program l•ll'lo1• in a

hypothetical progrnmming ｬｾｮｧｵ｡｣＠ which
whik( (c '"' ｧ｣ｬｾｨｴｮｩ＠ ) ) I = EO ｉ ｾ Ｉ＠ allow, gluh•l nriahl"" ;md • <hlliett of
w

I ｬｦ ｴ ＼ｾｊｩｧｬＨ｣ Ｉ＠ ｾｴｬ｣ Ｎ ｯｲ＠ dynamic ocoping.

ｰｵ ｾ｢Ｈ｣ＩＺ＠ int i;
else ire (c = ·-' ) I (c = ·•')) pn:>gram moln()
l m = pop (); l i = ltl:
n pop ( ) : caU ft l :
r - (c ..) 1! n 1m i n111 m: l
push (r) ; prooedore l' { )
I I tnt ｩ ｾ ＲＰ Ｚ＠
ｾｬ［･＠ if(C! • ·) call j!_( ):
flagError ( >;
 b af 1-1
prwedure 9( ) a. 3
l pnmi. b. JS
1 c. 20
l.<lt x be the vahae pn nted 1mder Ａ［ｉｩｬ ｩ ｾ＠ d . 30
ｾ｣ｯｰｭｧ＠ and y he rhi! value pnnted IUlder JS. 'l'he followmg, expressmn wns ro be
dynamic sooplng. Then. x and y are reahzed using :t-.npm AND and OR gates
a, ><"'10. y"'20 However, dunug ｾＱ ｣＠ fabricattou.n11 2-iupw.
b. X""'20. y ｾ ｴｯ＠ A1"D ga1es were mtstakenly subs!lttue<l by
c. );-1Q,y=l 0 2-inputNi\ND gates.
d :o.:-20.y=20 ((1,/>) <'+(ii.c:).d +(/• .-).J +(I.J

om
35 Early binding refers to a ｢ ｩ ｮ､ｭｾ＠ WhatiS ·thc func:U i1111 finally renhzt:d1
perfonncd lit compile hme lind late a, I
binding refers to a bmdmg performed at
execution Ltme Coo.s1der U1e followmg b ii +h ·H' +d
suuements c. i'i+b +IT+d
( 1) Static sctJpe facJiirutes !!:1. bmdings d li+h H-rtf

.c
(U ) Dynamk scope requtres 11':1 bindings 39 Datta fQrwatdmg techniques can be ｬ ｬｾ＼､＠ ttl
(nil Early bmdings 113 execution speed Lip tl1e operation in presence of datn
cfliciency, dependencies, Consider ｴｨｾＺ＠ follow.ng

ce
(1\1) ｌ｡ｴｾ＠ bmd.rngs w./ exccu1ion effocl(mcy, rllp(3cemenls of Ll-1s With RH.S
The nght choaces of wl . \Y.!, w3 and w4 ( i) RH L.oc, l, oc-tR2"' R ｉｾ ｒ Ｒ Ｌ ｒ＠ i-t l. oc
(in U1at order) are (il) ｒｉｾｌＮ ｯ ｣ＮｌｾｒＲ］ ｒ ｉｾ Ｎ ｒＲ＠
a. EarJy, ｬ ｡ｴ･ Ｌ ｾ･ ｣ｲ･｡ｳＬ＠
ra 1uorcase (in) R1 ->l oc.R2->Loc " Rl->Loc
b. Late, ｾＦＭｬｹＬ＠ increase., ､ ･｣ｲＮ｡ｳｾ＠ (iv) R I->Lqc,R2-> I. CK! =Rl->1.-oc
c. Late. early, decrease.. mcrease lo whach of the fnli()\Vllig qphons. w11l the
d. EarJy, ·late. mcrease. decrease ｲ･ｳ ｵ ｬｴｯｦ･ｾ｣ｵｩｳ＠ the·RJLS 0e IJ1e same as
36 The floating pomt unli of a processor Llsmg cxecuJ,ing the LllS ittcspectave of the
m
a desagn D takes 1 t cycles compared lot ｩｮｳ ｴ ｲｵ｣ｴｩｯ ｮ ｾ＠ that follow?
cycles taken by the tixed porm umt There a, (i)&(m)
are two more des•gn sugsesuons Dl and b (i) & (IV)
0 2. Dl uses 30% more cycles (or fi>ted
xa

c. (Ti)&(llt)
pollll. wut but 30'% less cycles for t1oatutg d (ai ) & (iv)
poUlt umt as compared to des1gn 0 02 uses What IS 1he fmnl value stored in the lmeiar
ｾ ＰＢＯｯ＠ less cycles tor rllCed Jl0l11l IUllt but feedback ｾｨ ｩ ｦｬＮ＠ reg1ster if the 111put IS
I0"/o mote. cycles for Jloating poim llltit as 101 JO.l2
.e

contpared to design 0 rot a given program

wh•ch hns SO'fo fixed point ()pemhi111S and
20% floatios poim operations. which of
w

the followlug orderjng reflects the relative

pttrfUI'ITUillCUS uf three (JeslgnS1 (Di>Dj XOR
denotes that Di ts faster thnn Dj) \\. 01 I0
w

a D I> D>D2 b IIJI I

b D2> 1>DI c. 1101
e_ D> D2>DI d. 1111
w

d D>DI> D2 41 F'l)lleiwing table indleatcs ｬ ｨ ｾ＾＠ lrutncios ()f

37 Consider a Oirect Mapped Cache WTth 8 operahons between lhe mstmclion
cache blocks fnwnbered 0-7), ｉ ｾ＠ the producing the result and mstruclion usmg
ｭｾｏｉ ＩＧ＠ block requests ｡ｲｾ＠ iu the Ute result
following order
3,5,2.8.0.63.9, 16.20,17ＮＲＵＱＸＬＳＰ Ｌ ＲＫ ＬＺ ｴＶｊｾ Ｎ＠
82. 17.24,
which of the following memot;y block;
wlll not be m the ｴ｡ｾ ｨ ｣＠ .at the ""d of lhu Consider the following code segmcm.
lt'<ld IH. L'I(;) l..ood RJ &nrn nll#llltiJ) I•ICI11It'r.l Lu..: l
sequence? lutuJ ｒｾ＠ 1A.II!2 l•liU. R2 frlltn"Tnttnl(lf'\ (l•utlhll! Lilcl1
 7ofH
ｴ ｜､ｒｴ ｾ ﾷ ｾ＠ Rt.;, Add Rf ••d lUttad Qlterctull.ul Rl 46. 111e two l!J'•mmurs ｧｩｶｾｮ＠ bolo" gcno11ll'l: •
()e;.: ｂｬｾ＠ 1Jem.tmer111C
O..ORI Demm..t 1\1 lougUtlge 0\'t:r tlw tllphubtt {!<. y. zl.
\ilJY R.4Rl.Jt.l.Mu1tJVIy R.J &ldRllll:nliii&W n'l'ldl itt R1 Gl: S '""' "" lz! xS lzSI y B
Sllltc- tu. t,c,cl_SL.uc- R3 m..tu\!1001)' b:9ll!!li Loti
B -+ y IZI yiJizB
\\l wt is fl,u: number or oyclc.., needed lo
02: S - y lz! yS lzSI xB
execute the above codu seg.ment os•uming
1.! -o l' yS
euch instruction l;lkeo one oyole to
\Vhtcb one · 1>f lhe follow•ng choices
execute'/
desanbes the ｰ ｲｯ ｾｲｴ ｩ･ｳ＠ ..ｮ ｬｾｦｩ･､＠ by the
n. 7
sU'Ings in the$e ltmguoge11'/
b. 10
a. G l Ｚｎｯ ｾ＠ uppt;aor before ｡ｮ ｾ＠ x

om
u. 13
G'l:l!vcry x is foUowcd by ol leus t one
d. ｊｾ＠
.u. (CIJI2.2S)H- ( 101 11 W I11U. Il)1 Ａ Ｎ ｾ ［＠
b.
\'
C\1 :Noy oppean; before any x
•. (135 103.1! 12)"
02: No'< nppea:" before nny)
b. (S64-1 11 -l12)"
c. 0 L No 'l appe;Jrs oflenmy x
c. (56-l-ll1.205}'

.c
02! E\"')' x i> Iilii Owed b;r ut lcust Otic
"· (135103.205)" • y
·D. .\n error cotTOCtmg codo: has the follo\\o'mg
d. Gl : No y uppenrll nfler ony ｾ＠
code ｗ｜＾ ｲ､Ｎ ｾ Ｚ＠ 00000000. 0000 I I I I,
G'l: Eve.-y y 1$ fiJ!Iowt:d n)' "' le:ISI nne

ce
0101010 1. 10 1111010, 111 10000. Whm ;,
'<
tha mrudmum numl)ef or hil CIT(Jf5 lhftt Ｂｾ ＢＧ＠
-17 C'ortJider ｬｨ ･ｩｯ ｬ ｡ｷｩ ｮ ｾ＠ DFA h1 ｷｬｴｾ ｨ＠ s., ｩｾ＠
be corrected'/
tlt.Oii;hut ｳ ｬ ｡ ｴ ｾ＠ 1111d ; 1• SJ Life' thcdinlll stalos.
ra ﾷb.ｾ＠ 0
1
o. 2
u :;
4-1. -\ hurd djsl( ｾｹｳ ｴ ｣ ｭ＠ JiltS lhe following
m
ｲｾ､ｭ｣ ｬ ･ｮｬ Ｎ＠

Numbclr of ltAeks : 500

Number of Ｌ･｣ ｴ ｯｲｳｬ ｴｲ ｮｯｾ＠ = 10(\
Number or byte,•'sector= 500 What language doelS this DFA rucognizo'l
xa

T ime token by the hand 10 move from one o. All strings of x and y
ｴ ｲ｡ｾｫ＠ to n<!J•c"" 1 1rack = I ms b. All siTing• or "' and y wh•ch ha\·e
RoMion sp<:«l : flO\) rpm. either even number or '( and even
ｗ ｨｾ ｴ＠ ｩｾ＠ the uvcr"'i!c ti!Jtc Iuken for 1\Utl\ber or )' {>r udd num ber 11r X 3n d
odd nuutber of)
.e

ｴ］ｾＮｦｃｊｔｩ ｧ＠ ｮ 250 bytl.'"$ froot tho dil.k1

e. A U.strings oflt und )' wllich ｢ｯ ｶｾ＠ equal
"· 3011.S rm nwnber of x md l
h. :z.ss.s IllS
o. lSS ms d. H strings of x ｾ ｮ､＠ y with either C\'Cil
w

munber of x 11nd odd number of y or

tl J OO " " odd n111nber. nf x und even tturn ber Clf 'I
1'hc lim• T "' the followins figure ;,
Corliider lhe gnunmar give beli1W-

ｲｾ ｷ ＳｆＢ ＠
w

S-:d3 1) t\
A ..... x l xS i yAA
B -. Y1 yS I y B B
w

ｘＮｾ＠ Consider tho followin!l- ｾ ｬ ｲｩ ｮ ｧ ｾ｣＠

(i) Xl()')'X
(ii) x:-'}')':'<)'
Which of the following mpuiS (X I X2 X3 (iii) X)/X.\'
ｘ ｾ ﾷ ｬ＠ will tlete<:t the tlluh'l (iv) ｹｸＮｾ＠
R, ()1\()0
(v) ｹｸＮｾ＠
b. 0 11 1 (vi) xyx
c. ll ll Which of the nhove ! tnng• are ｧｾ ｮ ｡ｲｵ ｴ ･ ､＠
d. None of the above bv lho ｳｲｵｭｩｬｾ＠
•.\. (i) ,(il). unu(iii)
 ｾｯｦｬＴ＠
B, (ii). (\•). ond (Vi) d.
c. (il). (iii). 11nd (iv)

ｾ＠
D. (i). (iii) . nnd (i\•)
· 19. Cons ider the loll<l\\,.;ng .grnmmn111. Nomes
ｾ･ ｮｬｩ ＱＮＡＬｬ｣［ｭ ＱｩｮＺｯｬ ＠ hnve hc:en •pc:cil·i ed
in capilllll.cUers.
G l: ｾ ｬＧｭｮ＠ ｾｗｈｉｌｅ＠ (o)(f)t)Oiulnt
51.
•
I he lo iiO\Iing table shqws the hn1e
lx:twe"n faiJUNS for a solh\UN ｾ ｜ Ｇｬｩ ｴ ･ｭＮ＠
s lntnt _,.()'J'l:IER
Error Nwnbt;r I 2 3 -1 5
C;(Jlf ｾ＠ llJ
Tlmo since ｬ｡ｾ＠ 4
R S
G2: • l'm nl-7 WI fiLE \e:<pr) Mmnl 6 6

om
lnitun: •on"'
>IDlJI t ..... OTI IER The rcllabilily of llie system for 0t1e hour
cxpc -+ expr f expr of opemtlon Msnmlns nn cxponemlal
｣ｾｶｲ＠ ._,. ｣ ＾Ｚ ｴ ＾ｾ＠ "' ｣Ｚ ｾ Ｇｐ＠ mil\lel is
lll<Jlr - ID u. !lAS
ｬＧｾｵ､Ｑ＠ one of U1e following stntom<mt!l •• b. 0.63

.c
tme'1 c. 11.84
n. 0 1 i• ｏ＼ｘｬ ｬ ･ｾｃ ｴ ｦｲ･＠ h11l not reg\dnr and d. 0.95
(his n:gulur 52 Given the followiog algorithm for «'<tins
b. G, I< <!()nlo;d·fr= buJ rtOI ｲ｣ｧ ｵＮｬ ｾｲ＠ 1111d

ce
:m amry X oi'N nlln\1.1.-rs;
G 1 i• 11:'S" lilT SL1BROUTIJ'lE ｓｏｒｔＰ＼ＮｾＱ＠
c. Both G,. Md G:: ure regulnr IF 0-i • 2)
d. Both G t •nd O, are contexl·l'fee but RETL'R.N
ra neither of them is regulnr ｆｏｒＨ ｩ ｾ＠ TON INCREMENT BY I)
SO. Consider the follo,.i.ng Jitute automalll I' FOR (i = I TO i INCREMENT BY l )
and 0 owr tl•e nlphalx:l !11. b. c 1. Tho t l•rt lr (XJi 1 X<IJJ)
ollltes Ql'<l indiuru.ed by • double ｾｲｯｷ＠ and <:ONTINUE
m
finn) <lutes are iudil>(•ttld by n doublo TF..\ W X[il
circle. Lcl the lnngungcs recognized by X[iJ - X[tl
them t>e denoted b.v L(P) nnd L(Q) X[j] = T!!lviP

ｲ ｾ＠
P.NOFOR
xa

fiND f OR
liND ｾｌｔ ｉＺｒ ｏｕｔｉｎｅ＠
A good approximation <If Halstead's
• q csliruntad prognlm lcnglb Is-
.e

rhe outo!llnton w hich nroogniz..- tho q, 20

lnngun.ge L(1 1) ' i L(Q) ls b. 5tl
Q,
"' 80
d. Ill)
w

53. lt1 tbe simpliJ\od ｮ ｵ ｜ｾＱ＼ｕＮＧｴ＠ gJVCII llt:fOW.

the s haded boxes n:pn:scnt code tlml is
ｾ｣ ｵｴ｣､＠ duriug n test c,nso.
w

b.
w
 •l , d ｉ ｾ＠
Th.e hrunch CO'-'erage i$ Wnit (oruJI<:X)
... 3/4
b. 2/3 re..>t.dCi)u.nt = re:tdc.ount + f
c. )(.! o.l' n:adcount = I then S I
d J/R S2-
54. Cnnsi(lec !he CPM ｾ｣ｴ ｩ ｶｬｴｹ＠
chart wl)ere Ul1
arc oonnee1lug twu 1nlles:l0ncs b; ｬＺＮｳｨ･ ｬ ｾ､＠ rt:ndtng. is. p.:rfo nm:d
'"iU1 3 ｴ ｾｴＮ［ｫ＠ identifier and t.he t•ml! ｾｫ｣ＺＬ＠ 111 '\3

om
days. For oxnmplc m ordcc to go from A to rcadcounl = re.1dcount - l
13, task ·r•r take. r ｾｕ＠ day•. A dashed line ifrc.adc.ount =II obcn £4
depl.ns on n..IJ itlunul dependency that ls sigJt<1I ( n1UlC><)
(:tJUIVUICnl lu U ｾｃ ｲｈ＠ tlmc task,
n. u Th.: wluo;S vi' S I, S2, Sl. S4 (Ill tlJnt ,,ruor)
arc
a. ,;igoaJ(multx), wait(wrt), sigoaJ(wrt),

.c
f), I
wuit!mutcx)
b. s ignal ( wrl) , sfgna l(mutox),
wait( mute><) . wail ( wrll

ce
c . wait(wrt), Slgrutll m ute-"X), wiul(mute,x),
ｾｩｧｮ ｮｬＨ ｷｮＩ＠
d sigmll(mut"x), wail(mutcx),
•lgnal(mutcx), wui((nnolcx:)
ln u multi-user ｵｾｲｯｴｭｳＬ＠ :,.-y.slem, •\rt an

ra
l11c li4.:t of u-.:llviUes thut lie on the critk"tll
ｰｾｵｨ＠
u
n.rc
1'1,1'2, 1'8,T t tl
uvcrng-c.. 2H rt;quests nr(: mru.Je to usc u
rx-rtlcular J'CSt)UrCQ per h\.lllt n1c arrival nf
ｬＧ ｾｵ｣ｳｴ＠ r\,llows a Poisson dislrlOu1 1nn
The pml:oability !hat either o1 1JC, t.hrcc 11r
m
h T I,TI, r&.'l 1(1 five rcqucs'lS ::an: mulic jo 45 ｭｩＮｮｵ ｬ ｾ＠ is
c. 11, l'2,T3; 14,T5,T(i,'1'7, 1'8,1'9; 11\1 ｬｪｊｖｾｮ＠ by
tl T I,T4 ,T5,T7.T8,TIO a. (i, 9 X I()& X " - JCI
5.5. Cnosidcr lhc tQJI<owing pscud<:>·oodo;:: L02 • IO(o , c '"
h
xa

20
Ill ( tA > 0) ANIJ (C > D) l ' l'HJ.lN c, 6.9 '< I<? .. "
A s /1• I a 1.02 ttl" • u '"
ｮｾ ｮ＠ 1 1 58. A domand. puginl! ｳｹｾｬ｣ ｭ＠ lakes 1<JO Umc
ENOIF unots II) scrvocC a 1"1£C (uuh :mJ 300 L1me
.e

The tsyclomau.: cnmplc.·dty o r the rscudn,._ units to r:cplru:e n cliny page Memory
ｾ ｴ ｬ､｣＠ fs occc.<s oinw is I tome ｵ ｯｩｾ＠ ·n,c prohahility
Q, 2 ol' a. J)>1gc lituU ｩＮｾ＠ i>· In casl.'ol'a page ｩｬｵ ｬ ｾ＠
b 3 lllc probabiUty nl' page bcollJl d irty is ｡Ｎｬｾｯ＠
w

c. 4 J'l I L is ObstrvcJ that the tl\<Crugc aCcC$s

d. 5 time-is 3 ltmc umls, ·t htn lht:: vu lue ul' p IS
51\, Svncllrtmi7.ati!ln ln th e c lassicaJ rt'atlcr:s • . n, l!/4
ｾ､＠ wrilllrs prvbll..lm \!an ｢ｾ＠ acbic\'cd
w

b. 0.233
through use of slo!muphores. In the c. 0,5 14
(blh)wing ioc("urtplcte \XK.Ie for rC(iJers- d. 11,981
wmers prohlcm, lwo hm:u'Y sem:)phores 59 The ce>nllmts ,,r lllc t..xt file U ｾＧ＼ｌ＠
w

ｉＧ ｕｾｌ｣Ｎｸ＠ 'md wn arc ｬ ｩ ｓｾ＠ H' obtulll C(lfJWinlng fo.Jur Jines are a:; follows.
synchmniz..11'1on. a l bl
a2h2
W"J il 1wrt) a3 h1
a4 hl
'l'hc l.'tlntonts oJI' ｴｨｾ＠ 1.<.-xl Iii" 12 txl
cortlaming 11ve lines ure as t{JIIovvs:
sJgnlll {wrt) al cl
 Ill of I-I
a2 c2 c.
a3 c3 I
a4 c3 "
B 10•
a5 c4 c 17
Consider the tollowrng Bourne shell scrrpf· D tl.
E 10
awl( - F ' " ( printS I, S2 I • tLW I F 16
while read • b, ｾｯ＠ 0 6
awk -v aV=Sa-v bV"Sb -fl •'
' aV-St ( pnn111V, bV. S2)' 12. \}.1: d
dQne I
"B

om
I
c 7
Which one of U1e following strings will D 11
NO'r b\l present it1 the output generated E 10
when the 11bove script is run? (Note that F 0
Ute given stringJ; may be substnngs of a G 6
printed line I

.c
61 ht tl\e waveform (a) g1ven bei<JW, a b1t
a ''b l c l " stream ts encoded by Manchester encodl!lg.
b "b2c3" scheme. The satne btl stream ts encoded 111
c. nbl o2''" a dl l'rerent coding scheme 10 waveform

ce
d "bl cJ'' fbI f he b1t stream and the ｣ｯ､ｭｾ＠ scheme
60 For the networkg1ven In the l'igure below, are
the rouung tables of tJ1e four nodes A. E. D
and a are shown. Suppose that f has
ra
estimated It$ delay to 1ls oeighbors. A. 1::
D and G as 8, Itt n and G msecs
respectively and updates its rouung table
usin;; distance vector rouhng technique.
m
［Ｎ ｾＺ＠ .-
'
xa

E 0 u, IOOOOHTI II and Dtff-erentinl

Manchester respecuvely
T!mil,, 1«1'-'ll. .
Tib vi""f . TＯＺＧｾ ｯ＠ I ,.;:':!l'G b. 011 1101000 and Differential
.. ••' c .' • -•• • •
A
'
I
Manchester reSfl!lch vely
c •• c. I 0000 I01 11 and Integral Manchester
.e

"' D
• • •
0
respecttvelv
'
." ' , II' £
F
,'. '
IQ
d 0 I I ll 0 I 000 and Integral Manchestet
0 G 0
• respectively
Whicb one or the ruiiOWIIII! opuoas
w

62. l,et us consider u statistical hme divis1on

represenl!; the uptlalt'li rquling U1ble Of r.?
a, multiplextng of packets. The number of
sources IS 10 Tn a ume unit, a source
•
w

"B lO
transmll" u packet of 1000 b1ts The
number ol' SI>Urces sendtng data for lhe
c 17
0 u first 20 time units ts 6,9,3.7.2,2,2,'.3,4,6, 1,
w

E 10 10,7,5,8,3,1>.2,9.5 respecttvcly The output

F 0 capaclty of tlte ruultlplexer is 5000 hit< pur
0 6 tllne untt. ,'hen the avenge nlllllber or
b. backlogged ｰ｡ｾ･ｴｳ＠ per 111ne un11 durrng
A 11 the gJYen ｰ ･ｴｾｯ､＠ 1S
B I , H. 5
c 7 b. 4.45
0 19
c. J .45
E
v ﾷｾ＠ 0 tl 0
0 ll
 II oll-1
63 A gro11p of 15 routers ore interconnected 111 Sf: ｩｯ＼ＮｳＨａ ｾ＠ 51\ IO<I.StU)t
........ ｾ＠ notd(9k
a centralized complete binary uee with u ｬｯ｣ｾ＠ ｫｸｓＨ ＯＱ ｾ＠
nluter 01 cooh tree node. R<HIIor j tQI(B). tc.ao\A);
oommunicnlcs with muter J by sending ll IIA •0 11010
-11-ll+h - A -11-ll
IIICSMgC. I ll the rnot IJf ｴｨｾ＠ Tr\.';l rhc root wrl:ctB)t "!!ritc:(At
then sendi< the mC!I.'IS£0 back dc!Wil tc> C'Oinril: C\JIN'II\t
rnutor j The mcnn numhor nf hop> per lilllocliA): ｷ ｡｣Ｚ ｫＨｂｾ＠
ll!iCICIIB); ｕｬＧｯ｣Ｈａ ｾ＠
111essase. IISSUmins all pt•$siblc ri'llter tmir•
oro equlllly hkol) 1> b
5 1: ｦｯ｣ｴｘ＼Ｎｾ Ｉ［＠ ｓｊＺｉｯ､ｩｘＨｾ＠
lL .l

om
NIIICA): -'lllll
1,, -1,26 ｾＸＩ［＠ ""*]((""
u. -l-.53 1011118); -'lA):
lrA • O trli#-D
d. 5.26 l&ma-B+lt CMIA - 4-1:
1}4., /1 ｢ｲ＼ｾｷＮｬ｣｡Ｌ｜Ｑ＠ ｾｨｭＱ･ｬ＠ ｨｮｾ＠ Ill uodes and lltlpl -(8); Ｍｾ＠
cnpucity .,r I 0 Mbps. II ttws plllling for Uliloot(Ak
.....,;.:
ｾ＠
anllii;
medium clc.ccss. Once o noda finishc. --8);

.c
llolod(ll);
tmnsmission. rherc is n poll in!! dclny of 80
e.
ll'' tv poll the next ni:'Je. Whe.never u nooe Sl : IG<U(AY, S:: ｬｯ｣ｩＮｓｉｂ ｾ＠
is polled. 11 IS uUowed to lmnsmu a r<Oii(AY, n:.o.I(Bt,

ce
umxinwm nr 1000 llytes. 1'be maximum ｬｯ｣ｩｾｊｃｕＩＬ＠
....,.a,:
\o<kX(I\l:
<allAn
lhfOt<ghput of the broudcos l ohunuclls IIA •O U0<- 0
a. J Mbps ｬ｣｡ＸＭ ｄＧ ｉｾ＠ lltnA - A· I:
ｲＱＰ＼Ｈｾ＠ ｾｴ＼Ｈ ＯＱＩ［＠
b. 10<1/l I ｍ｢ｲ ｾ＠
uoloci<UIJ: ｵｲｴｬｯ｣ｩａｾ＠
ra
c. 10 Mbps
d. 100 Mbps
axnrntr.
Wlllxk(Bl:
comra1r;
lllllod;(Bt
65. Cnc.<i(lor u sclcclion of !he Jh rm o,.,uJJ(r). J.
where 1 is u relation wi th J(I()O ｉｕｴｬ･＾ｾＬ＠ Sl: lo<I•S(A): S2:1od1S(B):
m
ａｳｵｯｴｾ＠ that the uttrfbtne ｶ｡ ｬｵｾｳ＠ lo r A md(A.) ; md(B):
lockXI8); ｴｯ｣ｬｩＨ ａ ｾ＠
nmoug ｴｨｾ＠ 1uplc:s an> unilbrrnly distribute,! ..ocl(Bl; ....t(A);
in the mlcrv:ll [0. 5(,)()). Which one of the if/l e O lfBf.O
xa

t',lllcm ing uptit)D> i> tbc best ･＾ｴｩｭｵｾ＠ <•( daB-B+l; ＢＭａ Ｍ ａ ＬＮＱｾ＠
i!Je uu111ber uC tuples returned by ｬｨｾ＠ gtvelt "I'll< !B); wri!l: { A);
uali>."'lA): untock(A):
sdectiOt\ lluery1
"'llodlill); Ｎｩｵｯ｣ｫＨｂ ｾ＠
<1. so ｣ ｯｭｩｬｾ＠ ｴｯｲｵＧｬｾ＠
b, 100
.e

()I Consider rbe lbllo" iHg ｭｰｩ ｦｩ＼Ｚｬｯｲ｣ｾ＠

ｾ Ｎ＠ 150
d 200
••olati.ng to !uuctJOnru and multh·uluc<.l
dcpctl.dcnotGs £ 1\' CD below. whld1 JU<i.Y or
11(, CouSJcler the fullowlog lW<' lmosa<lion.s
r, uud 1'!. muy not be correol
w

t 1 • •rC3t.I(A); l l) IfA B ll!ld A- C then A ... BC

］ｾ ｉ ｉＺＡ ＩＺ＠ (ii) If A -7 Band A-'+ C then 1\- Hc
w

if i\=0 then B<-B+ I (ill)lf A.- Be rhcn A-+ B u.nd A-+ C

wn1e (A): (iv) (I A.... f!C rhun A- R und A- C
Tｾ＠ : rood( B): llxn.:tly hrm many nl the abo¥e
w

read( I\): impl ic.1tions aro ynfid7

i!'lJ¢0 lltou At-A · L a. ()
write (A); b. I
Which ,,( the rQllc)"iftll ｾ ｣ｨ･ｭ ｳＮ＠ ｵｳｩｮｾ＠ c. 2
:iliurcd aod exclusive locks. Ｚｾｴｩｬｶ＠ｳ ｴｨｾ＠ d, 3
tl"-!UiremcniS fi>r s trict tu ｰｬｮｾ･＠ Ｌ ［Ｌｯ ｫ Ｌｾｧ＠ f<Jr 68. Coustder the lo llowcug n:laljuu sdtewas:
llw ubove trunwctions? b-Scbemu ｾ＠ ( b-ruune, b-oity. assets )
;t
a-Schoma - (a-num. b-nnme. ball
d-Scbemn = (c-on me. a-number)
 12 o!l-1
Let brouch. account ond ､ｾｰｯｳｩｴ ｯ ｲ＠ be defined b.\• the regular txpresslon R?
ｲ ｵＮＧ＼ ｾ ﾷ ｴｩ ｶｯ＠ insranccs uf the above ｳｯ ｨ｣ｭ ｮＮｾ＠ ｬ､ｧ･ ｾ＠ labeled ). denote omnsiticms on tit.:
Assume tlmt account and depositor ¢mpty ｾｲｩｮｧ＠ 'I
ｲ ｾ ｬ｡ｴｩ ｯｵ ｳ＠ arc Ulllt lt bigger than thu bnwch it.
rcl<llion
Cciusider ｌｨ ｾ＠ ｴ ｯ ｬ ｯｷ ｬＱｾ＠ query:
rl- 0 ,.(cr ＢＧｾ ﾷ＠ ｾ＠ ""' o Cbmnob M
(n« ouut M depositor))
Which one of the Lollowins queries Is the h
11111s1 ､ｬｩｾ ｩｬｔ＠ 1 ill$i(ln of the ab,wu ｬＢ ｾｲＮｬ ﾷＧ ｬ＠

om
:1. ｮ Ｌ Ｎ ＬＮＨｃｙｾｯ＼ｦｏ＾ｊｴｹＧａｪｭ Ｂ＠ branch M
Qct:<>tmt) M dep(•sfttlr)
h. n.......
tcrh-dJr"lilfll" brnnoh ｍ Ｈ｣ｲ ｾ＠ ｾ＠

c.
depositor)
fl,.,......, (icrto-al)"""o\I>H brnnch M O b•
.,.

.c
ＢＧｙｾ Ｍ ,\ bol • oacc<•um ) ｾ＠ doposnorl "·
<1. IT,.,..,. Ｈ ｃｔ ｴｲ｣Ｎｾ ］Ｍ ｾＬＮ＠ ｬｾｴｵｮ｣ｨ＠ M Ｈ Ｑｾ ﾭ
ar.-.,.•.1"" Ｎ ｯ ､ ﾢ ｰｏ ｾｩｨｬｴＩ＠

ce
69 Consider tile tbllowing ｣ ｬ ｡ｵｳｾ ｳＺ＠
(i) Not i nherontly suitnble for clle,tl
nulhenlication.
(iil 'Nnt u Sl!Llo SOllSHwe protocol .
ra
(itil Must be 13peruted witft more than one d.
Si)rVer
(rv) Snitnblc: ror sin•cturcd ntcssas.c
urganizu1ion.
m
(I') Mnv need two portS on the server .!o1dc
t'<lr prop¢.!' op.:ratiou.
The ｵ ｰｬｩ ｾｮ＠ that hus the m:l.'ttnlUIII numb.!r
•••
xa

ofuom:ct nlatches is
72 . Wllloh ､ ｾ ｴｾｲｭｩＱｬ ｳ ｴｫ＠ ｬｩ ｴ ｾ＠ outummon
.ll. IMAP- (i), FTP- (ii), HTTP - (oii).
｡｣･ｰｴ ｾ＾＠ Lho: langunga ｲ ･ ｰｲ･ ｾｮ ｴ･､＠ by the
DNS -(iv). POP3 • (v)
rusulur ＮＺｾｰ ｲ ｵｳｩ ｮ＠ R ?
b. 1''11' • (I). POP3 - ( ii ), SMTP - (iii).
:1.
fTTI . P • (i, •). IMAP • (v)
.e

1o POP3 • (i), SMT? - (ii), DN:S · (ii),

IMAJ> • (iv). l ilT!'· (v)
d SMW • (i). IIITP • (ii), IMAl'· (iio),
w

DNS - (h•),fTP - (v)

70. You are •lv¢uthe followiu • fourb1 tos:
tolluJII Ullll\1111 lll!llr,ll IOIOUIII b
w

Which nf1ho ｦﾷｾｬｯｷｩｮｧ＠ are ｾｮ｢ｳｴｲｩｧ＠ of

tlw bn.<;e ,,,- ｾｮ｣ｴ｜､ｩｊｬｧ＠ of ｴｨ ｾ＠ a l1(JVC ｦ Ｎｴｾ ｵｲ＠
by1es 'I
w

8. LJp
b.
U. lJWA
r"''
d, QU

Commo11 lllobl for Quootlo11• 1 {71·71)

Colnsider Lloe n:sulnr expressiron R.= (11 I bl' (mo '
bb) (n + b)"
71 Whith or Ihoe foll,"l'ina ｮｯＭ＼ｬ ﾢ ｴ＼ｲｭ ｩ ｮｩ ｾ ｴｩ｣＠
llnitc uutonmltt recognizes tl1o language
 UoC IJ
d. 77 For which of lhc following "olues of o.
does there exisl a non-empty open intcrvol
(a. b) ｾ ｵ ｣ｬｴ＠ that tho scquC!JCO x.., con verges
for nil"" satisfying n . xo < b?
(il 0.25
(ii) ()..35
(iii) ().45
73, Which one nl' the rcgnlnr O'\prcssionc• (i\1) 05
given l)elow ucfincs tl1e ｳ ｾｭ ｣＠ lung•wge as a. ｾｩ Ｉ＠ only
b. ( !) :md (ii) only

om
､ ｣ｦｩＱＧ＼ｾ＠ ｨｾ＠ 1hc reg'!lar expr-:ssion R'/
a. (o(ba) • b[ab) ) (n ' b) c. (i). (li) uod (iii ) only
b. (u(ba)• ' b(ab)')' (a 1 bf d. (i).(ii). (iii) and ( iv)
"· (a(ba)"(a• bb} 1 ll(ab)'(b M))(n b!"
d. (n(ba) • (o ｾ＠ bb) t b(ab)'lb + Wl))(:l + Commoa dab! for QuaaUona : {71 a. 71)
bf Cot\>ider Ihe i"ollmving cxp(a<sioo uii + ii"c +bed

.c
78. Which of 01c lollo\\mg .Kurnaugb Maps
C.mmoa Illata for Qllaetfaaa : {74 to 7!1) corr<etly repre,"-'!11$ til« ･ｾｰｲｴＡｓ＼Ｇｮ ＿＠
Consider o Ioken ring topology with "N &lations ted al cd r:.i i

ce
(numbered I to N) tum1ing token ring pl'lllncol "iib )( •
where t·hc stations nrc equally spnccd. When a
7ih y (
station gets t·he tnkcn il is allowed to semi ono
fmma nf lh:.ed lri?c. Rio1g latency is 11" whi le the ab ,<; X

lmosmissicot UJ)lO tll 11 frame is l, , Al l other

ra
lutenoie:; can be neglected.
oh )( ..
Ｗｾ＠ T&e maximuui ｵｴ ｩｬｾ ｴ ｩｯｮ＠ ,,f the 111ktn ｲｩｬＡｾ＠ cd cd cd c(J
wben t, - 3 ms.. lr - i ms. N - tO is iib X (
m
tJ. 0.545 x·
b. (lh
b. 0.6
u. 0.857 ah
" • )"

J. 0.961 ub X •
xa

75 The ｭ｡Ｎ ｾ ｩｭｵ＠

utili7.ntion nf Lhe Ioken ring
when t,- s ms.lp- Ｍ ＺＳ ｭ ｾＮ＠ ｎ Ｍ ｉ ｓｩ ｾ＠
Cd Cd c.d cd
u. ｏＮｓｾＵ＠ iih < •
b. ().1555 c. iib X
• •
.e

c. (1,9375
110 • " •
J. OJ16.1
llh .. "
ciii
w

Statllnw•t for Lt•k•d bs-r cfj

Qu•U•n (71 •nil 77)
" • "' cd

Consider tilt scquCJlcc l x.l, ..u defined bv llu:. . d. ""

cib
w

reeurren<lt! rclutiottX., q- ex.,· - 2. where c 0.

uh
" • <
76. Suppose tbere ･ｸｩｳｬｾ＠ " non-empty open "
1ntof\•al (a. b) such tllllt for aU X4 :Satis(ving
""CJf"tbc fQlJowlng
" "
w

u "" b. the sequ¢ncc c<)nvcrge,o, ti\ • 19. Which cxprcssicms does

limit 1'he&eq\l"nce o(luvcrges tn lh" vulue 1101 COIWSpotld IO the l<amaugh Map
I + ,Ji.';8C ootnlncd fn Q?8 .,
2c a, (i( j +,,"( j + alii!+ ac"d
t - .JJ+-8e h. ［ｵｾ｡Ｗ＠ +ad+alii!d
b.
2£" c. m: +tiii +nliii" +eli
c, 2 d, b"&-+ t•cd +iii"+ nhc
2
d.
2e- l
 P o1 14
.......,ent for LIMed ..,._r the ｴｏ ｴ ｴｾｬ＠ numbers ur traeks 11rc ＲＰＴｾ＠
tit" b011d ｾ｡ｮ＠ strut from ruty truck'/
iln<l
. . .lion (10 lllld .,,
lt. .!)
Let Pt , P,, ..... 'Prt be· n roinL• in Uti>Xl'·T'Iunc ｾｵ｣ｨ＠
that "? thn:e of ｴｨ ｾＧｬ ｴ＠ nre oollinellT, l' or every pnir b. 10
c. 11
of poml• P, and P, , let Ly l.!e the line ｰＱＭｾｳｩｮｧ＠
d. 12
through ｴｨ ｾｭ Ｎ＠ Let I ob be the line wilh the ｾ ｴ ･ｰｳ ｴ＠
ｧ ｲ｡､ ｩ ｡ｾｴ＠ ｡ｭｯｪｬｾ ｴ＠ all n(n- I)I:Z lines.
80, Wltich one of Uti! folio\\ ｩｮｾ＠ pt'Otl<:r1ies
• hould uccessnrilv be !U!lisficd1 ｃｯｮＮｾｩ ､＠ ..,. the B I:Ne m lbo> ｾｬｯｩｮｭｧ＠ ligure.. \\ bere
:t. P, Md 1\ Ｎｾ＠ udjnccnl lo ｣ｾ･ｨ＠ other

om
･ｾ｣｢＠ node ha.. at mo;;L two keys nnd U\J'Ce links.
with n>!pCOt lo Utair """""nlinotc
o, ｾ ｩｕｴ ･ｲ＠ 1'. or l'o hns lhe lnrt!l"l or tho
smnllest v-coordinute omO!lg all !he
tXtinls
c, The difference between x-coordtnule.

.c
i'fPo :tnd Pb is minimum
(L None of the ubove !!<!. ｋ･ｹｾ＠ Kl 5 and Ooeo IUS w·o inserted into
tit is tn;<o In tltat order. ｅＮｾ Ｎ ｣ｯ ｴｬ ｹ＠ bow mony
81. Tbc time complexity of tlto best olsorithm
for 1mding P, Qnd P11 ｾ＠ of lhc: following nOdes {disr\lgurding lbe

ce
ｬｩｮｫ ｾＩ＠ will he ｰｲ･Ｎ ｾ･ｮ ｴ＠ in tbc we ufler the:
n. (l(n)
two i11.<ertloru?
b. !l(nlogn)
o. O(nto!?nl jjuojjJC'oll jjKlsjjuoj j
d. O(n1 )
ra ｉ ｬｫＺｾ＠
a. 1
lll(nj j ｪｋｴｾ ＱＰ ｉ＠

b. !
m
c. _...
The ,.....ｾＮ＠ or a hard ,li>tk ｾ ｣ Ｚｲｶ｣ｳ＠ ｲｴＺｱｵｳｬｾ ﾷ＠ foll(>wing
Ute sbonqt seek ｴ ｩ ｭｾ＠ fin;t (SST!') porky. ·n to
d. 4
8.5. No\\ the key KSO ls <k:letcd from the 8 tree
｢ ｾｯ､＠ i! initiniJy t>O!ltioned o!Lrncknumbcr 180.
1\lSulting utlcr U1c two ｩｮｾ｣ＺｲＱｏｴ ａ＠ mude
xa

82. Which of the rcqut:.•t ｾ･ ｴ Ｄ＠ Ｂ ｾＱ＠ umtse Uta

.:artier. Coosidcr the following ｴｮ｣ｷ ｴ ｾ＠
hc:td to change illl direction ntlcr ｾＢ＠ iciny
nboul the B ll'oa "'''Uiting, nfier this
every request IIS$Uming that tha head does
deletitm,
not change direction if the"' Is o tie in (i) 'l11o height ｯｦ ｴｨ ｴｾ･＠ ｾ＠ remains th" ｾ｡ ｲｮ ･ Ｎ＠
ss·n: nnd all the reque•l> ｵｲｩ ｶ ｾ＠ ｨ･ｦ＼＾ｲｾ＠
.e

U1e
(ii) 'l'lte node (disregarding lite linh) is
!er.·iciug slsl'ts'l
present in tit" tn:e.
II. ＱＮ Ｑ ＳＹＮ ＱＷＰＮＸＬｾＲ Ｑ ＮＲＶＵ＠
ＨｩＩｔｉ ｾ ｣＠ root node rent!lin• uochanged
b. l0. 138. J70,l7S,J81.J 85. 201.265
w

(disregnrdlng tbc links).

c. 10. 13\l, l69.178. 1.81, 184.20J.26S
Whio,h ona of the following opt10ns u
d. '10.138. 170.171t.18UM5.200,265
truc'l
S3. ｜ｾｵｮ＠ is tb<! max imum Cltrdinnlitv of the
:t. ｓ ｭｴ･ ｢ｮ ｌｾ＠ (i) :md (ii)ttretrue
w

reque><t seL so that !he head ch;qges tlli

b. Swtements (ii) and (iii) nre true
direction alter servicinJ! every request if
b. SWtemcnL• (iii) and (I) aretruo
w

cl A lithe •tlltc.rnents arc ｦ｡ ｬ ｾ ｣＠