Total No. ofPages 3 Roll No, ..... .

SIXTH SEMESTER B.E. (COE)

END SEMESTER EXAMINATION MYlY-2009

COE-314 CONTROL ENGINE ERING
Time: 3 Hours Max. M arks : 70
Note:

I [a] Draw the signal flow graph and determine transfer function US1l1g
Mason's gain formula, for the block diagram shown in Fig.l. 6

FI §- I
, '

[b] A thermometer has a time constant of 15.33 sec. It is qu ick ly taken

from temperature O°C to water bath having temperature '100°C . Wha t
temperature will be indicated after 60 sec. ' 4
[c] Exp lain the effect of feedback on sensi tivity and over all gain of the
system. 4

2[a] Deduce the time response of a second order system subjected to unit
ramp input. 5
[b] A servo mechanism is represented by
y +4.8y =144E
where E = C - 0.54 is actuating signal. Find the value of damping
rat io, damped and undamped frequency oscillations. Draw the block
diagram of the system described by abo ve differenti al equations.
4
s(s + 2)
c . ( )
[c] A network runct ion H s = ( X 2
s +4 .I' + 6.1' + 18
)

Find h(t) using pole zero plot. 5

www.nsitonline.in
3[a] A unity feedback sys tem has open-loop transfer function
G(.,·)H(.I·)-- k (s + I) . Sketc I1 th e root Iocus p1ot WIt. h k as vana
. ble
S(.I· - I)
parameter. Mark all points on root locus. 5

[b] A feedb ack system has open loop tran sfer function
ke"
G(.I )H(s ) = ( 2 ) Determine by use of Routh criterion , the
s s +5,,+ 9
maximum value of k for the system to be stable. 4

[e] Expla in thc effect of Integral con troller on the performance of a second
order system subjected to unit step input. 5

4[a] The open loop transfer function of cert ain unity feedback syste m IS

G(.I')
. " 1(.'
=; 12(s + 3)
+ 16s .+ 256)
. co~stl'\l~.t
Bode-plot and comment upon

stability of the system . . - . 7

[b] The closed loop magnit ude vs frequency response of a second order
sys tem is' shown in Fig.2, find·damping ratio, peak time and percent age
peak overshoot. . 7
t ' /-Lj
M(jW)
0·9

o 3
F/§-.:l. W---7'
5[a] For a unity feedback control system the open loop transfer function
given by G(s)H(s ) = I ~((s + I)) , draw the Nyquist plot and determine
s s +4
whet her the clo sed loop system will be stab le. 7
[b] Design a suitable phase-lag comp ensating network for a unity feedback
k
ope n loop transfer fnncti on G(s)H( s)= ( X
) to meet the
s 1+0.1 s 1+0.2.1
follow ing specifications, velocity error coeffi cient = 30 sec-' and phas e
margin ;0,40 0 • 7

www.nsitonline.in
6[a] Derive a transfe r function of a system from the data given on Bode
If' diagram shown in Fig.3. 6
db -.to dh/eire.
30 - -- - - - . -,
.I

"" I

-1'-
- .1.\ - - - -
F / tj-3
20
[b] Sketch polar plot for G(s) =
S
( X ).
5+1 s+ 2
4

[c] For a given open loop transfer function

1
G(s)H(s) = - , determine gam rnargm and
s(1 + 0.5sXI + 0.05s)
phase margin. 4

7 Write short notes on any FOUR of the follow ing:

