'-. ' llll111.-J1 .

,1,·h) I tlfPlllll Ill N1 1

\ 11 I) IT R \ 1 I.~ \ ~ II \ \ I I O \

ll. lTC tl PR<)(; R,\\l\t F :-- t l '\l> E tl l ltr , \ F(;(~ 0 1• l S I< I )

PJ per C'ode: C IC-.305 S ubj rct: O pc•rntin g Systr ms

T t
i Hou rs;\tu\ ;\l a rks: J O
,me: l

inin g.
"
0
te: .\ ttempt Q. ~ o. I, " hich is compulsory and two more questi ons from th e rema

Q. 1 (2 marks each)

(a)Wh.ll are Re..11-Time S) stems. and " hy ;.}ft! they critical in certain applications? [CO I ]
( b)\\ hat resources art'•~ pically managed by an operating system?
[CO I]

(c) \\'hat is the difference bet" een paging and segmentntion? [CO l ]

(<l)E,pb in three requirements that a solution to critical-s ection problem must satisfy. [CO2J
[CO2]
(e)Desc ribe shon - term, medium -term and \ong-tern1 schedule r.
Q .~ t:1)Expl:iin PCB. Oro.\\' the block diagram of process transitio n states. [CO2](.5 marks)
three
(b)Consider the page reference string: 1.0,7.1.0.2. l,2,3,0.3,2,-l,0,3,6,2. l fo r a memory wi th
ent
frames Determine the number of page faults using the FIFO. Optimal, and LRU replacem
algorithms. \\'bich algorithm is most eflicient ? (5 marks) [CO I]

Q .3(a)Exp lain the difference between External fragmentation and Internal fragmentation.
I]
Explain Paging and hov..· to solve the fragme ntation problem using paging. (5 marks) [CO
(b)\\'ha t is the Dining Philosophers Problem. and outline a solution using semapho res.
(5 marks) [CO2 I

()Al a)Calcu late a\·erage waiti ng and turnaround times by drawing the Gantt
chart using FC r S,
p,._•l.'mpt i\·e SJF ru1d RR (q=2ms). (5 marks) [CO2 !

Process Arrival Time(ms) Burst Timc(ms)

Pl .,
..,
5
P2 5 8
P3 1 7
P-l 2 6
I

(b)h,pl ain Batch. t-.,. fultiprogrammin g, and Time-Sharing Operating Systems. List their
aJ, ;.mtages and di s:id \ antages as well. (5 marks) [CO J]
 =t U. 3

'
( Plea se write your E nrolrnc N . • ("\f'IC) \ I ?_ ) ()
.
11 1 o. 11nmcdtutcly) Lnro lrncnt No. ~ ~

Mto TE RM EXAM INATION

PRO GRA l\ l ME S (U i''-H}Ell T II E AF.G IS
OF US ICT)
B,T Ecu
S' Sc-m cstcr, Octo ber, 202~
h

Pap er Cod e: CIC -303 Subj ect: Com piler Design

Tim e: I½ Hrs . Max . Mn r ks: 30
. .
Not e: Atte mpt Q N o. 1 wl11. ch 1.s com p ulsory nnd any two mor e ques tio ns from rcm:u111ng.
- ·

Max. CO(s}
Q.N o. Question
Mar ks
tipass Com piler . 2 I
1 (a) and Mul
Differen tiate between Single Pass Compiler ble 2
')

(b) I Exp lain the tenn s Tok en, Pattern and Lexeme with the help of suita
example. ·2
Where it is used? 2
(c) What is meant by Handle & Handle Pruning? 2 2
in context to lexical analyser.
{d) Exp lain the sign ificance of Input Buffering l & 2 2
LALR is most powerfu
(e} Which of the parser among SLR, CLR and
why? 2
abb + a•b•. Convert it into 5
2 (a) Des ign NFA for regular expressio n a+
equi valent minimum state DFA. 5 I
for the expression a=b* c+d.
{b) Explain the phase-wise working of compiler .., 2
ire to eliminate it? Eliminate
.)

3 (a) What is Left Recursion ? Why do we requ

n belo w-
lefl 1ecu rsio n from the gram mar give
S-. Aa I b
A-. Ac I Sd IE
2 2
(b) What is an Operato r Grammar? 5 2
C heck by usin g Pred ictiv e Parsing table whether the given gram mar is
(c) ~

