This document contains questions for a Database Management Systems exam. It asks students to: 1) Explain the typical components of a DBMS with a neat diagram and define various database concepts like value set, complex attribute, data model, etc. with examples. 2) Model an order management scenario as an entity-relationship diagram showing the relationships between customers, orders, employees, and parts. 3) Discuss entity integrity and referential integrity constraints and why each is important for a DBMS. 4) Discuss various types of join operations in a DBMS and why inner join is required.

1. $,a C5
Examination. D€c.2014lJan.201 5
Enireprenueurship
i0At,5l
Fifth Semester B.E. Degree
Management &
ot.: Artt'et FIVE fill qt*tions, alectinA
al l.att rtro queslions fro,, qch pa,t.
1:
za
,i
?.
Z
!. Cive example loreach ol re Mna8erial tunclions.nd erplain dre same
b ElpLain y6!e principlcs olinmasement as lormulated by FuyoL.
a Lisrand explainlhe sreps in plxnning.
b Listay filc qres olphns and explxi. cach brieuy.
(l0Ihlt{,
(l0NI!rk,
lo notilare his subordi..Esl
(r0Nsr(t
0 whltisspar olconrolandNharlicroBafiicrifl Explain.
b Explain rccruilin.nl and sel{tion. WhalhMBOmdMBE?
b L$tHygiencc rnd morivalion aactos as per Hede€and explaindeirimplications.
(loNar,
a Hou does Maslory s henarchy ol iccds help a frmager
8Atsf=-E
r Lisr rhe $rges olcnrcpeneurprcces and expalin anr one ollhem.
b lisr fie ch,mctnnics ofeentepreneurand expluin an' one olrhem.
a. Marlet reaslbilily srud]
b Finmcial feasibililr- *udy.
c Techni.alleAibihrystudy
d Economic feasibiliry srdt
Lirt the characledslics oi mall scalc indusr_v (SSl) Md exnlain thc nccd lor SSl in thc
ecofomyofa coLutry. 0o!L*n
whalarclhe neps invohed instdin.cSSl? Exphin one olihen. 1r0[tr{,
ri! sonE nale level asencies which suppon SSI and erplain onc olrhcm as b ho$ nEy
,$isltlEssh. lronr*,
Whara,elheschenesolllnanceprolidedbySIDBI!Erplainon.olrhes.hems (r0tr r)

2. t0ts5l
Fitrh Scmcstcr B.E. Degree Exrmination,
Software Engineering
sotc. Ahs d FlvE Jitlt llaatiors, ylettits
ut lust TWO qrestioas Jto,' ath paf,
z
,
;;
:n
,1
i=
aa
5:
,
z
!AEI=I
a. whalisrsoiwareprcc.$nrodellExpldinlhell9esofsoftNrrepilcessnrodels (06]I! n
b Erplaiilhekcy.hallcngeslacinesolirvrreenginceing (06 hr!,
c. with a ncar bloct diagnnl erplain rhs sy$ems sCin.enngrtuce$ &tirilies (03Irik,
x. wirh a ncrr blockdiasam, erph dE spnal pLocess modei. O8Irrk,
b. Dennc depe.dabilily Also exphnr bnefly lhe lourpincipl. dimensions ofdependabiliry.
(06 hik,
c. widr appropriate block diagram exphnr biefly the Fquircment enginee.ins prccess or
sonwrre strccilicalionaclivities. (0611110
a. fortic ser olrxshs shoRn belowJrarv thc pmjsctschedullngusnE,
iii) SEliallocalion rcaus rims chan
Asu,nlnF slan dale olproiecl as 0I Nor20l4
3
T
Tr
5
T
ir. Dr.rv asiaie nla.hine nodel ola snnple hidouve o!en.
. Dra$ asequence diasnn lorwirhdrasii! money [106 ATM
a Wrir lhe IEEE lbmxr o f rnring SRS
b. Di fierenl ialc b cs..een
i) User.cquireme.sand sy$eniequnenEnls.
ii) Funcrional tquirenens and rDn-tunclional requimmena
c. Explain b.eflytherechniqu.sofr.quirenrefsdncoyery.
Lstlhe ystem nDctuins $trles Md cxplain rhe reposilory lrod
wilh a neal blockdiasam, explain
i) call Relum conroltuodel,
ii) Bmadcar ..nrol nodel
(06Muk,
the objecl orienred deonposnion lir irloicc pscesing
. (06 Mrrlt,
(05 )rr*,
(0svr{,
(0s:llrl,
(0ssri*9
(r0Mrrk,

3. 99
+ Wilh apprQd.te block diagram explain brictly exlme pbgEmmins
win appbpriaie block diagsn, expt.ir lte syr&m evolution prcce$-
Explain bnefly tE $ftwe inspecdon peess,
10n51
'Y,% with a ,eat block diagm explain nhe v{ilication and validanm p!@"o {V--o@
i{ ,r*;t
Perfom th€ path lestirs ftr the Iollowins pD8ru now gnph by conDuling Crllotoalic
:i;'
*,t
CaDaiilit natunly nodel,.
.::':J
Iig. Q7 G)
@
Ji
+
r. "

4. Fifth Semester B.E. Degree Ef,amination,
System Software
l0cs52
Itec.2O1 4fi
^n.2O15
Nnte: A,swer FIyEfr qn.srio,s, eledina
at least TtrO questio s fro"1.tch pa .
2
i.
2a
,.
:i
9!
'i?
a DistiDsuishbetweensy$enrsoft$are andapplicationsoltware.
b Explain SIC/XE a.chitectue.
c wrire a SIOXE progmin to cop.v anxy A of 100 words ro anay B ofs0mc sirc.
d. What n upward .ompatible? How is it cnsured beNem SIC and SIC,XEI
a.LxplainbriellytlleSICassetublerdnectires*nhexamples (06y!rk,
b what n rek,carion?lllustEtehowa nodlncationEcod is used iDrelocationolprosmm.
(0r hr!,
c. GeneErc them.hine c.des
BUFFER
EOF
ZERO
THRE!
LENCTH
TOTAL LENCTH
RDRTC
ME4()NtCS:
JSUB=AO. LDA=80.
COMP = 90, RSUB =,1C.
lirr the LlloNi.g SICTXE proeram.
.]SUB RDREC
LDA IEGTH
COMP ZERO
JLQ ExtT
.l clooP
IOA THREE
STA TOTAI LENGTH
RSUB
RESw 100
BYTE C'EOF'
RESW ]
RESI I
LDX ZERO
LDX =60. STA= 50.
.,EQ=80, I = Bri
a. what isa herall Diferentiate literak io m nnncd iate dxta
b Explairthe fo llo* i.e mac hnre indepcndeni leatuicsolSlC asscmbl$:
i) SF$ol defining srotenrents
. ExFlain rhc Nodesigrolrionsol one pa$ass.mbler
a. $tite the algorithm ofabsoh e loader.
6. Wrftc tbc alrorilhm.flinkine loader
c Erplai. briefly the deiln onttuns olloades

5. 1ocs52
a List ihe basic tasks ofa text ednor.
b, wnh a neat diagrai, explain the rcxr editor slrucre.
c. List lhe user interfaces for editon with an example for cach.
d. WIat e lhe debugging tu nctio ns and capa bi I it ies?
a. Cile the featuB ofMACROPROCESSORS and explair the data $rucrues
b. lxplain the generalpuryose macroprcceson designoprion
c. For the & lloiving mcro definition. expand the mafo call statetuents called in
i) RDBUFFFI. BUIJA, RLEN, 04, IO24
ii) RDBUFI F2- BUIB. RLNC.
RDBUIF MACRO
SLOOP
&INDEV.
IF
SET
END]F
CLEAR
IF
LDCIi
ENDIF
II
+LDT
ELSE
+LDT
IND]I
TD
JEQ
RD
STCH
TLXR
JLT
sTx
MEND
&BUIANR, &RICLTH, &EOR, &MAXLTH
(&EORNE )
I
x
(&!oRcREQr)
=x'&EoR'
(&MAXTTH EQ' ')
$LOOP
=x &INDEV'
T
$LOOP
a. LEt $y ten rcgular cxpession ir lex.
b. Distinxuhh be.veen LIXER and HandNdtten lexer.
c. writc lex progran to conrpute word. character and lnre counl in a gilen fi te.
a. Explain tne for@r ofyacc p.ogram.
b w_ire ler y,cc orogrrm'o rI04re .imple a1l re, .ep.esirc1
c. Explain brieny bx and yacc inredction.
d. Discuss connicrs in )a.c.

6. 10cs53
'/s,:-' - r,:
,'i't/ - .2;
Fifth Scmester B.E. Degree Ex.mination, Dec.201:l/JaD.20l5
Operating Systems
z
i
:i
=1
a,!
=iia
315
.:
i..-
--a
?.4
Nott Answa FIVE lu q"estiohs, *t ctinq
alleast TWO tlk4tiors fton.n.h pad.
PART A
be lrv..n nu hip ogratunin g and tu u ltip roce$ins.
llrious nNions oI opcmliDs sy$ch u1lh respecl
diireEnt ways in $hich lhe Pthread lemin.lesl
rrvo lacrliher pmyrded lor implenentinc irleracring
n lherleveL,Dd kem.l l.!el ihr.xds
IolloNing is rhe lUrshol ola cpu
Dn$ Cann clans dd calculatc thc sanine and
wnh dnle quantun l0 scheduling alson$ms.
Explain diffeEnt s.hedullnE crileria thot must
Erplain cntical sectiotr problem. wnat
Explr Reader's wnre$ lroblenl o.d
$hd dft :noniiors? Coinpare with
arc rhe requiienenh thrt cnt.xl
povid. a sehaplDre solulion usins
scmrphores wid Lcir relative

7. 10cs53
Consider a systen con6 ins m Esources olrhe sanc rjre beug lhared by n r&ccscs
Resouces.an be requested and rldased by prccesses only one a rme Show tnar rhc
synen is deadlock liee iflhe lollo{ins rwo condirions hold :
i) Themaxifrun nccd oleach pmce$ is beNeen I andn resoutues
iil Tb! srm ol all muimurn needs h le$ thu in+ n.
b. ror lhe gilen snapshol :
c
0 l 2
0
l 5
tr 0 l :
P. 0 l
c
0
L
l
c
l 5
x. Whal isIo.xht_vofftferen e? Differenliale benken paei'C and segneDrarion
b. E xpl ain rh e di fler.n.es between
Using Bmkeis rlgon$m :
il wn is Jhe treed nri;r ..nrent'
ii) lslhesyslem in slfe st e?
iii) IraEquen nom pdes P2(0.4- 2,0)rrilem, can ir be smnred?
i) Losical md physical addre$ space
ii) Intemal and exEmal liasDcnlarion (0srhrk,
c. For fic l..llowlng tagc relcrmcc.xlcul.ic rhe taee Ii,ults lhat occurnsing FIFO and LRll
lor I and t page lrafies respecrively,5.,1.1.2.1.4,1,5..1.3,2,1.5 (r0ilirt,
a. wh arerhedificrcnrrcchniquessirh$hichafile.anbesharedamoncuse6) 06Nrrrttt
b. Given oenrorypartitions of100 k.500 k,200 k.600 k iin odci). which algondrn 6om be
fit.wo r nt and first 6l places pro.e$es wilh Equiremens 212 k.417 k.llz k and,126 k in
aneffi.ienlnanne.l O6Nrirkt
c. Explain the various sonse mechannm available ro store files. $ithneal diasraDr 03 Nhrkt
a. Give. lhe aollowiq queue 9i. 180. 14, I 19, l l. 121, 62. 64
d J eld lJ d -,,1 10o.31, r arc e'uabe'o n..e ...
b whar m a.c.$ fradces? Explain its inrp le mentation
s. D ifiirenli are be rween pro tec rion mdsecunty.
a Explain the dilIersl IPc mcchannm available in Linux
b. liplain how psccs is nmagcd on Linux plallbm.
c, wnre abnefnole on the desi$ pinciples ollnrux.
sith head lnniall! ar lm.k 50
FCIS, SST!'. Elclaior aid C

8. l0CS5,lIJSN
Fifth Semester B.E. Degree trxamination! Dec.2014/Jan.20r5
Database Management System
nte: Anwtary t tvEJttt|u?:tio ..d?.ti'19 ortvan tnorrtu(rio . lro"t.arh Nn,
i2
1.
2,
!t
:!
1?
n=
!4!L_4
a Explanrdrc typica 1 c omponens moduleofa DBMS. $irh a .eat diaeiam
b. Definclhe lollowingsith examples :
i) value ser ii) Complex a ribute iii) Dda modd iv)
i!) Each order pllced by acu$onerlaken by an cmploree and is eive. a mique order
.umber Each ordqcontains specified quantnies olone oi more parls. Each order has a
dareofrccelptasNcllasanexpeciedshipdat Theactualshlpdateisah.recoded
v) Each customer can phcs numbcr oloidns & each oider pl&ed by one custoder only.
vi) Each Employee can take any number ofordeN bur ea.l orderbelonEs to only oDe
vr) Eacb part placed by nnnrber olcNrone6 a.d each cusromn c& plae ordei tbr nun${
viii)Wrn. x$unrp r ions tuade. (r0 r,rro
Discuss dre entity lnt.glny and rerarentlal inresrity conslrainh Why is e.c[ considercd
inpota ) ios M,rkt
Dhcns rhe ranous t}!es ofJOIN .perarions. why is Thera Join Equned? (05 [hrk,
SITdent (USN, NAME. BRANCH, }ERCE!"TACE)
Facully (FID, INAM E, DEPT, DESIGNAT ION. SAIARY )
Couse (CID. CNAVE, FID)
E.nnl(CtD. USN, GMDE)
6ivetac re lati. n d lgebE expressio n lor the followins l
i) Rcrieve rhenameandpercentagcof allstudmE aorrhecouse l0cS54
ii) L'stthe Dcparhcilshavingdalcraecsalaiyolthe hcul.ies abore Rs 10.000.
iii)Lisnameolthe.od*ehNinj:*udentsJ:radeA'maxinrun 1t0irsrk,
a wh3r are srrucru8l co.$ranrts on arelation t}Ie? lxplainvith exanples. (05M,rk,
b. whni n aqeak entnytwe? hxplaiirthe rcle ofparti,l ket in d".,r.
"t" ""0 ".,,,1;fni;.*,,
c Desisnan ER diagram lor tle tuail order Dltabase consideringthe follo$ing requnemerts
HeE cmployee Iakes oder for rans lionr custoner.
i) Thc tuail odercompany has cmployccs each identified by d unique employee lD. first
anrl lasr nane. AddEs, GeDder, zipcode.
li) Erchcuslomerortheconpany is idenrified by a uique cu$oDer lD. tu$and lastname,
Addre$, location & Zlp code.
,ii) Each parl sold by the conpany js idmliiledby a unique part number, part nahe. pice