[a] M-N circle
[b] Servomotor
[c] Tuning of PID controller
[d] Lead-lag compensation
[e] Nichol chart
[fJ Nyquist stability criterion. 3.5x4

www.nsitonline.in
 Total No. of pages: 02 Roll No. _
SnCTtl
nfTn SEMESTER BE(COE)

END SEMESTER EXAMINATION, May 2009

COE 312 : DATABASE MANAGEMENT SYSTEM

Time: 3:IIrs Max. Marks: 70

Note: Attempt any FIVE question,

All Questions carry equal marks.
Assume suitable missing data, if any

Quesla. Design an ER model for keeping track of your favorite sports team. You should
store the matches played, the scores in each match, the players in each match
and individual player statistics for each match. Summary statistics should be
modeled as derived attributes. Illustrate composite and multivalued attributes
in the ER model. 8
b. How will you convert an ER model to relational model? Explain , 6

Ques2a. Consider the following relational schema

Hotel(Hotelno, name, city)

Room(roomno., hotelno, type, price)
Booking(hotc lno, guestno, date from, date_to, roomno)
Guest(guestno, guestname, address)

Answer the following queries in SQL and relational algebra:

I. List all the rooms that are currently unoccupied in hotel 'TAJ'.
2. What is the lost income from unoccupied room at hotel 'TAJ'
3. What is average number of bookings for each hotel in the month of
August.
4. Update the price of all rooms in the hotels in Delhi by 5%.
5. Write DOL statement to create the relation ' Booking' . 10

b. What are various quantifiers in relational calculus? Give examples. 4

Qucs3 a. What is meant by Weak entity? How is it related to strong entity? Explain.
4
b. Explain primary, super key and foreign key. Discuss their significance with
the help of suitable examples. 5
c. Why do we need views? Create a view, List problems with processing update
operations expressed in terms of views. 5

www.nsitonline.in
Ques4a . Describe the concept of full functional dependency with the help of
suitable examples. 4

b. Consider a relation R(A,B,C,D,E) with the followin g set of FDs:

A-7 BC
CD-7 E
B-7D
E-7 A
1. Find the candidate keys for R. 2
n. Show that decompo sition of R in Rl(A,B,C) and R2(A ,D,E) is a lossless
decomposition. 4
c. Is the above decomposition in BCNF. If yes, explain else get a BCNF
decomposition for R. 4

Ques5 a. What do you mean by Two phase Locking protoc ol. 5

b. Discuss the problems that can occur with lock based concurrency control
mechanisms and the actions that can be taken by DBMS to prevent them.
5
c. Define the prob lem of Dirty read and unrepeatable read . 4

Ques6 a. Explain various kinds offailures that can arise in the system , 4
b. Differen tiate between the immediate and deferred mode of log based recovery
techniques with the help of suitable examples. 6
c. How checkpoint mechanism works. 4

Ques7 a. Define serial, concurrent and serializable schedules. 4

b. Discuss RAID and its various levels. 5
c. How will database ensure the properties of atomicity and cons istency while
working with transactions? 5

Ques8 . Write short notes on any four of the followings

1. Deadlock handl ing

u. Data independence
111. Lossless join decomposition
iv. Aggregation
v. Triggers 14

www.nsitonline.in
Total No. of Pages 3 Roll No .
SIXTH SEMESTER B.E. (COE)

END SEMESTER EXAMINATION M5llY-2009

COE-313 OPERATING SYSTEM

Time: 3 Hours Max. Marks: 70
Note: Answer any FI\(E questions.
Assume suitable missin data, if an .

1[a] Show how the following problem does not satisfy the requ irements o f a
mechanism to contest acce ss to a critical section
Sh ared int tum = 1;
int myPid =0; II for process O. Set to 1 for process 111
int otherPid = l -m Pid .
while (tum! = myP id)
Do nothin
Ilcritical section
Itum = otherPid; I 7
[b] G iven process resource usage and availability as descri bed in following
ocation graPIh
ta bl e, d raw th e resource a llocati
Process Current allocation Outstanding Reauests Res ources Available
R, R, R] R, R, R) R1 R, R,
P, 2 0 0 1 1 0 .-
P, 3 1 0 0 0 0 0 0 0
P, 1 3 0 0 0 1
P4 0 1 1 0 1 0
7

2[a] On a simp le paged system, can the logical address spac e be sma ller
than the phy sical address space? Can it be larger? 4
[b] List out all the major differences between segmentation and paging.
3
[c] Why are page sizes always a power of 2? 3
[d] What advantage doe s segmentation offer over multiple variable
parti tion s? 4

www.nsitonline.in
3[a] Given reference s to the followin g pages by a program
0, 9, 0, 1, 8 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3,
how ma ny pag e faults will occur if the prog ram has three pag e fram es
ava ilable to it and uses:
(i) FIFO replaceme nt?
(ii) LRU rep lacem ent ?
(iii) Opt imal repl acem ent? 6
[b] The second-chance algo rithm rejects pages that have their re ference bit
set to I. What happens if all pages have the ir refe rence bit set to I .
4
[c] Expla in acce ss Matrix method related to file protection and security.
4
4[a] Which allo cation sche me would work best for a file syst em
implemented on a dev ice that can only be accessed sequent ially , a tape
drive, for instance. 4
[b] C lassify eac h of the follow ing as authentication, presentation,
detection. identification, o r correction.
(i) A log in program
(ii) Scanning for recently mod ified files in a system direct ory
(iii) Week ly bac kups
(iv) Logging all login s and layouts
(v) Promptly de leting unu sed accounts 5
[c] Suggest a scheme for implementing the current directory scheme
e fficiently . 5