LL( l) or n9t
S-+ iCtS S' I a
S'-+ cs IE
C-+ b 6 2
table for the following gram mar
4 (a) Constru ct LR( 0) Parsing
S-+ L=R
S-+ R
L-+ *R
L-+ id
R-+ L
y Non -Ter min als in the 4 2
Wri te the Lea d ing and Trai ling tenn inals of ever
(b)
gram mar
E - E+T IE- TIT
T-+ T*F IT/FI F I I
F - (E) I id
( Pka, l' ' Hill' ~our Enro llment no Iii .
. ir11ctli ntch ) Enrollm"nt 1\11.Q~\\ ~C).1;-:.J .~
l\ IID-TERl\1EX ,►\lVll NAT ION
B.TE.Cll. PRO(; R \ \l:\l E:.s (l''.'1>£R 1'11 E AEG IS OF\ S IC I')

l-1 Fl ll Scrn\''ltcr. Oc10hcr, 2024

Papc-r Code: llS-30 1 Subject: Economics for £n~incl'r,
Time: l hour 30 min. i\lll:\ Marl<<;: JO

'\oll': Attempt Q. :'\o. l \\ hich i, com11ulso t o ,nore nuc!.lions from rcmuining.

n and ,111\ " ·•
Q. :'\ o. Question ------ - ----- - MaZ-- CO(s)
marks
2 1
l(a) \\'hat do vou understand b , ucon • ·>
'" omn:s. --
2 l
Hb) I F.valuatc thl' factor resource constraint in economics.
l (c) I Apph· the production possibility curve to anv economic problem. 2 l
l (d ) , \Yhat do vou undl'rstand bY Consuml'r equilibrium? 2 2
I (e) E, aluatc how budget comtraints affect the choice of the consumer. 2 2
_ 2-"-
(a--')'---_..,.....:E:.:.,, ·alu::ite the factors affrcting the drmand and supplv in detail. 5 1
2(b) Analyze thl' l:lastidty of demand ancl supply concepts for cross-price 5 I
SCl'narios.
I 3(a) \ Explain thl' Rq~rcs!>ion Techniq ue in detail 5 2
3(b) I Analya lndiffercn cl' Curn anal~ sis for the given data. How docs this 5 2
:111aly!>is help thl' consumer achil'YC thl' same level of satisfaction?

Combinatio n

I
Manqo es O ranqes
A 1 14
B 2 g
C 3 6
D 4 4
E 5 2.5
4(a) Apply a ll the concepts of the " T heory of Consumer Choice" to a real- 5 2
life problem.
Prob lem: You have SIOO to spend on food for the month. You have a
wide variety of options, but some will provide y ou with hig h e r
opportunity costs tha n others. You could purchase enough bread, rice,
milk, and eggs to feed yourself for the full month or you could buy
prl'mium-cut steak and store-prepared dinners.

(Student s can assume the data as much as he/she need)

In answer, students have to provide, an indilTercncc curve an.,lysis and
budget constrai nts.

➔(b) E xplain thl' concl'pt of the Demand sick :.\l\d supply side of the market 5 1
in details.
------
Plc,lsc W, itc v >111• I
.; ' ·nrolrncnt No. ln11ncclitttcl
•
Y.......................... .

, . Mid lerm Examination (Oct-2024)

Snh1c<.•t· ('
· ompufrr Network
Suhjcct Code: C IC-307
Time: l.]Olf r
Mux. M:u·ks: 30

NotL·: l\ttrnipt '1lm.:L· <)111.:stio 11 . ·I . . . .

rm: llding ()ui.:Slion I which is Cnmpulo;ol').

()1.

ll) l·xpl,iin PPP cn 111 • ,,· I

,. lee 1011 r wscs ,rnh the help 111' s11,1c J>i,,grum. (2marh) l(O II
h) I xp I,1111 the ,, ,. , - .
\\' • I 1c-. ll 1 1lltflh!:i 111 I fl )I ( pro1111; 11 1, (1 111:irks) ico 2 I
C) 1
hat ts 1 111 L' \lol1111111d Sloltcd ,\loh ,,, (2 nwrks) I('<> 21
d) \\ I . . '.
lal is i-.ingk rnrnk· rind n1111l1-11111dL· lilm.:'/ (1 111:irk'i) !('O I j

t.)2

,I ) 1 _xpl,iin I hL· Iunction ut I\ l,\C · l-,llh-1.,) L'r. 11l,11 L'Xplu111 the ,Hh ,mlal!t:.., and
or (
d,,,,d\'llllllll.!l'S '011k11t11111 free & ( lllllcntinn h.1,cd medium ilCC\.''iSCd ~,r.,L(' •ic
(5m11rk'iJj((J II
h l I h-.· c, en p.1rrt) h:u11mi11g l'11dc tr,111s111i1tcJ l'i 11 IOU 110 I ,111<1 the rc1.:ch cd t.odc ,.,
l llll!OI IOI lklL' L' I 111111 n 1rrL·,·1 the L'rrt•r IJ.,ni th,· n.·cch..:c.l c<>dc. (5 mur~,;) If fJ l \

()"\ .

u) \\'hat i~ 1 lmv con tr,11') I '\pla111 \\ith di.,gram th,: com:cpl ol J,,m.igcd or l0,1 lrt111\L.' in
( i0-1\:\CK-N AR<.}. (5 m ,rks> ten ~I
h) I f a pl·riodic siµ1111l j-, Ul'COIUpo-.~·J in lo th e -.i nc \\ ,l\...:~ \ llh 11\'(lllCl\dt::. ,r mo. ,oo.
500, 700. uml 'JOO 111. \\ 1h11 1, the h.111lh\iJ1h'? Or,1w the ,p.:clrum. u,-...umrn 6 .,lt
component-. ha, c n ma,imum amphtuJL or IO,. \,;; n .,rks) ll l) 2 \

