$,a C5

Examination. D€c.2014lJan.201 5Enireprenueurship

i0At,5l

Fifth Semester B.E. DegreeManagement &

\ot.: Artt'et FIVE fill qt*tions, alectinAal l.att rtro queslions fro,, qch pa,t.

1:

za

,i

?.

Z

!. Cive example loreach ol re Mna8erial tunclions.nd erplain dre sameb 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=-Er 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.alleAibihrystudyd Economic feasibiliry srdt

Lirt the characledslics oi mall scalc indusr_v (SSl) Md exnlain thc nccd lor SSl in thcecofomyofa coLutry. 0o!L*nwhalarclhe 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 (r0\tr r)

t0ts5l

Fitrh Scmcstcr B.E. Degree Exrmination,Software Engineering

sotc. Ahs d FlvE Jitlt llaatiors, ylettitsut lust TWO qrestioas Jto,' ath paf,

z,

;;:n

,1

i=

aa

5:

,

z

!AEI=Ia. whalisrsoiwareprcc.$nrodellExpldinlhell9esofsoftNrrepilcessnrodels (06]I! nb Erplaiilhekcy.hallcngeslacinesolirvrreenginceing (06 \hr!,c. with a ncar bloct diagnnl erplain rhs sy$ems sCin.enngrtuce$ &tirilies (03\Irik,

x. wirh a ncrr blockdiasam, erph dE spnal pLocess modei. O8\Irrk,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 orsonwrre strccilicalionaclivities. (0611110

a. fortic ser olrxshs shoRn belowJrarv thc pmjsctschedullngusnE,

iii) SEliallocalion rcaus rims chanA\su,nlnF slan dale olproiecl as 0I Nor20l4

3

TTr

5

T

ir. Dr.rv asiaie nla.hine nodel ola snnple hido\uve o!en.. Dra$ asequence diasnn lorwirhdrasii! money [106 ATM

a Wrir lhe IEEE lbmxr o f rnring SRSb. 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,

\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.\ "

Fifth Semester B.E. Degree Ef,amination,

System Software

l0cs52

Itec.2O1 4fi ^n.2O15

Nnte: A,swer FIyEfr qn.srio,s, eledinaat 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

BUFFEREOFZEROTHRE!LENCTHTOTAL LENCTHRDRTC

M\E\4()NtCS:JSUB=AO. LDA=80.COMP = 90, RSUB =,1C.

lirr the LlloNi.g SICTXE proeram.

.]SUB RDRECLDA IE\GTHCOMP ZEROJLQ ExtT.l clooP

IOA THREESTA TOTAI LENGTHRSUBRESw 100

BYTE C'EOF'

RESW ]RES\I ILDX ZERO

LDX =60. STA= 50..,EQ=80, I = Bri

a. what isa herall Diferentiate literak io m nnncd iate dxtab 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 loaderc Erplai. briefly the de\iln onttuns olloades

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 designoprionc. 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.IFSETEND]F

CLEARIFLDCIi

ENDIFII+LDTELSE+LDTIND]ITDJEQRDSTCHTLXRJLTsTxMEND

&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, .e\p.esirc1c. Explain brieny bx and yacc inredction.d. Discuss connicrs in )a.c.

10cs53

'/s,:-' - r,:\,'i't/ - .2;

Fifth Scmester B.E. Degree Ex.mination, Dec.201:l/JaD.20l5Operating Systems

z

i

:i

=1a,!

=iia

315

.:

i..---a

?.4

Nott Answa FIVE lu q"estiohs, *t ctinqalleast 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.leslrrvo 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 andwnh 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 L\cir relative

10cs53

Consider a systen con6 ins m Esources olrhe sanc rjre beug lhared by n r&ccscsResouces.an be requested and rldased by prccesses only one a rme Show tnar rhcsynen is deadlock liee iflhe lollo{ins rwo condirions hold :

i) Themaxifrun nccd oleach pmce$ is beNeen I andn resoutuesiil Tb! srm ol all muimurn needs h le$ thu in+ n.

b. ror lhe gilen snapshol :

c0 l 2

0l 5

tr 0 l :P. 0 l

c0

L

l

cl 5

x. Whal isIo.xht_vofftferen e? Differenliale benken paei'C and segneDrarionb. 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 (r0i\lirt,

a. wh arerhedificrcnrrcchniquessirh$hichafile.anbesharedamoncuse6) 06Nrrrtttb. 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 inaneffi.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. 64d J eld lJ d -,,1 10o.31, r arc \e'uabe'o n..e ...

b whar m a.c.$ fradces? Explain its inrp le mentations. D ifiirenli are be rween pro tec rion mdsecunty.

a Explain the dilIersl IPc mcchannm available in Linuxb. liplain how psccs is nmagcd on Linux plallbm.c, wnre abnefnole on the desi$ pinciples ollnrux.

sith head lnniall! ar lm.k 50FCIS, SST!'. Elclaior aid C

l0CS5,lIJSN

Fifth Semester B.E. Degree trxamination! Dec.2014/Jan.20r5Database Management System

\nte: An\wtary t tvEJttt|u?:tio \..d?.ti'19 ortvan tnorrtu(rio . lro"t.arh Nn,