5[a] For the processes listed in followin g table, what is the average
tumaround time (ro unding to the nearest hundredth) using:
(i) first-come First served
(ii) Shortest Job First
(ii) Shortest Rema ining Time
(iv) Round Robin (quantum =2)
(v) Roun d rob in (quantum = 1)
Process Arriva l time Processing Time
A 0.000 3
B 1.001 6
_C 4.001 4
0 6.00 1 2
10
[b] Is a non- premptive scheduling algo rithm a good choi ce for an
interactive system? Briefly explain, why? 4
www.nsitonline.in
6[a] Suppose the head of a moving-head disk with 200 track s, numbered 0
to 199, is currently serving a request at track 143 and has just finished
a request at track 125. If the queue of requests is kept in the FIFO
order;
86, 147,91, 177,94, 150, 102, 175, 130
What is the total head movement to satisfy these requests for the
following disk scheduli ng algorithms?
(i) FCF S (ii) SSTF (iii) SCAN
(iv) LOOK (v) C-SCAN 10
[b] ls disk scheduling other than FCFS useful III a single-use r
environment? 4

7[a] Consider the following snapshot of a syste m

Allocation Max Available
Po 0 0 1 2 0 0 1 2 5 2 0
Pl I O 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
PJ 0 6 3 2 0 6 5 2
p. 0 0 I 4 0 6 5 6
Answer the follow ing questions using the banker' s algorithm:
(i) What is the conte nt of the array Need?
(ii) Is the system in a safe state?
(iii) If a request from process PI arrives for (0,4,2,0) can the request
be immed iately grant ed? ? 10
[b] What are the difficulties that may arise when a process is rolled bac k as
the result of a deadlock? 4

8 Write short notes on any TWO of the follow ing:

[a] Interpro cess Com munication
[b) Semaph ores
[e] Process Scheduling
[d) Case study of Linux. 2x7

www.nsitonline.in
Total No. of Pages: 2 Roll Number: .
B.E . (C OE) 6 t h SEMESTER END SEMESTER EXAMINATION, MAY 2009
COE - 315:- ADVANCED COMPUTER ARCHITECTURE
TIME: 3 HOURS MAX. MARKS: 70

NOTE: Attempt any FIVE questions. All question carry equal marks.
Assume suitable missing data, if any, and specify it clearly.

Ouestion 1 [6+8]
(a) Parallelism may be exploited at diffe rent processing levels. Explain the ways of exploiting the
parallelism in these levels. Wh ich levels are best suited for SISD, SIMD , MIMD systems?

(b) Consider a dual-processor (PI and P2) system using direct-mapped write-back private caches and a
shared memory, all connected to a common bus. Each cache can have four blocks (0 ....3). The shared
memory is divided into eight blocks as 0, 1.. ..7. To maintain cache coheren ce, the system uses Snoopy
Protocol based on Write-Invalidate policy. Draw the relevant state diagram. Indicate the state of each
valid cache block and mark cache miss/hit in the block trace for each cycle for the following two
asynchronous sequences of mem ory-access events , where boldface numbers are for write and the
remaining are for read.
Processor PI: 0, Q, 0,1, 1,4,3, 5, ~
a,
Processor P2: 2, 0, 0, 1, 5 ,~, 7, 0

Question 2 [7+7]
(a) List all the data dependencies in the following code fragment. Indicat e whether these are loop carried or
not. Is the loop paralleli zable? Why or why not?
for ( i = 2 ; i < 100 ; i + I)
{ ali] = b[i] + a[i] ; ;* SI *;
c[i- I] = a ji] + d[i] ;;* S2 >';
a[i-I) = 2 * b[i]; ;* S3 *;
b[i+l] = 2 * b[i]; j* S4 *; }