<)•t ( ·0111p11r..: the J'olhl\\ ing ( •\fl) I Olli)· (~5 mark:-, 4)

a) Ci,rnit S" itd iinµ anJ Pad:l'l s,,

itd1ing. ll'O l I
h) I ('('/ IJ> mrnkl and OS I ~lodd. lt'O I~
l") ( it1id1.:tl Media uml l lnguidLd t\kdia ICO I\
dJ Jokcnl\u-.a11d l11~ l'1t R111g . IC'O 21
~) II.I.I · 81l2. 1aml 111·1· 80:.11. 1cn ~ I
 (Ple.1,t ""nit} our f nrolmrnf ""· 1n1111r,II .id , I

,\ l1 n I r lf\l E\\\lf ' , r 10 ,

B .l 1c11Pl{oc,R ,,,1'1l..,(l \1111< \l<.hrn I "> l< I )
1 111
\ th .._.,mr,lcr, () "•ht-r. Zul I

l'•fl( r < flt.le· CI( -3 11

~ote : Attempt Q. '\ o. I "hich i, compuho~ :rn(l 3n) l\\h mort qut,t1on, fr 11n rr1 u 11 ,111.

Q. '\ o. al
,1.., ( 0 ,,
, , .. rt.,
a.
b.
- Defi ne _(.reed1 •\_Q_proach. Aho \Jen lion it, propatie, 2.~ < O!
\ \ hat 1s ll a m1ltonian C)cle Prohlem? Llplain \,i1h thl· hdp of .in 2.:, ( ()~
nam ple.
c.
Comp are Merge \O r i and Quic"~ort w.r.110 their ri me comple \lly :i nd 2.5 CO i
• space complex it\ .
d.
• ~ h e r e ~nce relation T (l!,)=2"1(n-lJ O(_n} 2.5 COi
2- - - ;
a. ll ow Str as'ien 's Algorithm u~e~ di \ idc and conquer to reduce the rime 5 ( OJ
I com p_'exit\ of mn tri~ m ultiplica1ion?
Consider 5-cha racte r le'<t fi le \, it h frcquenc) of occurr ence oul of 100 5 C.O.!
characte r~ as m ent ioned a =SO¾, u-5°/0 , c= 10%, d =J2¾ . c 3°'o
Design lluffman code fo r th is. Aho calcuJ:u c t he percentage o f ~pace
I
_ savings in co m parison to fixed length ~

ra. - i ::--=---- -------

Define vario us a symptotic notations with the hel p of gr aph :rnd 5 (. () I
mathematical fun ctio n.
I b. Find Single Source shortest path for the~ing graph using Dijk stra's 5 CO2
Algorithm.

a. Define variou~ o perati on!> o n d bjoi nt ,,ets di~join t ,eh. llO\\ 1he lim e lO\
co mple x ity o f operat ion, o n lfojoint set~ ca n be n·d uccd u <,i ng
h e uris tics.
h. L.bt the pro blem , in \\ h ich ha cl-t ra r l-ing can be a pplied. ~oh c n ( 0"!
cp1ce n proble m u ~in g ha cl- lrac l-ing.
 ..... ....
Roll No ...................................
, imm ediately)
(Please wr ite you r roll No

24
Mid Term Examination, Sep 20
ing
Su bject: Softw are En gin eer 30
th
MM:
Sem est er: 5
Pa pe r Co de: CIC-309
Tim e: 1.5 Hr s

res t. _ _ _ _ _ _.
. Attem pt any two more questions from the
No te: Q. No I is Compulsory

(2x 5= 10)

W rite brie fly: CO l

QI . teri stics .
Des cribe its var iou s cha rac CO l
a) Wh at is sof twa re Eng ine erin g?
b) De fine the term mo dul arit y. CO2
are Requir em ent An alys is. CO l
c) Dis cus s the imp ort anc e of So ftw
d) Wh at is dat a dic tion ary ? Exp lain . C0 1
esion and Co upl ing ?
e) Wh at is the diff ere nce bet we en Coh , 7
CO 2
ess ary to
re. Explain why it ma y be nec
Q2 . a) De fine Softwa re arc hite ctu mpare
bef ore the spe cifi cat ions . Co
des ign the sys tem arch itec ture
-or ien ted design s. CO2 3
function orie nted and obj ect .
te bet we en fun ctio nal and non -functional req uire me nts
b) Dif fere ntia 5
CO 2
r inte rfac e? Exp lain use r inte rfa ce des ign ste ps . C O2 5
Wh at is the nee d of use t
Q3 a)
an by the ten ns coh esio n and cou pling in the con tex
b) Wh at do you me l in arr ivin g at a
w are these con cep ts use fu
of sof twa re eng ine erin g? Ho
lain with exa mp le.
goo d des ign of a sys tem exp 5
CO l
tric s? Ho w fun ct ion poi nt me tric is adv ant age ous
Q4 a) Wh at are the s ize me
CO l 5
ove r LO C me tric ?
not e on the foll ow ing :
b) Wr ite Sho rt
i) FA ST
ii) QF D