I GATE - 1998 I ul'M

COMPUTER SCIENCE & ENGINEERING

SECTION A I stay only if you so
a. 1stay lf you go
ONE MARKS QUESTIONS (1-35) b. If I stay then you ~o
c. II you do notgo ~len 1 do not sray
11us question cons1SIS of35 (Thmy Five) mu.ltlple d. tf J do not stay Lben you go
cho1ce questions. each carrymg one marl_ The. (j, Suppose. A is a finite sci \\ith n olcmems
ruJS\\ers to the mul[1ple choice questions MUST The number of elements in the Largest
l:>e wnlten nnl~· 10 1he bows. corresponding tll 1he eqw,•alence relation of A is
questions in the first page of the answer boot... a 11
(35• 1= 35) b n·"
c. I
A eli~ IS rolled three times 111e probabilit~ d 11 ' I
that ex-actly one odd number turns up 7 Lei R1 and R~ !Je two equivalence relations
runong the three outcomes is on a seL Consider the following assCitions:
I (1) Rt v Rz IS an equl\•alence reladon
a.
6 iii) R1 I"\ Rt iS an equh1llence relation
Wh1ch of the followmg is correcl'!
a both assertions are r.rue
b assertion (i) is true but nsserliou (ii) is
not 1n1e
c. assertion Iii) is true. but nss~nion (i) is
not I rue
2 d. ne1ther(i) nQr (ii) is true
2c Constder the follow1ng set ofequauons 8 The nwnber of func!ions from Ul1 m
x+-2y ~ 5
element set loan n elemen t seL is
4x-8y = n a. m+ n
Jx+6s+Jz= 15 b. m"
1'tus seL c. I)'!P
a. .bns a unique solulion d m• n
b. JljlS no Solutions 1/, ll' the regular set A is represented by A =
c. hilS finite number or soluuons (()I + I)' and the regmar Set ' B' tS
d has infinite number of soluuons re.presented by B = ((Il l) • 1'( \\h1ch or
3, Which M the following Sllllemen ts npplies lhe following ts true'I
to the bisection metl10d used for finding a. AC:B
roots of functions ,
b. BcA
u. converges witbm a few Iterations e. A and B are incomparable
b. guaranteed to work for all continuous d. A: B
functions 10. Which of the foliO\vmg sets can be
c, is t'asler than lhe Ne\\~on-Raphson "'<llgniLed by ·a DetemunJStic; f[mte-srate
method Automaton'/
d requires lhat there be oo error in n. The numberS I, 2. 4. 8,. ,
detenrunmg dle sign of lhe fwJcllou miuen in binal}
-1. Cons1der the runcwon y : lxJ in dte ullerval b 'l11e nwnbe.rs 1.2.4. .~... 2".
l- 1. I j, In tb.ts mten·al. the funcuon IS
wntten in unaJY..
a. conu nuous and di ITerentiablc e. The set or bin~· stnngs tn whtcb lbe
b continuous but nor d11Terentinble nwnber or 7.eros Is tl1e same as the
c. diiTercntiable but not continuous number of mtcs.
d. neitller cominuous not diiTerentlnble d. 'l11eset ll , lt1Ll i11 1Lllltllll ....... l
5_ Whm is the coul'erse of !be following
assertion 'I
II Regotd ins the power of r'-'>osnltion of b 98
1311!\ll"!l<lR, whleh of the 1\lllowing c. 76
~tntemcnl~ i~ Ioise? a. ~w
u 11Jt: ntm·dctermjnj!Ctic. fiu it~; )flnte lS. Wluch uJ the l<•llowing device~ shquhl got
~ulnmaln ore C<tt•iv;olent to ltigherpriority in ussigning interrupts?
determini•tit: 'OniU:--$tatc: A~Jlnmota, a. Hard dis~
b, f'fon-delermini~tic Push~do1• n b. Print<,.
nuwmaltl ore:oquivah:nt 10 c. Keyboard
determini•ti~ PtL•h- down nutomotn, d. Floppy di•k
c. N•on-~cl~11ninistlc T uring maclnnos are 1?. Which of the. follo1ving •dcln:5; ·ing mollc:s
~'luiv•lenl tu dttcmtillistic Turing fiCilnil~ reloc~liou withuut Oot)'chan
mac.h..in es whntsoavtr in tltiO eod~'l
cL M.~thi.\:opii Turing machines an: a, Indirect oddressing
equiva henl t·o Single-tape fur in g. b. lodexed -addressing
mocbinos. c. n.... rogister nddre.ssing
12 l'hc sUing 1101 does not belong to lh~ <;ct d. PC relative •ddrc..,;ing
repr~ented bv 20. Which of lit~ following is ITuc'?
•. 110'((\ t .l) a. Urtle~ enabled, a CPU "ill notl>e nhle
b. 1(0 • I)' till to process iut"nupl.s•
.:. t10l' to J)'iOO 11)" b. l.,oop instnrction• ""nnot be interrupted
do t00 - 111 )'0)' till U1e~· complete,
13. Wlut.hnppo:u5 when • biHlnng is XOR~d <:. A pro::es.or ~hecks for interrupts
with itself o:-tinlcs as shown : bcfuru c:X"c-cullng ;a now iostrudloo
[B$ (13$ (B'D(D., ., n timr;s)j d. Only level trisgered ontemopb are
a. complements when n i! even pulls:ihle on microprocessors
ll. c<lmplcments 1\o hen n i~ mid 21. Which ouc oJ" tb" followuag :tlgor.itluo
c. divitl~ IJy 2 ul\\ S) ~ design tocltoiqucs is u•ed m ftnding oll
4. remain• unch•nged when n i• c i 'Cln pain of shortest di<lances in~ s mph')
I4- A multiplexor with 1• 4 11it drola ~elect input n. Dynamic prograuuning
i,.; a b. Back'lr.!ekil\!l
"· 4 : I multiplexi.H' " · Greedy
I> 2 : I multiplexor d. J)ivide and f'Qn<tller
c. 16 ; I mulliplc:<Clr 22. Give the correct onatchmg lo r fll<:-
tL S ~ I mulllt>lc;wt followin& (111.111~
15. ll•c: thr.,..h()ld level lilr logic I iM Un: 1TL A. ()(log n)
fiun ily ;, R. Q (n)
.t. ~n,y vqlt:og.: ahove 2 5 \1 C. () (n Itt!! n)
b. any vohago b<:twcc'tll),8 V ~ud 5.0V D. 0 (n 1)
~. •nYvuhngo below 5.0 ,- I. Sele-ction
d. nny volt~ go below V" lnot ahove 2.~ V 2. lnsc:rtinn kon
16. In serial ~ommunicatlons emplo~ ing S 3. BinaJ')' ~t:'Jn:ll
data bits, a parity bit .tud 2 s top bits. the ~. Merge lllfl
minimum band ralc rcqutred to tusl.llin a A B C D
tronsfer rate of ~Ott c.it(lf>Cten! per 'econ·d a, .3 I 2 4
is b. 3 1 -1 2
~. 2400 band c. 1 l 4 2
b. 19200 band d I 4 3 2
c, 4800 band 23, How may 5ub~tnn~ of dillerenl lengtbs
d. 1200 baud (nOII·Zcro) ~n be fomuxl from " clJiltlicter
17. 11te octal reprcsilntation of an int.:g.,. ;,. slrulg of lcnglh n 11
3-128. r.r this were to be treAted os an oiAht :a. n
bit lnteger in .,n 80~ bn~ed computer.i t• b. n1
dedmal «Juivalem i> "· 1.
3 . 226 d. n(r l)/2
24. Wltich ol' the following s~atements l~ b. rn~~ condluon
tll lse7 c. • time Jock
~- .;\ U'ee Milt 11 nildcs ha.~ (n- Il edgeS. d. a dcadlod,
h. A lohelcll rOOicd IJi.rmr)" lrcc c~n be 31. A .:.ounl.ina senlll(lhu•c wlls iu.ilioli:tod to
tUJi(tuely c:nn~trocted given 11:' 10. Th~n6 J> (\\;oit) ()pQr:rtion• nn<l -1 \'
pnstorder :•nd preorder traversal (~ignnl)operrrtic)ns w.,n; c<~tnpleted un Utl<
I'C~UJls. gcm•tlhore. l11c reol!lting value of Ute
c, A ~omplere ~iMry free "'ilh n ir~cmal ~em~phore i3
nodes 11M (11 ' I) lenVC11 a, 0
d. 'The mnl<fmum number M m1d<:S in " b. 8
buu•l) l.l'ce 11f height h is ('.z"+l - I) ~. 10
25. Lo a resident OS enmputco·. wbiclt of tha d. 12
followiJIS syslem software musl re•ide in .:;;!. A computer h11.< sl.~ tape d1ives. with o
the main memory under 311 situations '/ processes comp<Oilng fur them. E~o!h
•. rusctublor process mny u.:ed lwo dri\·cs. Wlu!rls U1c
b. Llolrer m3ximum va lue of n for the s~"Slem to be
c. l.oader deadlock free ?
d. Compiler a. 6
26. Which of the followittg stat,,nents ;. lnl" '? b. 5
n. SU ( p~n<cr ls nu>rc powerful thnn c. 4
LALR d. 3
b LAU~ p•tser is more powerful U1aJl 33. Given lwo union compnuble relation~ Rt
Cnnonfcal LR· poC!Ior (JU 3) ond R~ (C.D). wbal is tl1~ n:sult of
c. Cnnonicn l LR porser is mor<! pow<:rful the operation
ihan LALR porser. Rl~ ~ o•o R2?
d. 1 he pa1,;ers SLR. C:uumiool LR. ruod •- R, v R1
LALR have t.bt: samo power. b. Rt \:1{~
1.7. l'ype checking ;, nonnally done during ~- Rt R,
;~. lexic.'tlllnnlysis d. R, n Rc
h. Synlo.\ anulysis 34. Which ponnn I fonn is considered ndequ•le
c Synlll.~ dirccred trJMIIIIiun for normal rel~tion~l database design?
d, Code <Jplimi~ation •. 2Nf'
28. ,-\ lln.l<tt' reads four mrxlulcs WhQ>it len ttl•~ b. SNJ>
3rt' 200. 800, 600. and 500 11 or4. c. -INl~
rc!p<llltiVet~. lf tb~y ure loaded in tlwl d. 3NP
Prder. whnt are rhe relr.tcation Nn~tnnb? 35. Tiu:rc ""' t:iveJ'e<>Drd! m a clulllba•c.
;~., tl.206. SOO,CIOO .~ AU 6t'tUelif1•rn C Nf£toa
b. 0. 200. I000, 1(>{)() Ramn 27 CON A
c 2()0, sM. 600. ROO Abdul 22 ENG A
•'- zoo. 711tJ, poo. 2Hlo Jertiffer 18 11CX' l:l
29. Wltich <:>r U1e followinll is au t:.'Cample of a Mnya ll SER D
spovlod ~ovice1 D;,v :U MUS C
.r. The terminu l llliC<I to ~ter th~ inpul 'J'hero I• nn onde~ file o.uooinled with lh is
dur• lOr th<> (' prognom looing c;wculed. and h contoin the w lucs I, ;1, l. 5 and 4.
b. An uulptil d~dcc used to prml the \Vbi<h one of th~ lic:lds ;, tlo• inJox bu.ill
out pur o"f • nntnber ofjobs. from7
c, 'I be secondory n.romor)' devtoo in • "· Ago
virtun I storage system b. Nome
d. The swopping area on ~ disk us~d b) ~- Occuporion
tl"'
"'' oppcr. d. c..tegor.v
30, When !he result ol' • computotion depend•
on the speed or lhe processes im•olved.
tlo~r" is Mid 10 be
,,.:,., ,:,,,1a*·Pi Ji·'·':·'f't t·l•
This question consist.S of?IJ (1\vcnty) 111ultiplu
n.. cycle ! te.>ling
choice questionR~ e:.ch carrying two marb* 'l'he
 I o! II
answer; to !he multiple ehoioe questions of ihls <1. Ever)' finite $Ubset of o non-regulor ~e\
N<lCtion MUST J>e w•ritten only '" lhe boxe• is re.gnlnr
COffespond~ to llte questions, in the second Jlag~ h. ll\'ery subsel of a regular sel is regular
oflhe answcrllook. (~Ox! 40) o, Ev•'11· f:UI.ite subs.::l of u rcgulur •et 15
::16. l11e rnok oflhc matri~ given holow iN : regulbr .
I 4 S 7 d. The i111ers<-ction of rwl• rcgu Ill< sets •s
0 0 3 0 regular
4 2 3 I -12. TI1c function rcpu:.•enlcd hy Ihe Kumougll
3 n 24 21 map givc:u. bclo•v i&:

h I A
00 01 10 II
~- 2
d. 4 0 I 0 0 I
('(m~iclenbe l(liiQwing cletennon~Jll I I 0 0 I

A•
l v
~~ :1
~
lt,
b.
A.B
.W~BC, C't\

<:1. B ;Ji C
d. A.BC
Which of Ihe rollowing r>n fuolor of A 'I Which of the Jo llowing nperation.' is
u. a- h commutative but uol a.,.ocialive
h. 1- b
a_ At'ID
~. arb- tt
b. OR
d. obc c. NAI'lD
Ouo binnryrelation R = l(ll)l, (:!, 1), (2,
d. lLXOR
21, <~.>). <2. 4). (J.I), (3, :n <3. 3) (3A) J -14. Fomtalllug uf • floppy ~jsk refcr.o to
on these[ A(, t,:!,3,4} is
a. niTIInginJ! tho dnla nn lhe disk ln
,,, Reflexive, 5)11tnte1ric and lran.s itive
contiguous fJtShion
b. I'/either ll!llct•dH:, nor irreflcxlvo hhl b. writing llu: ilirc.;tory
t.mtl~ili\lc
c. erasing the sy!ltum ur~
c. Rt:tlexiv~ 1ymmctric tiJJd tnmsltl\·e
d. writing identitici•tiun intin'Tl1r•tiun em
cl. tn-elle.'live 1md anti·•Yflll11elnc lllltuol.s and sooton;.
ln a roo111. conwining :!8 people. tl11:re are
lltc addross 5P""" of 80$6 rrtt is
1M people who •peak l!nglisiL IS Jh'Opltt
n" one Mcgabyh:
who speak Hindi and 1:! people who •JX;•k
b. :!56 Kilobytes
Kannada. 9 peroons ~peak bo.th Enghsh
c. I K tvlegabytes
and Hlndi. Ll persons speak both Hindi
d. 64 .Kilobvtes
and Knnnada \\ h~,..,s 13 Jlt:TSOos $pettk -16. A complete· 11 nry t.r\:4: ~ am: m ~\~llich
botlt Kt~ttnado nod English llo•• man~
every node Ito$ 0 or ~ ~On$. lf X t• the
people ~peak ollthe lliree language$?
• . !)
number of internal nodes of A complele n-
ary lo't:C:. Ihe olll11bCO' of leaves in it i.• sivcn
b. &
by
1!4 7 a. ;~;(n - J ) ~ I
d 6
b. ;~;n- 1
~0. l.t:t l, be Ihe ~ctuf all hinacy strin~ who,.,
c. xn • J
l""t lwro symhvl~ uo'e Ihe same The nuonll<..,- d. ~(n~l}
of •tnt<:%~ '" lhc minimum •lute -17, What ' "" I'"' .vould the tollowin~ function
clctenninil;tjc fjnit~stnte aulum~lon
11:1urn lbr I he input X = 95?
UC!lCJlling I, i~.
function 1\ln (X ! i~leger) : Ullegc:r,
''b.· :!
5
begin
Ifx .,. J()() Uum fun : = x- 10
g, 8
F.lse fun : llm(funlx"'" Il l)
cl. :0'
atd:
41. \Vl1iuh of l.b c following s ll!lcJT1cnlb i~
• . 89
Inhe? b. !>0
 3 n LlS
c, 91 c, IQ KB
d. 'J2 d. RKB
·18. Whnt is lhe result tit' the following 52. Consider 1t processes sltnringthc CPU io a
progtnm? round-robin f11shion. 1\s.~uming that ouch
I'll+-~ ('oopa. Olllpll); p113ccs~ switeh cokes s seconds, wllllt mliSt
- X. ..... : ialcFr. he lhc quonmm sL,c q such thnl ihc
ovcrhClld rcsnlling fro m process '1wiwhing
r-a...r c_,. , .....,): ~
is mini111izell lmt. nt tlu~ "'tme time, e:tch
....... process is ~uaruntec:d 1<1 ~et its u~rn ul tlte
CI'U nt le<.c.l c\•ery l seconds'/
/ - 11.'1
a. qs--
n- 1
f - IlS
x .:• j
b. lj ?::.-
11 - l
'
.-It': - l(x) • (:a); , r- us
c. q,.- -
u +l
....
1L 5
Wlbda (laah);
·'
u
1- u.v
., ~ --
11 +I

b. 25 SJ lf mt inslt\I~U<IIt take-s i micm:.ceo,uds und

¢. 36 a page fault take:; att nddi6onal J
micrrosccQnds, the dlC:ctin~ instroo6on
d. 42
-19 l.ct/1 be o lwn dimensional army declared tim< if lin the u1•eruge u pag,~ fuull <.><JCUI'S
every k ittstrucdiltlS is.
as tbllnws·
A array H , I0 I J1 ·- I 51 nf iulo!ler: !1- I+L
Assuming ih:rl eaclt lu1cgcr- lllkc• one 4
memmv locutiow U1e urra\ I~ SW!t!tl In h. r+rk
n:>~Hnajt.•r ..,n::le.· attd tbe ti'rst eletnenl of I+{
tlre ru:ruy ;, sluretl Ul l\le8Uon l 00. whnl is c.
k
tlte uddress of tl1c dem~nl A[i)(j] 'I
d (r+J)*k
a. 15i+j..-84
b. t5j • i"'-8~ 54. Which 1,1[ the tbllowing query
c. 10i+i+89 h11nslomtu1ion~ (i.e.• Nplucing, tlte J.h.s.
d. 10H- s9 expression by lhe r.h.s. expression) is
so Faster """"ss ru t~<m-lucul vona(lles JS incorrect 7 R, and R! are relations. Ct C1
are seleoti<ln conditions mld 1\1• II: nl1l
aa-bic\'cd usjn.g a.n array of pn1nlcrs to
activnllon records, culled a attribules of Rl-
n. smck n. cr (u. (R,)) .... cr., (<' (K,J)
b, heap b (f <11'.., (R, )l -'>17, (0' 1 (R, J)
c. display
cl uctivuliou tree o. u. tR,v R"J -+u~ {R, )uu,, (R., )
51 The O\·erla~ lree li>r u p10gr"m I~ as SIHlWJl d n:..,cr,, (R1)) ->CT~ (lT,(It 1 ))
belOW! 55. Suppose ~lc dowuirt -set ul' 1t11 uttnbute
ccnsists pf .>t'ignod four iligit numbers.
Wbul is 1h~ percen tngu uf redt•etion iu
>IOrngc Spllc<> uf ~~i~ nnribute if' II is
sll)rn!!c us nn inleger mther limn in
cbanUol~r fonu1
• -r m t ;~.
R()'lo
What will be 1he size of the partililln (in b 21)'! ,,
physicul mcm<>ty) nlltuired t<> loud runJ c, ()O<'o
run ) tins pmgmm'l d. 40"··
n. 12KI'l ;i(l, An~wer the lhlll"\\'11\~
b. 14 KB
 Out M
11. Two friends agree 10 meet at a park one parlor).
with the folia-'lng et>nditions. P.ttch
will rcnch the park between 4 .00 p.m. F.:<prc!IS the lollo\\'ing In SQ!..~
and 5.()0 p.m. and will ""c if !h.; other l'ril)t Jl\~ sl\l<.lotll.~ rlllll fre<JUC!ll m lau>1
hu$ nlrcady nrrinxl If nol. they wi ll one paden thnl serves- some icc-<mrun
wuh for 10 minute$ or tlte ..,td of the th~t tltey llk.e.
bouc whichcV<'r i~ cnrll~r nnd lcuvc. b. Jn a computer syst~m wbeto the ' best-
Wbut i> th~ probability that the hV<I til ulgorilhm is us.ld for ullocuting
will oot meet? 'jobs' lu 'merunry p:utition.'> _ the
b lrivc u t'L-gulor cxprt~si<>ll for the sci of following siruation wus 01tOI!uow.:d:
binary s1rings \\111m: every n
is
imrnediotdly folfowetl b)• uxuctly k 1·~
nnd prvcccd<:d by ntlca_•t k l's (k 1S n
..
ti:<ed 1ntcgcr)
57. .DestgU a. clet<uniuistiu 4uit~ stat" When wtll the 20K job complete'/
autumatoo (u.sing nunitnuw number or
~lllt.,;;.)thul rccogRiZ..s th" l'ollo\\"OS UCTIONB
looguage: P1VI!' II.AJID a ..attona (ISO t• 71)
L - I"' e {0, n. I w interpret(!(! "" "
binary ou111bcr (iguoring 1b" leading zoros) Thur nre Tw.:nty ,,uestioll!l her" 1nlmbi!re.J 60 to
Is d.visiblu by fove) 79. AtJSwcr uuy Ten (10) qu.:llliuus ii'om this s.:L
II. '!'hi! implie~llioU sntc Sh()ll'tl IJ<!IOIV, hHS Each qu>lstion cnrri~s 5 mn!l;s. ffynu um;wor mor•
two iupul~ ("- aud y). tlte output is J !brut J(J questlc;ros. ~otly the Ur.<l ten will bi!
except wh~n ~ = I und y ~ (), Roolite f ovnluuttld.
= 3:~· • x)usiog on ly four ilnpliention J\11 lh.: parts ol n question MUST b: nn•>>1lrOO
gates togothur. Fur "xnmple if Q.n()a is unswcn:d fits!
ttnd 1.) f>()h suhscquently elsewhere in Ute llnswer
book only Q.6(1• will b.: .:valun1<:d and Q,60b will
y - - - 1 . ....- bi! ISII~f.:d,

b. Sho\\ thnt tho 1mplionlion gnh: is ro. Answer tb< li>lhmiog ·

[uuctioll:Jll)' cmupldt.: 3·,Find tho po.ulls of local outx<mn nod
58. Aru.·wer the loiJowmg minima. if uoty. ,,r
the follr>wiug
11. Solv.t tb~ L nllnwing r•eurr"uo.s r~lutinn funottou defined in USx S 6.
~ = 2x,,_,- l. n J x-'-6x t9x · IS
Xi :::. 2-
b, Consider the grammar b. Jntcgmt.: 'f .< ~us.rdr
S~Aa b T

A.-+Ac I Sd e 61 Derhe lite expression lo r lhc uumb.:r oi

Construct an dqui \'t>l¢11l (lrnnunnr with no op.Jrulion~ ro;Kttur.:d 11> slllv• • syst<~m of
left rccursi<m onJ With minimum number lineur equlllions in n unknowns using 11~>:­
of production rnlos. GallS!>iun Eliminnlion Mcthnd. i\.Stnno
59 Ans11cr Jhu IC>JIC•wing . t·hm one opcrntion relers to n
li Surrose we hll\'c n dnlnba,.: oonsistintl nmltlpliQul(vu I'OIIowtld by·un udditicn1.
(~. Answer the follo"""J! .
(If th~ lollnwing tlln:e relations.
fllliQUI!NTS (sl udeui. pnriN) giviJt!l n. !'rove by tnduoriou IhaL tl1e expreS>;ion
the parlors eac~ studllnt l'lsits.. lo r lho num~r of diagonals 10 a
SERVES (pnr)..,r_ ic.:-creuru) indit<tting polysou of n sides is
w hatlciJtd orice-<renms enclt purl or ll(n-3)
S<r\'C$. 2
UKES (sh1dent. ice-ore11m) indicating b. I.e! R be a bm3l) relution on A - (a b.
what ire-er~U~m~ o.~~~ch ~lltd.,ntli~olll c. d. e. t
g. hi 11>presentc-J by
[Assume lhnl csoh shtdcnt li~-esnll~lls1 folluwmg. t WI) c'(IIT1]1(>nellt d[&mph.
ou~- i\:c:--cream nud fre<Jilents dl leus1
 711f8
F1nd the smallest mregers mAOO n suoh b Use lhe. grammur rn Pan (n) to gh-e a
m< nand R" : R~. CFG for L1- :n' b' a' b1 ll.jJLI ~ I .
r-1 Qrk = II b~ ~dding not more 111.'111

I ~\ 5 produCtiOQ$ rules.
c. Is~ ulhcrenU)I!rllb>guous "

~Ljt1~/ · OJ. Ans11er lhe follo\\11lg

4 D111W lhe schematic of an ROSS based
>~stern that am be used to m~ure lhe
~~ Suppose A= I:J. b. e. dl and n, IS th~ widlh (lfo pulse Alsumethot the pulse
foltol• mg parritron of A ls givrnns a 'ITL. CQI11jl31ible signal by
n, ~ n~~,b.cJ.Idt l Ure source 11 hich ~enerntes it
a. LISt iJ,c 01'dcmd pall'$ nr rh< h, Write the 8035 Assembl) Uin0'Uilge
equivalence relations indoced b) n. program tq rneame the 111dlh of 1he
pulse, State all )'O\If assurnptior1s
b Oral~ lhe l!fAph of lhe abo\'e
t(j1m'lllence retnlion dearl} .
t , lei IT:: i In). fbi. lcl, ldll 68. DeSil!Jl .a synchronous cmmrer ro 1!0
ITJ: qa,b c.d.J I through the follo\1 mg srates •
1 . ~, 1.3. 1.~.2.3, 1 , 4.... . . .....
an.i n, =l ln.bt. (c.dfl
Drnl> a Poset.dingrnm of the pose. 69 Calculnle lhe rollll tunc requu'ed w~ed 3:1
sectors on a l s1ded Oopp) disl.. Assume
(IIT 1.11l.n,.rr,) . refmes} that e.~Ch trnc~ has S sectors and the trad
64 Lei (A, •) be rt semi-group. Furthennor~, to tr:.ck step t1me ISS millisecontls. )'he
l'or WI!!)' nond b mA, If a • b. then a . b fil'$1 see1or to be read Is sector 3 on track
~ b·a. 10. Assume !hal tl1e QisJ.elte IS son
a. Show Uurt ror every a in A sectored and lhe oonlroller hils a I sector
{l t a -= a buffer. 1'he diskene spms at 300 RIIMand
b Sholl' th.11fur evfl')' ~- bm II uuriall) . lhe head 1<011 tratk 10
a. b. J-= !S iO. For a ;el-assodative Cache. Orgaruzation.
c. Show that fQT e-,e~ 11, b. c lJl A lhe paramelfrs are as follows
n· b-c: a·c t. - Cache access nnie
65 LerM -Uq,_ qd. fO.tl. lz.. Xt. 6. <iJ, z.h t, - Main m~mol) n~crss ltme
~)be ~ Pushdown aulomalon where 6 1s I - ~· o£ Si!IS
gJVen b) b- bi!X'k size
~ (q~ I 7,,) = l!'lo. Xz,,):
k. b set sile
t:'aloulu•e the htl rnuo for a loop executed
~(qu,E. 7<,)= I(C
j,•. Gll
100 limes ll'hm1h~sJZC of the loop •s n·b,
'S(Q!I. I. X) - l(q,h XX))
and n : l •m IS a non-zero 10tcgcr and ) <
i)(q,, I ,X) ~ [(ql. E)J
llJS(
6(q,, 0. z,,)= l(q,,XH
G~'e thevalueof the hit mtio fur I = I.
l\fq~. O.l<l) =llqo.7;.)) 71 illllll<r the foi!Qwtng
3 Wh~l IS the laogu;1ge uccepled by this a Let p be mpointer as shown ht ~~~~
PDA ~~ empl) slore 7 figure tn a ~mgt)• linked lisL
b l>esenbe ini'Om1all~ ll1e wol km~ DI' Ibe What do the follo\\lD£ assi[!J1lllent
PDA statements acbteve 1
1)6 1\n.mer lhe (allowing q ~p-+ne~t
a (.ctG, =(N T. P S,)beaCfGwhere.
p ne ~t =q - • ne~l
N" [SJ, A. B) T, lo,b) and
~~ ~~~~t =(q~ nelll)~ ne\1
P isgi>'en b)
s, ~ ~ S1 b S1~ a B b ([) "' IICXt)-> neXt =ij
b c~mpute lhc post fis eqmvalent of 1hc
S, ) a Ab B > Bb
follomng mlix expresston.
1\ aA B-+b
3 •IO!>~~ +I) a/2
..143 72. Dra11 the binD!)' tr.c with node labels a. b.
Whal is l,(O 1)1 c. <l e, r llllli ~ for which the morde1 ;tnd
 !lut N
postorder trilllsversn!S' result in tlw :1. Frc!<: dfsk space c1111 be 1.-epl track of
!Ollowins sequences. usln!! 11 free list or u bit map. Disk
lnurdcr u f bedgc utldro.•Sil!. reqltirc j) bil~. for 11 disk
Posrorder n f o &c d b wilh 13 blocks, F of which is free. slttlc
73 1\)lS\\CrJhc foJJO\\ing 1JaC ~'Qndition IInder \\1hich 1[10 fn:ll lisl
n. t:>crive n "'~'arrcucc rulati~•• oft he ~-i'W 118"'1 lcs~ space th3Jl the hit rtmt•
of lhc sanallest A V1 trcc";Jh hoight h. b. Can~id~r o disk '"th C cylindurs. 1
li. Whnl i~ the •izu uf the ~mallest A VL trucks Jll.'t' cylioder. s :;ecl()t'li per II'CI¢k
trCc \\·iU1 hdght 8'! nalcl a St'-1\0r lcngt!J •l A logical lilo L
74 Allsw<'l' the !OJ lowing . wit!J Jlxeu ro:cord l<:ugtb r( is •lt.lr...J
:L An rueotiUer Ul II J"''OI:l11Ul11Uiog couuguuus~· OU Ibis disk SlaJ1iug Ut
lunguug" con~isll! ol' upto sL't leu~rs lclCUI.i1,•t (ca,. t._. ~L). 1\heru Ct. tLllttd >t.
nnd digil'> ~·f 11hiol1 the first chnmotar ure th"' <-yllnd~-r, lmck tllld sector
must be u l<tter. l)•ri ve u rest~.lur numbers. respeclivcl) Deriw tltc
c..''(lrcssion tor tlte id~~rtili<ll' fnrmulu l<l <'nlculuto the dis~ addn.'Sl!
11 Build lind 1.1..( I) pnr..ing tabk for th~ (i,e. cylinder, tmck nnd sector) of
longunge dotined by the I. L( I ) I<JSi"''l rucord 11 ussouaning thor rf -
gmmmor wilh production~ .'fl'
PI'Osraan ~ bcgan d semi X c.od Consider u1e lbllowin& dabbll.'ie relauons
X-..tlsemi :X:i sY cootau11n!' ~tc nuribu u.•.s
Y-+ semi ~ Y e Book-iJ
75 [.el Ihe nnribulc · vnr givo.> Ihe value nf H Subj<!cl • C•tegory of · bou~
binary lllLJllhcr gc'Dtrrated 1>1• S d I the Na1t1e ul' - Author
lotlo\\ing .grammur; Nutionali lv . or. t\ullHlf
S--+ LL L with Book-id mlhc primary key.
1 -1.0 1 a :1. What i~ 1ho highest nonnal form
salistied by this relation'/
B-+ 0 J
For cxampk att mput IOLtol gll·es S.vn l b. Suppose-lhc allribulcs Book· tille and
= 5,625. Authnr - nddres.~ nre ntlcled In i hc
CCM.\Stnad u svnmx. di1'1!cted tmnslulioo rdation. ood lbc prinllU)' key is
scbeme usmg i.dy s~~olbcsrLed un ribut~s. cbunged to Name· of· Ant!Jor. Oook •
to detonnine S,vuL rille), whol \\~II be Ut~ hJgloes1 normal
76. Answtr tbe foJlo"~OS ionn s:u.lstied b) lllc rclmloa1''
o. Four jobs ore waiting to be n111 Their 79. Cunsitlcr t h~ lhlltll\~ug rcl:lliounl dlll.llbll'i"-
scbcrn~
"''-pcctcd "'" tlntcsut<> 6. 3. S ana N:. In
what order shonld lhC\• be f\ln lo COURSES (Cno. name) •
minimize""' :avel'llse n:sfx,nse liaue'/ PRFrREQ (Ctoo, _pie • Cnt1)
b. Writ~ a «uururn:~u prosmm using par COMT'I...ETED (sludcnt n0 , Cno)
begin - pur <~tcl Ia repr•<iSCltt tloe COURSES g.ive IJtc mrmber and nome of
allth~ nvnllablc ~Oitn><lS.
preci.'IJet1Ce groph MOI\11 bek>W
PRE·Itf:Q grvcs lhc in lomtahoo obout
St \\hicb cootrscs nrc pre· requ!sites lor u
gi\'..UJ course,
COMPU:i'l'ED mdlcatcs wbal coun;cs
huva boen compleled by student.>.
Express the foJio,\~ng usutg-relatoonal
ulgpbm:
List all the courses tor winch u ~tudcnt

' '"tit stud~n l·no 23 1(J has completed all the

I) ,..,~ruqn isi 1oo.