j GA TE- 1.!

196 1 o( 10

l COMPUTER SCIENCE & ENGINEERING

SECTION · A (100 Marb) d. Tile se[ of real uumbcl's eN eluding Lero
is an abelian group under
multiplication
Woite in youo· liJISWeo·-book the tOI1'et:t oo· Ill!!. Two dice are thrown si muhaneo.ush· Tiu•
most apanvpriate nnsweo• to the following probability !hat aL least one ol' the~1 will
multiple choice questions by writing Ute hare 6 ft~cins up is
eoro-e.~ponding leiter A, B. C or 0 agaiusl ille
I
Sul!-qut'tlllon number. a.
3(i
(25 xl a 25)
Let A ilnd B be sets and let l'.r
and a'' b.
3
denote tho complements of the sets A and
B The set (A·6)u(B-Mu (M B) is equal 25
10 c. 36
a Au B d. II
b. A<'ua ' 36
c. An B (i, The formula used to compute an
approximation for the second de.ovative of
d. A''na'
a furtction fat u pomt xo Is
Let X = {2. 3. 6, 12, 24f. Lel s be 1he
f'(:~;, + ll)+ f(x,,-11)
pao1ial order defined by x S y ii'x di\'ides a.
) . 1l1e number of edges io the Hasse 1
di:~gram oi'(X. S,) ts /'(x,,+h)- f (x,,-h)
b
a. 3 l.h
b. 4 f(x0 +11)+2f(,r0 ) I j(x,,-lt)
c.
c. 9 h'
d. Nc)lle ortbe !Jbove
3. SUJlposc X andY are sets and lXI and IYI d. ,_•
l (-'n +h) - 2.f( r,,) + 1 (-J;, - ".)
ore their respectil·e cardinalilies. It is gi n~n
7 Let Ax = b ben system o( hnear equations
that there are exncUy 97 functions from X
where A is an m x n matri.~ Md b is am X
to Y. From U1~~ one can concl ude lh01
I column vcc.tor and ' is a n X I column
a. lXI= I. IYI= 97 vector for unknowns Which uf the
b. '=97. 1YI= l following is false?
c. IXJ=97_ 1YJ= ~7 a. The system ha.~ a solution 1f and <>nly
d. None or ihe above 11: bolh A and the. augmented matrix
(A b] hm•e ~H!sameranL
Whi~h of the rol lowiug Statements IS
false'/ b JJ m <ll and b .os 1he zero vec.ror. then
the sys1em has on linnely milny
a. The set or rotional numbers is an solutoous.
nbeliru1 group under addiLion.
c Ir m ~ n and b is a non ;ero I' COlor,
b. The set of onlegers is an abeloan group then the system has a umquesoluti.on
under additton.
d The system will have onl)' a lm ial
c. Th.e sei of mtional numbers fom1 an solution when m = n. b is the .t.ero
abelian group under muluplication. vector and mnl.- (A) n.
 :loflll
s. Two of tl\e tlJIII)\\Iug fll~r
,-egulur iJI. lmplemeutmg QUEIJES on u urrtulur
cJ•pre.'"ions11re cquivalenl. Which two? (r. orra) is more cl)jcieut LbtUt
is tho em pty ~Inns) - implementing QUEUES ou 11. linonr
Orrlt) with !Wo indice~.
(i) (!lOt• (8 I OJ
(ii )(00)" 1\ _ Last-iu·lirm-mn type of <OmputnliQos
ure eJlidcutl) supported by OUEU£S.
(iii) o•
Which of tlte following is uortecr?
(II') ()(110 1°
a. (ti) oud (iii) nre true
u. (i) und (ii)
b. (i) and (II) 11re true
b. (ii) and (iii}
e. (iii) ond (iv) ure !rue
c. (i) nnd (iii)
d. (tb aud tl\' l urutrue
u. (iii) :wd (h•) An uJ\ Ontag<l uf ohuinud hash 11lble
13.
9. Which or the tollm\ing statemems is (ex1emal hn•hing) over Ute \lpcn
rnlsc'/ utldrcssit)g scheme;,
u. Tho Flulling Problem for T uring a.. wors1 tase complcxttv of Se:lfClJ
m.,cltinc~ is nqdcciclnblc, opcnatiuli!i is l~;ss
b. Dotamimng whether a context ftoe b. >-pace used is less
grumw~ri• umbigu(Hts is undedtlable-
c. dclcrioo 1~ ensier
c. Gi~cn two urbilrary context free
d. none of rho a.bova
STllJJ' IJ1Urs G, uud G:> it i• l!ndectdnble
whether L(G, \ - L(G,). I.J. In rh~ lmhw.:ed binury tree lu I'ig I 14
d. (iiven hvo regulnr gr:wunurs () 1 >tnd ~;iven llel"ll, how mun~ uodes will
(i : it is umlceiduble" "berber L( G 1 ) =
betutha uubt~:mced when u oode •~
L(G,). inserted"'" p ehild oflhe node ~.,,-.7

10. Lei L ~;: !:• where!: - {a. b}. Which O(lho

foll(lwing is trlle?
a. l. - IX x h.as nn cquul number of n'!t
and b-s}ts regular fll-1.14
b. I ~lo''b" ! n <e l ) i~ regulnr
c. I - JX I l\ ltus moro ~·s than 1)'~1 is
regular
d. L. = 1~'"h" l •u ~ I. '' ~l l is regulur
a. I
II Which oft he full()\\ fng is false'/
b. 3
a. 100n Iogn -- o ( toO
"lugn) "· 7
d. R
b. ~log 11 O(loJ!, lllg n) 15. Whfch \!f thc f()IIC>IVing sequuncc~ denores
c. 11'0 ll y then n'- ()(nY) Ute post order lmvcrsal sequence of the
lree oJ'Qt1cst•on 1 . 1~ 7
d 2" ~ O(lll)
<1, fegocl bu
!2 Constder rhe Jol.lowing stmements.
b. !l c b d a fe
' · Fi rst-in-li rsr-outt) pes of c,ompurations
are cfficietttly $11pptlrted by STACKS. c. gcdb l ea
ii. lmplcmc.nring LISTS on linked hsts is d. l'edgcb a
more efficient than implemcnti1tg. 16. Relut)v~ modo uJ' uddr.,ssiug ts utOSl
LISTS on Ltn armY ti.t r nlnrosl all !)to rel<>vunl to wriri ng
basic LIST opcratiQn~. u. C<>rclurines
b. position-indcpcmdonl code
 3 <'fLO
a, shareable code 21. A ROM Is 1tsed t!' store Ute table for
d. interrupt han<D.m 111111 tiplic:at:ion . nf _two 8-hlt ll11J!iSfieil
mtegers. The su:e ot ROM teqturedi~
I?- 'rile pa.ss uunj~ers for ew.l1 of t11e
tbllowlug activities a. 256xl6
i. o~ject code generatidu b. 64Kl<8
ii. lfternls added to literal ~1ble c. 4\C x 1()
iii , )i$till!l printed d. 64 K:tl6
iV_address resolution oflooalsymbols 22. Nuniber of rrutchin~ ey~1~ re4nitoo for
Thal occur in a two ]~ass assemb1<tr
m
RET instruction 8085 micropr<lcessor i>'
respectively are a 1
a 1, :2, I .4 b. 3
ll. .2, J, 2, I c. 3
c. 2, 1~ L 2 d. 5
d. 1, 2. 2, 2 23. Bootlt's a1goritbrtl for iltteger
multipti~tion gives wonl! perfum1u.nc:e.
l8. T.he proooS's statetriulsition dingnun in Pig.
When ehe multiplfer~ali"Cm is
1.18 is represcnmtive of
u. 101010 , ..,. 1010
b. 100000 ..... 0001

... ~.~.
q, I Lilli ..... ilil
d. 0111ll + ..... 1110
24 For dtc daisy -chain ~cheme of COJ1Jl1.'Cti.ng
110 devices, whicll of ll1e [.)!lowing
a. a llatcltopentting system. stalll!'Jentll ~~ tn.u•~
b. an operatmg sy.stem wltlt a preemptive a.. Itgives non-ID.tifoon priority to various
devices~
·scheduler
c, an opcra1ing system witlt a n<.m- b. It gives 1mifonn priority to all ~evtces.
precmp~ve scheduler c. 1t i s ..mly 11seful for cortnectii~g slow
d~\llce.<> to a lrrocessQt,
d. a ani-programmed operating sy$tem
(9, A cri1icalsectiorLisaprognun segmeut d. II n!quirl!s ~ separate intemqJI pin oo
l.he pro~sso.r for eacb device..
a. whiclt should rwdn a vermin S[!ocilied
amonnr of time 25. (;:ou;,der the foUnwu1g lloatUIS 1101n1
numberrenreseniati.:>rt
b. wluclt avoids deadlocks
c. wl1ere sltard resources are accessed
J1 :MZJ
-0

d. wbicb must be enclosed by a pair or

semapltore operntions, P and V ._us
20. Which of ll1e fullowmg is au example of n Tl!C' exponent is u1 2's complement
~pooled device? represelttation and manllssa is in tlte si211
magnitude representation. The range of dle
a. a l.Lne printer used to print the output of magrlih11ie of the nonnalised tlltmbm in
a JtWnber ofjobs
this representation is
b. a terminal used to -enter input data lo a
a. 0 1o1
tunni ng progrrun
b. 0.5 ttl l
c, a secondruy storage device in a virtual
memory system c. 2' 23 to 0,5
d.. a graph.ic display device d. 0.5 to (1 -2'"')
 -1 nf Ill
W1i tt in yt)UI' answer hook the ror•·cct ur d. A ~ubsel • ~ • of G is • aub8fi"'P of
the m o$1 appm prlalc· 11nswer lo lhc· the group <G, • > ifnnd onI) if for :ony
following mu lt ip le ch oke questions by pnir of element a. b o:s. a '' b·l o: s.
writing Ihe corresponding letter A, B, · or 3t). The Newton-Rophson it.,rntion fonnu lo (or
D ~•galosf tile Sllb <1uosl:ion oumbe1•. finding l};~ whe:re e ..... (I is~
(25 ~ 2 = 50)
a. x.-.l a!~ *
J.~
26. U:t R denote the set of rc• l uurube.s. .LI!l r
R " R ..,. R .~ R be • bl]cctivt full~tiou
defined by f (x. y) = (x y, x·y). fhe
invetSe func.tion of f ;,. given by
c. x~ 1
-1. i' (.l'.f) ,.( _1_._1_)
l .T~ )' J'
.'!;-

d 2.~ .J "
b. r'l·... >·l~ t.t )'··'·· d 4 .r, ..l -
J.._

.:,. J' (.\',y)-( s / • ,t

2I') 31. The mot rice.• reo.•
•in.O
(1 srn () JuruJ ["
co•n o ,
~ l
d. r ' (x.y ) ~ (2(x yp( x· vi) eorumute under multit>li~»t.ion
27. l.e t R he. ~ non-empty o'elotion on a a. ifa = b or 8 = mt. n 11n integer
colle.:lioo of sels deunetl by A RB if ~nd b. n1wa~·s
only if A , B (>. T ht:rt. (plok lh~ true
c. never
s laletnenl)
d. if• cos (;I = b •in q
~ R is 11:11lc:<:ivc trJnsitivc
32. 'fha probability tlr.lt the 1'op and bollom
h. R •• symmetroc and not lrllnsiuve
canis of Br.mdotnly shuflled deck ru-e both
.:., R is •n aquivolence Nlalion ;fee• IS"
11. R i'l not I'C!Oc;xivc nnd nOI .<) ononclt ic ~ 4
a.
28. Wluch one of tho followin& is false~ Reod 52 52
•• AND. • >S OR , ;u 1\0T, • os one.
4 3
wuy impiica·tion .and (>- • ns two way- b
implication. 52 52
4 ~
n. l is: >YI ....~1 > .V c.
52 51
b. ((-x~~·l • 1- x .....y)l- x
4 4
C (S:...,(X )')) d
52 51
u. ((X.;y)<-> (~s-> y))
If L1nnd L, are context frL-.: lauguugc~ 1111d
W. \Vbicb one ofllle foUowing is false'! R • te.-gulor' aet, one of the lnnguoge.: below
•~ ,,,. •el or all hljc:ctivc lUnd ions on ~ ~· not necessarily • cc>nle.xl free lunguaJle•
lin it~ set fonus J grou11 und<;r function Wbicltooe?
composil iou. a. L, L:
b. The set {I . 2 . ..... p-1) Jlonn~ a go·ou11 b. Ln L,
under multil•lic.'ltion. mnd v wh<* p i•
:. prime number, "' L1, ' Lz
c... Tbt &cl of 2U slrJngs over a fin:it\! d t.,.. 1-.
alphabet ~ fonn• a group under ) 4. Dcfiuc tbr a C!lll(CXI fi<:e lr\nguugo L k ro.
ooncaten3tiott t r•
 ...
o-.-......_.w

a
~.-
"'fl•
_-
. ... .........
~-..t· -=~---·•ll.lfl
A•••'*,..~~~ q.

tltc set of aU binary strings with

\
........... .
38.
C, 0(11'")
d. None of the above
5 uf lu

T)le llvcntgc nllll.lbL,. of k'-i' compurioons

uncqunl nurnher of 0 -s ami I' s done m u ~uccc!SSfuJ se<.jlhmliul s.!ltrch m u
h the ~~~ of nil blnlll') slrmg~ mcluding list oflen&lh it is
ihe mill stnng n. log 11
c the set of oll hinary strings \\ith exact!) 11 - 1
uuc mote II tbmt Ute fiUUJber of l 's or h.
2
1>11..: more I Utan th.: nW11bt.1· ofO ·~
II
tl. none uflheubove ~.
2
3$ The gruuu1u1r whQSe prt><luclnmli :>re
tHI
<->~it w ... <-!) d. - -
2
<->--it w ... (llaol) . . -.>
:w A binnry sear~h lftle ill J!o!iiemled b)
~ ... id ~ id h1:;erti1lg m ,\rtlcr the filllt!\ving mtcgers:
r.~ ambigU()U."because 50, 15, 62, 5, 2(), 5$, 9 1, 3, !1, 37,611.24
n. d1e senlence The numbcr nr nodt-s i11 tM Jell Stlhtrec
i Fl heif then c := d and ri~t subtrc.: oflbcrool n!speolivdy .js
has IIH> t:llnsc lrl'CS a. (4. 7)
b. the .ldt most llJ1d ngltt most den vnltons b. (7, 4)
or the sentence c-. (S. 3]
ifu lheJJ ifhtha1 c ~ d cL (3. 8)
gtve rise 111 ditTeruntpnr:le tr~"s -1!1. Qwcksort JS ron on two mpuls lltow below
10. 1he sentence to sort ut ascending order
i[ u tbco if b then c ~ 1l o:ISC I! '= f L 1. 2. 3, ,.... n
bas more than two parl;(l tr"es iL n.tt·l. n·2, .... 2, I
d. the St:lJI.L'nCI: Let C 1 und C2 be tlte nwnller vf
ifa !hen ifh then c ~ d clse e:= -t' compruuons lJlltUU for u,~ inpuL~ (i) ~ml
(ti) respecl.lrcly. Then.
has two parse irees
a. Cl < C2
nte Ullllitnum num\l<r or int.m:hanges
nccdcd to cqm•en ihc rurny b Cl > C2
89_19"40, 17. 12. l0.2.5., 7. 11.6, 9.70 c. C l =Cl
mt.o o heap wtUt the. maxumnn dement at u Wu ctumot suy ooylltin~ for tiTllltrm:y n
th.c rom is -11. Whtch of the following mucros can puL a
IL l) n1ucw usseml>lcr tnlo an infillttc IOOJ)?
h. I I .M.<C.O Ml, X
.w-oo.x .ux - o11w:1
c. 2 Mt X+t
.EHOC
d. 3 .If ~x ,;rx •VIhco
.WOIW X ~ ~~'*" (X) iu~oced 11mt
37 The NCliD'<!llCU re.JalJOU .ENDC
T{ I)-2 .ENDM

I
T(n) t n(~) +n il .MACJI.O Wl. ll
,JFEQ.X
>uX
has Ute solution ,T(n) equal to ..J;NOC:
.If "NF.. X
a, O(n) .WOIW X-tf
b. O(log n) -...
.llMJCZ
 6of t O
a, (ii.) only ~der ro•md rolnn scheduling wil.lt time
b. (i) only slice ofone time will is
c. Both (i) 8lld. (ii) a. 10
cL none of the above b'. 4
~2. The con:ect mntcbing f or the follo\vi.tJg ~ 8
pairs is d. 9
A. A.ctivatimtrccqrd 4(>. Consider d1c c:kcuitl.n .Fig. 2,21 WlJioh l 1as
B. Location counter a fonroil binruy number i))b~b1bt. "'input
and a five bit binary mrmber did;dzdtcL1 as
C. Refe(l!lwe <'tlwtJs output '11\e circuitimpler.nents:
D. Address- relocati.m .........
L l..Ulkil!g loadt!r
2. Oru'bage collection rm<=FHif
3. Subroutine call
.... A.s~cmbler
a A-3. 13;4, C'-l;P-2
b. A-4. 8-'3, C-~ D-2
a. Binary to Hex conversion
c, A·4, 8-3, C-2, 0 -1
b. Binary t o BCD converstorL
d. A-3, B-4, C-2, 0 -1
c. I}inary to grey co<je conversi oli.
43 A 1,000 J...1l)"te memory is managecl ~·ing
wrlable vartinons lluJ no compaction. n d. Binaryto radi.,.·l2 conver.siol)
currently has two partitions of sizes 200 Consider. lhe wcuit 1n Fig, 2.22 r
Kbytes and 260 Kbytes respectively. ·nu~ unplem ents
•mallesl allocatl;,n J:e(joesl in Kbytes lhal
could be denied is lor
u Jj j
b. J81
e-- ' _,
....t t
(\, 231 f-+-Z
cL 541
A solution to the Dining Pltilosophcn:
Problem which avoids deadlock is:
a, ensure that all phllosopltcrs pick op u,~
a. ABC .-ABC 1-ABC
left thl before the right fork
b. A '" 'g ~c
b. ensure that all Jlhil(lsopllers pic.k11]' the
Light fork before the left fork e. A €9- B E!l C
c, \lnsure that one pnrlicnlar pltilosopher d. AB + BC +CA
picks up the left fork before the right 4S. Corll<i det Hto.> following stale table iii Fig.
ti>tk, ana that aiJ other plrilosl:>p}lers 2.23 Ior a sequeotialmacbin<' Titc number
pick up fue right fuk before il,te left of!Jtates in the miulmized machine will be
fork
d. none of the abO\<e -.....
'
• I

•••
...... c.'
A 0 ,1
45 !"our j obs lo be executed 0 11 a .;,.g~e
vrocessor SYsf"lll amve nl bJne 0+ in ULe • ~
order A. B, C, D. Their bum CPU time t
..'
--......
requirements are 4, I, 8, I time units
respectively, Tho completion time of A 0 A,' t, I
 7 nl It t
d. 81 61 52 14 41 ~)

e. 17 77 27M 11143
5J. A l.•gic ntl\W•rl. hu:; til'" Jalll mpul~ A and
d. B, uni.l t\\11 cQillnll mpul$ Cu tmd C1• ll
iu111lcn•ents the l'uucllL>11 F accuriling In Ibe
4') What IS the c4wvnlcnt hm1lctm c~'p!CSsi''" rollt"'~ng, Tllhle.
in pnXlLJot-ot'-swus l(>nn f.-r d1e Kamaugb
1Uup giveulu Fig. l1.J Cl Co r

CD
•• 00 01 00
0 0 A+B

00 I
"
I
0
I
I

0
A+B
A.B
01 I I I I All

II I I
lmplemenL thl: oircUJL u~mg llm: 4 to J
10 I I
Multiplexor, one .Z-mpnt f'xclU-<JVe OR
gale, o ne ~-inptll AND gate. one 2-mpul
OR gatr und one lnv~-rtcr
11. Bfi 1-BD
54. An 11052 l)w;ro system has 1n1 output p011
b ( li +C+ o)(ii+C -ri5) wi01 nddrc:.-s 001 L Cllnsidl"l' till! l'ul1111Ving.
asscmbly lnnsunge pm[U3nL
u. (8 •Dl(B•D)
ORO OIOUH
d. (B+li){B+D) MVl 1\, f!OFI

5(). A mi.,roprogrnm control unil i~ n••1nireJ to LXI H. OI05fl

1!'-'0~rule u \llllll or 25 cnntrl)l stgntlls. otJr OOJ-1
AsSi.lm.:- thllt t.!llririg an~ mlCTI'iMlnll>ti,m. INR A
ul mo~t twn «mtrnl ;igru.l~ urc nllhve.
PCifl
Mlniu1wn 11U1llbcr of bits rcqwrcd iu the
c~\nln>l wnnl tc> gcm:rutc d1c rcquirc"Cl Hl :r
c.,otrol ~ignuls will be (a) Whut dvrs the prcgrrun dl:l with l'eSJ>~l
U, 2 tQ the output p.;rt 001I''

b. 25 \1>) Sh<m Lhl: wovefvnns aLtltc Lbr(:C lea.•~

signili..:rull bits or the port 001-l
c. Ill
d. I~
ss A Jemand pusc'<l 1•imw I mcmmv :.-ystt.:m
LI<Cs 16 'btl virtual adJ~,,s, page si'?e or
51 Let f be" ruoct.itm defined by 156 nyte<, 11nd has I Kbyte or matLt
munl(l.ry LRU t>oge Npl~cemcnt is

I
x2 for (It ,; I)
mtplemcntetl llsing a list \\ltO$-' current
1{1<) %
2
.-x ~x~ for I < x s 2 stahL~ (page numbers irt Jcclmal) is
x+d for• > 2
I 17 I 6]'
VioLI 1l1c va lues lilr dJe constants a. h. c told 1'
d S.) lblJt f 1!< O()Jllffil l()US und diJlcn'I!UDbfo LRUpaac
ev~zywhere on the real line
F'('r ..n<>h hexadecimal adclres:; m the
52 A b1uary searcl1 tree 1s 11$cd to locate thl! uddros.' ;<:qucnce p:iveu bulml ,
tlUJJLbt:r 43. Wlllch of ilic lo llowwg prubu
sequences are possible. HJld wluch (Ire ool'l OOFF, OIOD, !OFF. llDO
E xplain. indicate,
lL 61 52 14 IJ 40 43 \i) ihe new stattL~ ,,rthe lis~
b 2 3 50 40 60 4J (ii) pug,e fiouhs, if WIY. wtd
o, 10(-..51 148374J tiii) p&gc repluclCmcrtts, if uny
 IJ ul JU

SI!CTION.a (50 Marks)

Answer an~ TEIIi queslions from this s<~etion.
AlllfUC5tio.ns ra rry ettu.al on or~.

o. Ohopluy the tmnsitmn din!:rnm for n

56 Ld P bi: the collt..ocuon of ~n fillwHons r
m~ehittc thar rccogni7..:s t,,la, uhlain«<
p, 2, 3}- 11. 1, Jl. Lfflllld!l E f, from the 1rnn~irinn dial)ram~ for [111 1
tldinc an ~quivuJcnl.., 1\!luuon by r-g •f
and only iflt3J g(3) nnd M, b) ndding. only & lrunsitions
and no ne\v states
(n) Fond the nounber of L'qlltvnlencc CW!IeS
(!di ned by b Modi:fY th<'" tr.rnsttion diagram obtained
m pan (n) to obmm a l:r'llmlllon
tbl Find lhc number or elcm~nts in cu~h dia&'l'run lilr n nmcbm~ Ulnl recogniZI!S
cquhalcncc clw;s (L 1L; )" by nddlllg <!Ill)' ~: tr.msttion>
57 Th~ f ioonncci S¢4JIICII~~ I r,, (i, r,, ' f, l and no new ~mtcs
ts defined by 1he followmg r«:urr~nctr IF 111111 SillieS urt cn~lttScd in dOuble
1.., =-!,,,- r,. •t~ t; t; =l. 1,~1 circl~l

PIO\e by inductiClfl lh:\1 ev~ry lhud ot Lot O lltt1• 4' 1. ("-bl . la,b, Ll , ii, 41 ,
elcnl<ltiltlf I foe Scqucnt:c ,, ~._,en Z, q) be a pu.•hdown oul<\mnlon accepting
by empty llltlck, for the langunge which is
58 Lei A = ['~• ull
"" ] and B =
tl,;b" b~
bu ] be [""
the SCI. of all noncmpty even palindromes
over the sc1 Ia. bl. Below tS an ineompkle
11\'u mulnc~ such Ihat AB - I Let t - A speet.tlcatoun of thtt rra.nsiuoo fum:.uon li.

l: ~] and CD = 1, ~xprcss rhe clement,

Complete Ill< ~pccttication; The top oJ'
>;lnck ~' ~um.:d II? be n1 lhc right end of
thestrillll rcpresenring SUlek contents,
ofD on 1enns 11rthe elementS orB.
59 l.et G be a rontext·free grammar where C1ll(•••••-'fl · lC···~JI
G""{IS.A.B.C!,(a,b,dl.I\S) with the czll(.,,,. .z) ·IC•t·n)I
~~:::::~: ~ ~.~~~ .
l
ptoduCIJOUS IU l' g1ven below.
S-+ AllAC c===:JJ
(5l&{'l].•,a) ~~(,~c)
/t. .H A lc
o .... bs l•
C-+ d l6Jii(cu.b,b) ~ ('U>·)
t6dt'l10les the null smngl Tronsfonn the me('l2,or,z) = (112,c)
!1fllmmar G to nn equi,alem come~,.free 62. A two dtmen.>ional nrroy Al l - nlll-f
grumnmrG ' that bns no c producuons and mlegers Is partially sorted tf
110 uni1 productions (A UIIIL proc.locllo!l tS
Vi , j E (1 .. a.- l) AliJiiJ < A(iiJh·l] 1M
of U1c ronn ~ } , 1C. und )I nrc 111111 Al11lil < .\(1+ liJ)
tcrnumliS)
F'ill m the blanks:
Gr.ven below ore the rrnnsnlon d1agmms
rt·rg. 12l tor 1wo finne stnh.• rnnchmes Mt (n.) The smallcs1 item in the nrra) is 111
:md M: I'CC{)gmsmg languages L1 nnd L: A[iJ[[Il where 1- I :lnd J-
respectiveI' Cl>) l'hc small <lSI Item i~ deleted, Complcw
the followmg (~nl procedure 10 1mert hem
. . .. x (wluch is gwtmJueed to be smaller tbnn
:tn) iletn tl1 Ill~ last tow or oolumnl Sltll
k~cptns A plll1•nlty soned.
 --....... - ....,.f.
( I}
(;I)
...
~,~: .....,,
,,. l;J •t~ • o;
*II ( @t I&~ I)._
lfK

'-ill
~J. k : ---:
&: 1111![1 •• N)ll{~:

i :- t;j,. N :
.... ......;
':1 ut 111

w""
ro
(<I)
(J)
~ .....
..
+ 1111 • Alii m .....
AIIJil ,. A(l +-IIJI; h= I + I
.....
1("&00
k ?(i+j)litl:
< x ... i := t
. , j ,. k

63
..
: .. =:=J
m Alllll.. o

h1scrt Ihe churnct.ns or U1e strin£ K It I' t!

s N y T J M IIllO • hash tub1c ut'slz., J0.
Us.: th~ bush tbnclilm
a :
..
llllil ("It) ~ •) II: (i >- j) ;
it(l(tl - • } . .
...W. ( \oiolah...,.)
...... (.,. io ... ia ......,. )

G7. Consider Ihe lotlowing prqgmm '" pseudo-

h(x -(ordtx) -ord ('<L'l· l)rn!ld tO pasco! syh~a,"' Wbnl is print•d hy 1he
and Iincur probin8- l<l resolve cotlishms. program if purumeler o in pmccdur• ICSJ I
(tl) Which fnsortions cause C()lliSilli1S'!
is passed as
(b) Display th~ llnall~:~sh !able. l ... . , . F' '
iL •... .,,. . z a

(1'1, 1\ cumplol~. undlreclod, weiglli<!u ~ph G _ ........ (lopa.~ ;

i.~ given on the vertcltsel]O. 1. · -- u-l )lor - .. r..r;
!11111!'1111•-;
au~ Jjxoo ' u . Draw il1e tuiuituUJU
spam1ing !Ill" nfG it'
!Ill!'--
..... ....,.
.. .. ...o .. ;

-·
(I I ....., ;
8. fbe weishl or the ooge IU. V) IS (11•\' l
, . - ( . , . . lt', o. lo) ;
b. tl1.: w~igbH1r1he oogd h1. ' ) Is 11 1 v
...... ,.,..,, ., •• It) ~
65. lei (I b.: tl1~ diriOCllOO. weighted graph
shown Nh>w in Fig. 17,

68. Consid~r the syntax-dm:<Jted. lWJ.ISiul•o"

whema (SDTS) shown below·
..... E~E+E
E-.E•E
E-+W
B-.(E)
/\n I.R·pnrscr cxccule~ the nctinns
We ""' inlen:sled in th<: ' short"l'l fl"lh# assocwli:d wi th l h~ prnducll<ltJs
rrom A tm mcdintely ofu>r u n::ducti~n by th"
u. Output lhe sequenc.e of vert.i<l<!s COffllSf!<'ntlmg pmduo1ion. Dmw the pttr.;c
idoOlilloo b)• tho Dij kl.1:rn •, algorithm lr<:o ond wrill> the trnnslation lCJr Jhc
Cor ~iugle SOU!'(,'e <hortesl f"llh \Vhon suntcncc
tl1e :ti!!_OriUilll Is st:artetl at !lodo A. (a rb)0 (1>tu). using U1e SDTS glvon sb<we.
b. Wri1o dl>wn Ihe 5>1qu»nce of vortioos ;,, 69. The concurrent pwgr:umuiJJl! cousu ucts
the shortest path !rom A 10 E. Jiu~uud joiu uro n.• belnw:
o, Whal Is lll\1 cvs1 i>f th~ shurte~ pulh fork "' tnl:,el> wluch c;r-.c•nles ocw Q

from 1\ I~> U7 prOC<!IS C:XCCIOlll!\ fron11he Sf"-'Cili0d Jubd

M. C<1n.'i!dcr the lolhm<ing pmgmm lhnl Join ·,•nriabl~t> which dcC"rumcnls lhe
ntre<ur•~ lu luc:<lle "" "lcm~nl x in"" tlll'n) specified •-ynchronisation vnrinblc (b) I I
aj I U$in~ bi llllf)' sc-J,..,h. A.ssumo N 1 and l~nniJ1u·les tbe proceRO< if''"'
ue\\ vulue
'I h~ Pl\'gruut is errott.:<Jllli. Undor whnt is not ().
oondllions docs Ute program fail'/
 Ill Ill Ill
Show thee prec~dence gruph for S I. S2, S3, foliowrng names ror the states
S-1 and ss nf the concurrent progrnm correspc)ndlng to the. values of lllp-
beiOIV, ilop~ M gi\'tn lxinw

-u,.-lA,.
H•:l
111•2

11
Ql Q:l QJ
0 0 0

0 0
-
..

a,
&.l:
,. "'
-
IJ
L2l

....
IS
1 s,
UJ

......
12

-
Ll , 73 GIVen thm 1he 101t<al suue ot the ctrcun ts
lAo
.... 1.:2 S4, ider)Uf~ ~~~set or suncs whrch ar;, not
rcnch;oblc.
7(1 A comllllter syst~tn u~ Lh~ Banker'~ 74 A hurd dtsk ~~ connected to h 50 M Hz.
Algorithm to di:tll with ll1!11tllocl;s i.tS processor rhrough a I)MA contr11ller
current smt~ is shown In th~ lllbil:s bdo\\, AS$urne that t)1e 1111hUI $eh>P ol' a DMA
where PO, I' I, 1'2 nre processes. nnd RO, trrulSfer llll.t:S lOll{! lock cycles for the

-
R I. R2 nre resource types pr•ocesS<Jr. llnd ussume U1at the -handling or
U1e llllerrupl nt DM.'\ oomplellott l'l!qUires
5110 dock cycles lor the processor file
u aJ a ao•• a ua11:1: bard d.tsk hns n transfer rnte of 2000
~f;!l ~~ 11 D
Kbyrcslsec and 111 cragc bloc~ sae
transflm-ed •s 4K bytes What fructriln of
nli..ij n~ the processor tnne ts consumed l>y tho
dis~. tf the disk ts ncuvcl) tmnsfemng
u Sho11 Lhul the system can b~ tn th is
stutl!
100% of the time''
h What lVIII thl: >)'SI~ dc'l Un a rC<JU~~t 75 A computer ~y~tern has 11 three level
hy process 1'0 rnr on~ 1111it hi' resottrc~ memory hierarchy, wilh ntcess bme and
type Rl'' hit muos as shown bel,mr

71 A lite syM~m With a onc·lcval directory

stnt~lun! •S tmplement~d on a dtS~ 1\'tth

.........,,................. ....,....
<Its~ hlc> ck Sll.o! ill' 4K bytes l'h~ LI IS~ L'

-
11~!.1 a~ li!IIUII s

-· -..----·
...........
~· ......,,:_ ,~
~
.............._w..-...........
a. Whnt !lhould be the nuniml,lm SIZes of
level I nod level ~ memories to
ochievl! an U\'crugc ~cccss time of less
1han I00 nsl'C'l
b Whni 1s the o1eragc access time
tl Wh\ll is lh~ ltl:lXIIIlUnl possible IIWII~ llcltJ~Vcd USUlg tho chosen S!Zl:S or
or ITic~"' luvcl 1 and lcv~l 2 mtm~ones?
b Whru; ts the mnxlmum posstbl~ tile ~•zc 76 A hl>rory telmlonl\1 dotnbak s~·stm1 u;~
rn blocks'' lh~ following schcmu
72 Consider dre synchronQus scquentlal USP.RS (Userll, UserNnm~:, HomeT!tiV11l
crrcunrn Fig. :!4.
1300KS LIJookll, 13ooltTitle. AulborNarnc)
I SliED{Bcuk/1. Usar#. Omel
Explam to one Engtish scn1eoce. what
ench of' the followrog relational algebra
queri~s ts destgned lo d~tennine.

n Dru11 p ~ILIU! diagrum whtch is ••l•\....,.,fi(1lt.a.tt,.-.."f!IIJtUEU,P41DOrb)H ~~~

itnplemcmetl b} th~ dreu11 U>U tho aJnAII~~~Mftl t~n~n:&l!U)IJ~