i2

1.

2,!t

:!

1?

n=

!4!L_4a Explanrdrc typica 1 c omponens moduleofa DBMS. $irh a .eat diaeiamb. 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 adareofrccelptasNcllasanexpeciedshipdat 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[ considercdinpota ) ios M,rktDhcns 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 li) Rcrieve rhenameandpercentagcof allstudmE aorrhecouse l0cS54ii) L'stthe Dcparhcilshavingdalcraecsalaiyolthe hcul.ies abore Rs 10.000.iii)Lisnameolthe.od*ehNinj:*udentsJ:radeA'maxinrun 1t0i\rsrk,

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

the diffneni consrninh rhar .an

10cs54

be applied duing table cEatlon in SQL, r,irh.n(03Mr ,

b writcthc SQL qneryforthe lolloqirs Darabase Schemaworks (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 . Ba. Explain lhc syrtax of SELECT stdemenl ii SQL. (0{Mr.ktb 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 holdanrong 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 nomalizeBook*tle Autb_naft Book tt?e Ltu Pice lAffiliarion Publicari.nFDs are J Book.ittle +Boottype. Publication

Aurn name- AfiiliationBook tlpe + Lht Pice ).

which nombl forh is based on the concept olmuhi value tu.dional depe.denc)r Lxplairthe sanre with example (t0r{,rktCiven relation R with 4 attibutcs R = (A. B, C. D),nd r,.llowine l_Ds. ldentily tlccxndidatc licys lir R a.dhiehcsr nomal lbml, C-D,c-A,B -c ii) B -c.DrA (l)l\hrk,

write shon notes on the folbwnrsa. TNo phae lo.kingFntocol.b. Transacrion suppoa in SQL.c Tine samp ordering a lgoriihins.

:

!ri3a=l

?.4

e=ta

1e

3:

USN

Fifth Semest€r B.E. Degree Examination,Computer Networks

r l,,th ! flo{ diagn4 crplarn rhe *orknrs ofCSMdCDb. 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. (r0rlrrktc \\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 Al\tuet th! FItaE futt qwniozs, seleains4tleost TwO qtestioas flo each Dart.

a. Explaiirfolb E modulati.n techniques:i) AnDlirld.nodulationii) Frequencynodulario,.

A multiplcxcr..tubines fou t00kbF ch,nnch usins a time slot of2 bfts. Sho* rhe ourptrrwnh fou arbitrary inpuls. whar n dr tane rarel wlrar is nre name durarion? whar G thc6itate? \!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 exBmpleb. hpLainthcsrrucMeofencoderanddecoderforaHxmmig.odec. 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 sneii) 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.

t1.*/..,,*Jg\{:ilHl:, rocsss

\*i% wha, do yoi mtu b) rid.reD tud exposd shmb pobrms in [LEE 802.1 pm.o@r.

reJ\De

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 &nemetin) Polins

', ,%t:

'+a,'qo^

t/,el\

oy

^

tI*

'4. (,$;

,9"'7^

-s$'. ^\J

o.a-

(o-

..dtt*'

Je

s-

,i"ffi r0css6

a

:.

a.

3:

Fifth Semester B.E. DegreeFormal Languages

PART.ADclin.lhe followiDg Nilh proFcr cxamplcsli) 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, bln) Setofall $ri.es su.h that dtr,nberorl's neyenand lhe numberolot na

roi:= 10.11Design 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,Aniztst 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 JhrltPlrre that if L = L(-{) lor sorne DFA A rh.n due is a Egular expEssion R sucb dr.rL= l (R).Obtinr rhe rcgular expE$ion ibr the followins DFA nsi.p $are ehilm Dn Ecbniqur:

..k.r

L := l4bi showrhdl.mmr ior equ rr hnAurges

'h.l,nckee l=Lw€: n r"r.n, ' rl

FiCQI(J)

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 iruo\ing

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*TlTTrI TiFF,(E)i0ilwite lhe leftnosl derivation. rishtno$ doivaion and pa6c tree ftr.0 (l r0)-0) .

Show that the liJlloqrnsgBDrluh anbiclotrs:S+SbS

-l,i' PART- BDesen 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 PDAfor lne followins languase:

B+clbcrcDEl€D + AlBlab

(05 i"rts)a DPDA along Bith tmnsition diagra'n

(07 rr3rktI = {"'t' .> o}.

r0cs55

srABla

o. Shoq rhit nre lansuagc L= lx€ 10, l)*]

i) Eliminatee-pmductions.ii) Eliminate an y unil ptu ductions iniii) ElimiDate any useles symbols inDeliie Chomsky Nomal Fom (C\I). 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.lroneso\rr 10, I I

t. Writc the ransirion diagram for rne cdtutrocled Tuinc mlchine and wite thecqlfl .eollDr ror 1 D . r.nC'll]Ol'Explain nLLitape Turins machhe and non-detcminisic Tu .g d&hiies qidl nelt blockdiagranN, (mMrrk,

\! te shon notes on rhe follol,ins topics:a. Applicarions ofn.neautomta intert seaich6 lnherentanbigunyolconrs\rneellnguages.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