(b) Draw 8 x 8 Omega network. Show, whether the permutation (0, 6, 4, 7, 3) (I, 5) (2) can be implemented
without blocking or not?

Question 3 [7+7]
(a) A non-pipelined processor X has a clock rate of 50 MHz and an average CPI of 4. Processor Y, an
improved successor of X, is designed with a five-stage linear instruction pipeline. However, due to
pipeline overheads, the clock rate of Y is only 45 MHz. If a program cont aining 1000 instructions is
executed on both processors, what is the speedup of processor Y compared with that of processor X?

(b) Consider the following code:

J NEZ RI n e x t ; i f RI != 0 - > n e xt (b I)
SET RI, 1 ; se t RI = 1
n e x t: SUB R2 ,RI ,1 ; s ubtr act 1 f rom RI
JNEZ R2 s omewhere; if R2 1= 0 - > somewhere (b 2)
(i) Suppose the value of Rl alternates between 2 and O. If we use I-bit of branch history and initially
predict nottaken, then find the number of mis-predictions over two passes?
(ii) What will be number of mis-predictions in the two passes if we use 2-bit correlating branch
predictor?

www.nsitonline.in
Question 4 [4+4+6]
(a) Explain in brief the branch speedup , branch elimination and branch prediction techniques for reducing
the branch hazards in pipelined processors.

(b) Show the recursive construction of a 16 x 16 Baseline Network.

(c) Consider the following reservation table for a static pipeline:

0 I 2 3 4 5
SI X X
S2 X X X
S3 X X
(i) Draw the state diagram.
(ii) Find the MAL. Is it optimal?
(iii)Is it possible to reduce MAL by adding delays? If so, explain by showing one case.

Question 5 [7+7]
(a) Show in detail the construction of a Decreasing Sorting Network based on Bitonic Sort algorithm for
sorting an unsorted list of8 elements: 3,4, 1,8,5,7,6,2.

(b) Use Software pipelining to improve the ILP for the following loop and show the restructured loop along
with prologue and epiiogue.(Don 't convert C statements into assembly language instructions)
for (k = 0; k < 100 ; k = k + 1)
{
x[k] = x[k] + 1 ;
y[k] = y[k] + x[k] ;
z[k] = y[k] + 2 ;
}

Question 6 [8+6]
(a) Characterize the following interconnection networks in terms of latency, bandwidth, cost, scalability and
systems where they are commonly used: (i) 2D-Torus (ii) Hypercube (iii) Illiac Mesh (iv) Tree

(b) Explain the loop skewing transformation and discuss how to apply this to make the following code
parallelizable: for i=2 to n-I do
for j=2 to m-I do
a[ij]={a[i-lj] + a[i+lj] a[ij-l] + a[i j +l]} /4;

Question 7 .. [4+5+5]
(a) Write a loop in C language which contains a branch that will be completely mis-predicted by a one-bit
branch predictor.

(b) Write short note on any TWO of the following:

(i) Consistency models
(ii) 8 x 8 Multi-stage Cube Network
(iii)PRAM algorithm for multiplication of two n x n matrices with n3 processors
(iv)Batcher's Odd Even Merge Sort for sorting 3, 4, 1,8,5, 7,6,2.
(v) Comparison of Store-and-forward routing with Wormhole routing
--·-------X----------X----------
www.nsitonline.in
 End Seme ste r Examination, May 2009
tl l
B .E. B Semester. EC/CoE/IC-311 ; Microproc essors

M axi m u m Marks : 70. Time: Thre e Hours . Assum e any missing d ata .
Que sti on n u m b er 1 is compulsory. Attempt any four othe r questions .

<) 1. (7 .'~ I I"l r k s )

(a ) D itl c rcm ia tc bet wee n ( i) th e ins tru ctio ns " RS T O'" au rl ".1 iVlI' 0 000'" a nd (ii ) the
acri ou o f ex ecut in g th e '"I II .r instru cti on am i 'Iss e rti llg th e " I IO j .I )" s igll a l.

(~. ) !\ ig hl ;l!k r a ll :-:l OX) xvst ciu is re set . the li rsl inst ructiou tha t is e xecuted at ad d re ss
0000 [ hcx I is " I' lls h 1\" . \Vh:rl a rc till' c""k "t s " r Ihe S lac k .u nl Ihe S lac k Poiu t.-r:
a lic r this inxtru cIio u is cxccurc d? .I l1 st il'y .\"llll r an swer.

(d) l rl lh: ln tcnup t Rcspo n«: l ime or a \\'s tCIll is tlclilll'd ;IS lhl.·l~ l ~l ]l~ n l tilllC between
till' uccurrc ncc ol ,01 iu tcrru p: signa l andex ecuti on or (he COITCSpoJldillg interrup t
<uh ro ut in c . then w ha t is Ih e ,,"ors t ra .'\t' ill lc r rt ' j)l resp on se l illi e Ill!" a ll :)()X)
:-; ~ ' S: Clll o pe rating \\-jlll ,I 1. 1\1 111. rrvx t.rl? i \ S S Il Il I\.' that :111 inle rru pl s a rc enabled
:lIld tluu non e or tlu: inrcrrupt s is mas ked.