9. the diffneni consrninh rhar .an
10cs54
be applied duing table cEatlon in SQL, r,irh.n
(03Mr ,
b writcthc SQL qneryforthe lolloqirs Darabase Schema
works (Piame, cilme. salary)
Livs (PnanE, StEl Cny)
Lomied in (Cname. City)
Managei (Pnanre, Mgnane)
i) Findtbenamesolallperso.s sho live hthe ciry Bangahe'
ii) Retrievethe namesolallperson ol 'lnlosyi- whose salaryis beNeer Rs 50,000and
iii) rindtbenamesolallpersonswho livesandForkirsamccitr.
ir) Lisr ihenaheso|rhepeoplcwhoxork foi 'Ie.h M alongwnh rhecities diey lle r.
v) Find rheaveEgc salaryof'lntbsys"Fesons (lzNrrrk,
PART . B
a. Explain lhc syrtax of SELECT stdemenl ii SQL. (0{Mr.kt
b Howis liew created and droppcd? wharproblems are a$oc8ted wirh uDdatinallevs?
c. Explan the folbwnre i) Embedded SQL iiJ DJrabrse no edpm.edure
wnat is a tunctional dependency and yho speciffes ihc tunaioml dependency that hold
anrong the atrnbures ofa relation schetoa? (05M{r,
Consider R = lA, B, C, D, E.Il. FDS ar 1,A - BC. C
- E. CD
- EFl.
ShowtharAD-F (o5Nrrkt
c. Find rhe ket a.d nomalize
Book*tle Autb_naft Book tt?e Ltu Pice lAffiliarion Publicari.n
FDs are J Book.ittle +Boottype. Publication
Aurn name- Afiiliation
Book tlpe + Lht Pice ).
which nombl forh is based on the concept olmuhi value tu.dional depe.denc)r Lxplair
the sanre with example (t0r{,rkt
Civen relation R with 4 attibutcs R = (A. B, C. D),nd r,.llowine l_Ds. ldentily tlc
cxndidatc licys lir R a.dhiehcsr nomal lbml
, C-D,c-A,B -c ii) B -c.DrA (l)lhrk,
write shon notes on the folbwnrs
a. TNo phae lo.kingFntocol.
b. Transacrion suppoa in SQL.
c Tine samp ordering a lgoriihins.

10. :
!ri
3a
=l
?.4
e=
ta
1e
3:
USN
Fifth Semest€r B.E. Degree Examination,
Computer Networks
r l,,th ! flo{ diagn4 crplarn rhe *orknrs ofCSMdCD
b. Erplai. the tollonins chaurclization rcchniques: i) TDMA
tof2
,4das5s
Dec.20l4lJan.20l5
-t
PART_A
a. what dethc componenE ol dah .omuni.ation ystcm? Explam rD briei (05NLrk,
b. Nith. neai dilgratu- exp la in the intenction be$ecn layets inthe OSI model. (r0rlrrkt
c h0t isrhe differcncebdween aphysicaland loeical address? Explain {ith example
(05rrirkt
a. D islns uish betwe en Lo$ pasc[aDnelandabandpaschamel. (06 rrlrk,
h. A rcNrork wirh bandwidth oa lo'lbps.an Fass only an areEge of18,000 names per ninute
ritb each ftame canying aD a€nge o110,000 bits wlat is lhe lhiolehFut oathn netvdrk?
(0allrkn
c Compa.e and connas bemeen PCM and D'L (06!Irrk,
d. lxplain polar biphase Manchesle! and differential Manchener encoding schemes wirh
example. (01^brk,
Noret Altuet th! FItaE futt qwniozs, seleains
4tleost TwO qtestioas flo each Dart.
a. Explaiirfolb E modulati.n techniques:
i) AnDlirld.nodulation
ii) Frequencynodulario,.
A multiplcxcr..tubines fou t00kbF ch,nnch usins a time slot of2 bfts. Sho* rhe ourptrr
wnh fou arbitrary inpuls. whar n dr tane rarel wlrar is nre name durarion? whar G thc
6itate? !har is dre bit durationl (ormrrk,
,llh elevanr diagrams. cxplain the dala lraBfer phase in a ritualcrcuit neNork.
(l0Nr.rk,
3456. 0 x ABCC,
a. Explain CRC eftordete.tnin method *ith an exBmple
b. hpLainthcsrrucMeofencoderanddecoderforaHxmmig.ode
c. what is intemet checksunl lf a s.nder needs ro send rour darB neN 0 x
0 x 02BC and0 x EIEE, answer the 6llo*ine:
i) Flnddt checksumat sendcr sne
ii) F,nd the cbecksum at reccivcfs sne ilihere n no cmr
PART. B
5 a. Explanr CO-BACK-N ARQ ,nd selectrve{epealARQ. Lnt lhe diferc..cs bcrsccn iheft.
00}brl.,
b Eaplainthe dilGr.r namc tiDes inHDLC. (06 y,rtt
c. trne a shot note on piggybacki.g. ( !,rl,
iD a D,r c.

11. t1.*/..,,*Jg
{:ilHl:,
rocsss
*i% wha, do yoi mtu b) rid.reD tud exposd shmb pobrms in [LEE 802.1 pm.o@r.
reJD
e
E4lainindetoil (o6Mrik)
b, With nat diag6o, qplain the ehitectui. ofPicoftr and Scattemet Btueroodl aetworks.
(06 Mrrkr)
/C o. Er"lain fie wo*in8 ofglobal systeh Io. mobile (csM) in d€toil (03 Mrr.)
ildXu. e"puio nv" teaao iotur witn B flrffion beadeu. .Or#r.,'/,6. $;Eshonnotefofollow,s ^.0,", i) Tolen pasing I.",
"O Gisabit &nemet
in) Polins
',
,%t:
'+a,
'qo^
t/,
el
oy
^
tI*
'4. (,
$;
,9" '7^
-s$'.
^J
o.a-
(o-
..dtt*'
Je
s-

12. ,i"ffir0css6
a
:.
a.
3:
Fifth Semester B.E. Degree
Formal Languages
PART.A
Dclin.lhe followiDg Nilh proFcr cxamplcsl
i) Alphabel ii) Po$.safai alphabet,
Design the DFA'S lorthc Lll.rving laigur!.s:
i) Sct of all $rirgs rvnh ar lcdt onc a ald exerl, two br on : = k, bl
n) Setofall $ri.es su.h that dtr,nberorl's neyenand lhe numberolot na
roi:= 10.11
Design an NFA *ith.o mor than i $aks for the aoliowing language:
L=l"b"b.l">olu{,1" .>o}
Pm€ nmt l D = (Qo. !.0r, lqtl. ID) is r]t DFA.onnnrcrcd
^_
=iQ.:. d, qo, F) brlhe subser co$truction. then L(D):r(N).
and Automata Theory
Nore. A$wd onf t'It/E lull .luesnots, sele.li,A
niztst 1-WO qu.in,, from each pan,
{p}
{q}
1rj
lrl
Examination, Dec.20I4/Jan.20l5
NFA lnro Jn eqr rhnrDFA:
Ddfi.e resular expresioD and als. Nritc thc regul.r expre$ios for tbe ibllo$iDg languages:
r) r=l$E la.bla w has exadlrorepanolcoDsecuriveat).
li) Serofall strinls norcndile in 6$ing rb ovd:= la.bi (06 Jhrlt
Plrre that if L = L(-{) lor sorne DFA A rh.n due is a Egular expEssion R sucb dr.r
L= l (R).
Obtinr rhe rcgular expE$ion ibr the followins DFA nsi.p $are ehilm Dn Ecbniqur:
..k.r
L := l4bi showrhd
l.mmr ior equ rr hnAurges
'h.l,nckee
l=Lw€: n r"r.n, ' rl
FiCQI(J)

13. l0css6
trit;
Considslhe DFA siven hvthet'fiiiio. rrhl.'
d
i) D6v the lable ofdistinguishabihies lbrthn aulomaron.
ii) Consiruci lne minimun slate eluilaleni DFA.
iii) write the language accepred by the DIA. (03 nern,
a. De6ne-p Context-Iree Gram (CFC) md also obtoin thc CFG for the iruoing
n L =la ru"b'fvet0tt md n22t
il L:=ld"b"c'lm+n=k aidm.i>l]
ii,) L, =lwE{aflwmod3+ wnod2}.
Consider lhe CFG ivllh produclions
E+E*TlT
TrI TiF
F,(E)i0il
wite lhe leftnosl derivation. rishtno$ doivaion and pa6c tree ftr
.0 (l r0)-0) .
Show that the liJlloqrnsgBDrluh anbiclotrs:
S+SbS
-l,i' PART- B
Desen a PDA Ior the lollosins tung,ug., r-={nn'"..1u01+
rmsirion dia8Em for tho con$ructed PDA. write the inslert.neons dcsc
convert the f.llowins cFc lo a PDA thai acceph lhe same languge b], e
E+ E * EIE *Ei(E) r
r)ra Iblro Ir a b
Denne a deleministic PDA
for lne followins languase:
B+clb
crcDEl€
D + AlBlab
(05 i"rts)
a DPDA along Bith tmnsition diagra'n
(07 rr3rktI = {"'t' .> o}.

14. r0cs55
srABla
o. Shoq rhit nre lansuagc L= lx€ 10, l)*]
i) Eliminatee-pmductions.
ii) Eliminate an y unil ptu ductions in
iii) ElimiDate any useles symbols in
Deliie Chomsky Nomal Fom (CI). Also, !on!eri rhe fo low'ngCFC to CNfl
(06 Nlirk)
i a perfecr squm ) is nor codext-n@.
(06MrkE
DenDe a Turi.! maohine. Also. desgn a Turnrs nachine to accept the set ofall palin.lrones
orr 10, I I
t. Writc the ransirion diagram for rne cdtutrocled Tuinc mlchine and wite the
cqlfl .eollDr ror 1 D . r.nC'll]Ol'
Explain nLLitape Turins machhe and non-detcminisic Tu .g d&hiies qidl nelt block
diagranN, (mMrrk,
! te shon notes on rhe follol,ins topics:
a. Applicarions ofn.neautomta intert seaich
6 lnherentanbigunyolconrsrneellnguages.
c. Po* conespondence problem.
d. Recursn e hneuase and it s relarionship witt R! and noFRE languages.
;;^}
f&,i^.Ffl)
tithe rcsultins srammar. "iq$Er:':'
I ol.l