(c) \Vl"i tc ;\ progralll sc g lllc...' lli wirl: l'.\ actly 2 iuxtru ct iun s th.uwo u ld \:;111 a subrout ine
at :\lIdl"\':-;:'; /\ !3 ( 'I ) {l l l''\ ) (l Il ly ilt h.: co nte nts or /\C ClI l ll U I; l l p !" arc les s tl1<1 11 0 1" Clltl :lI
10 .' 111he .' ).

( I) I.is! a ll the m .ich iuc Cyc les Iha l XliX) I1SCS. W hi ch is the I OIl ~e sl ma chi ne cycle".
!\S:-illIllC that the s ysle lll o pe rat e s w itho ut ;IIlY w a it s lales.

(,!:;) I .is t <I ll th e in xtruct io us n fXOX) 111;11 ca n he lIse d to rc.u l a nd \\T i l l ' dat a to Ill e llior y
Inill'l' e,! I/O I'0ns.

I.e (' .\ 't mark s)

l :l) I) \'" ig n the 11H..' 111o ry i ll l\'r!; ICl ' Illg ic to in te r face 3 2 K I~ }' k EI' I{ () i\'1 and
.L' k l : ,·\e S I {' \~ I I (' 'Ill XOX5 IC I is 17 l cX w h ic h is a Ih l, l\y le J-:I' I{O ~ I c h ip;
I( ':.: is ~ li s () 27 12(;, wh i!c I( '3 is (J22)(1. which is {l ~ 2 1< H y tc SI{ ;\ rvl chip. T ile
i ",J'I<O i\;! chi ps arc 11idP IK'd to cove r thl' lo-ver 11 <11 1' PI' l ite (J·l Kh y tc ;ldd ress
spac c w h ilv thc S l{ /\ ~I is m a pped 10 the I1pper I",JI'. 1\ lso . IC I Illaps al l even
ad d resses .uul 1( '2 Illa p' all odd addresses. i.c. add re sses DOOO. 000:'. 000·1.
()(IO(, c lc ma p 10 J( 'I a lld add resse s 000 I. {)llll.' . OO IiS etc ma p io I( '2.

(b ) For the q uc xiiou ill p;trl (;I), des ign the m cn ro rv in t,.. rl a c c s uch that the
I': I'R O M is 'llTcssed wi t]: 110 wa il s la lcs w h ile the S I(I\ M ,le CeSS includ cx one
wuit s ta te .

www.nsitonline.in
(~U , ( 2 .\ 7 ll1 a rk ~; )
(;1) l)r:l\v :! flo wchart ,llld .vri u - ;W"; S aS ~l' lll ! dy co de l'or a s uh ro utiuc to g Cllc ra te: l
Pu lse Width Mo dlll" kd <1'\\ ~ I ) s igll,,1Oil the SUI) pill, T he illpill para meter
10 the xuhrou unc is th vulu- o r lhe de sired dill y cvc lc ' I) ' , The valu e 01" 1) '
lies hl' I\\'LT Il 0 tn loon I .un l , .1ITc s po nds ' 0 all g hit va lue bet wee n (an d
ill cl ud ill t!- ) () to 25:', is . ..o uun uuicntcd 10 :hc sub rou tine hy the c tl l i llg p rog r~l l1l
thro ugh the Accu m u ln.or. T Ilt' XOX 5 sysh'lll runx a l I i\,1I 11. clock si gn:lI .uu l
des irl'd I'\\' ~ 1 lrcqucn ,' is 1"Il I I/..

(b) ' \ 11 I/() dev ice gCIH.:raks 10 I ~ ~ po s it ive Fliises that i s use d to int e rrup t all XOX5
IIsing RST 7,5 interrupt input pin , I) r",,' a llo wcha rt and write an ln tcrrup :
Sub rou tine ( ISI{ ) wh ic': tO l~rl c s the va lue o fa n o utput port Oil each in terrup t.
Th e por i addre ss is -I Ol he s ), I he rescl value at the outp ut o lI hc po ri is
OO( hcx ).

(" J :\ set or "n hvles is su .rcd i:: memory sl:\I'l ing::1 address 200 0( hes), The val ue
"I' ' 11 ' is s tore d "I :"Idress I l' l Tihes), I)r:;',\' " 11<1\\'e h" r1 and wr ite XOX 5
,,';se mh lv xuhro ur inc I" hc k d CI IKS I ) ~' F 10 cnlcul ntc th e checksum o ft hcxc
0

'11 bytes :.Jlld s tore the ' L' SUIt : 11 ! ll L' Il Hlry ;lddn.:ss I FF E{hex ), 'lh« ch ec ksum i ~
the l\\ Oo 's co mp leme nt ~ , I' Il 1t H :- 2 5 () sum ol't hc 'II ' hytL's,

(11) I":stil11 ;ltC' the del;ly illl'l n "cd 1,_ the ' (' I I K~;lJr\'r subrout ine 11IL' l1 tiolled ill part
( <I ) . ~ lS;\ Iun ction nl'tl11' ,, ',d ll' : . •r ' I1'. The ;'; ()})S syst em o pe rates ;112 ivll L .
\., o! o( k.

() S. ( :~ x "7 m. rrkx)
(:1) !'o:-;p !;I!1l the mod e 1 Op t." o;l1 iOil or X25S w i. ' : the tim illg d iag ra ms lill" the
1 :;II ~dsh a ke signa ls ;lS \'..,11 as ! : ~ l' coruro! ' gll;ds lIsed hv bo th the inpu: roor l
I : llhk and o utput port 1! ' :H,k.

<h i l.x plai» Ihe uunsm iucr :"-cli,,, o r lhe X2 :, I IJSi\ I{T ch ip, incl ud ing Ihl'
n:P~\' 1ll contro l si t:I1:Jl s. ,,\"ilb:' Il ea l block di agr;IIl L 1':.\Jl la ill the P(lI' PU ~l' oft!lL'
mi hk a nd couuuand ill~~ ;o l1elill ll byres ill ;l';Yl1 chn lllllus format.

(a) I: \ piai n I he Iun ct ion :lIh: purpose "I' ( l(' \ \' : , OC \V 2 "n d 1)(' \V -' li ll Ihe X25 'i
I' !e: ch ip,
( h ) \\'rile il1i ti;l1 i / ;ll i oll rout ine Iorthc X251) PI( ' confi gure d :l s an I/( ) po rt \vi ;ll
base ad d ress I:O(he ,). 10 sci it up lu r opc r.u ion wu h the li, II" lI'ing
s:l\.' L' i li r <l l i o li s: XOX 5 xvs tc m , Il nrll1al l ':() 1 11l : ~d c, non-bu ffere d en vironm ent .un!
1':,,11\' :~l'sll'd ~ I o de , ( :,,11 :"Id ress ini c rval «. he ,I h vtcs. A II IR pins except 11{2
arc ma sked. Asxum c i h.u Ihe e,,11 "dd ress Ii,,. IRO is OI'-IO( h",),

1)7, ( 2 , -; Illarks)

\\' r i ! ~' xln ut not ex Oil ;IllY 1\\, (1 tn pi t·s :

_ I " n 'll' lwd 1/ 0 po rt ill s lav e II I\ Hk ,

( il) ~ ~ 5 "/ 1),\·1,\ l'lllllrnlkr \,:tl lll l ! ~ IIIT{ a s a 1l 11.:11l0l ) I . .
(h ) ~Q 5 3 lllll ~ ks o f Opl: r;llio llo
(e) X ~7q l,c yho: ln l and I) isp l:J .' c Oll t r o l ler.
( d) X:!5·' o p e l'a l i \l ll il l ll Hllk :~o
www.nsitonline.in