F s<yn .

rv (csG, -1:#%f,ll$' :,Tiiiii;,

[Time: Three Hours]

N.B: l
2.
3.
4.

Q.l 05
a) Evaluate [, logz dz
\\.,
05
b) Find the eigen values o

c)
05

d) 05

06

06

08
i) If X is a nornal variate with mean l0 and standard deviation 4, find
_ DP(lx -J4l<1) ,
ii) P (5< x < l8) , iii) P(x< 12)

Page 1of3

24I 6878F2EFCEAFF7Dl I IF48CB62 1877

 Sevn . rv (c c-onr'fr+ir,fl
.<E
a)
Be ) S-Iv
Q.3 Find the expectation of number of failuresEe-ceidini
-
lLr
of
or rnoependent
independent trials
tnals with probabilities p,@{bf
wtth constant probatiiities p.,& qirlsriccgss qndlaiige.le*idi$b'. -.-.
rhr
\
--" :;---'-.'
-. ..-'. \'5)'
"
b) Using
vrtuts ouuPrcx
lt^*;*:-^
Simplex rueInOO solvethefollowingt,t.p.".li:."--,'
Method SOIVe
z r^ *xz+xt
the tollowng Lif.P _.--..1_ .:_.,
-" ' ..:^'. ._- -''-
a_..
..':'-,'-:.:
...:_.:'.j
- > -.- :
: _- -:-. ,--.
. -';. rt
,.-1' ll;
Maximise Z:70xt ' .- -'i' - h.r

lrL
c)
' ' z(241)(z-r\
Withio the unit circle about
,
'. - i ..
'. .
r-
I

!i) theorigin. . " .. ..

T-t
(ii) . with in the annulusrre!il'",i!t*;eftrOtt";;;,

(iii)
rd(llr r ano z lespecltvely. :.. ..:
tn the exterior of tlie,gircle\wi*i centie at the origip and rad-iusl2.
L'--
.i
.' '. .- .
4trt
Q.4 a)
.. : , : .
n
rti
06

b)

{r,

4)O Using Cauchy's residue theorem. 06

:'
!,^:-
T.ucke..p6n,Aitioo to solve the following N.L.p.p
:, '8irti0ir-xr'?-xl 08
.,.'''.

:.i.''

'i'. .

Page 2 of3 .:. '

2A I6A7BF2 EFCEAFFTD I I IF48CB62I E77 ':'(
 ...i 'i.. ... - .. 1"...''.. , -,
' \'.J l.. :-;."r '_',:.
s,- ;- i";4i-j'
u aesi{e ''1i..'^f;)l*:'
- 5v (c ees) co rn e*l* 3.[--s$$,.s'ui :'{!$te5 -si$i[ii..
;;#gi*,,n"nu'**or"""'J;:$t&t-${;.}!Rt-
Tb ftb*ing rabte gives the number olaccrdents.q q'tT{lujr"F e.*i:ii:i;' i:,J :.. : igF*:!
j,-t*f .' .' . : I ,

t cile'ts arc uniformly distributed o*t "::.* ,.r1:r:j';'-:r:; ".

..,.
i 'iiiq)^1 . -, , ,L.;,, , '.u.;.
h. r*, w",ill, "
,Ih;','ttl,-t:t;\':;;'-r
,",}];r..'\'.,- ,ii, ':1'g4 t;"" .' :
sun, Mon. ":":ii.' : )
lirofaccidents: 13 r) !
.': . ' ,t. -ttt.* ' -t';-; .1i=*"; . ..
"**""""r'".,:l#3;T#Tl:T;1,iil':,'1;i'*";+o;iin1{310-1'"'ou
r;=:go F_'"tl?,* _, .:. - :,-:{ ''**i,
'- i ''' . i
J l];:t *"-",,.,,11 uil-u'*iioi"t'*no
!v (As,srme poptr",i"lftds-ii*al).'.' ."
' t ' "''"' :, , . .:'l ',. t'
th. populatiolril$s\fim:ti .'..-a
(e.orm" the
.. _ ."',. , :,a.
r.,. o,
""";",,fr.rotio*.in;r.r}.
g tlsing Pena y (Biq MJ *d9d.1,.1irrll,.1
I
.

ffi;'?':;ri$fil
to 3x =3 '
,

.
r,,:i lrr.;,.,:..-,r,:.,. :,.:.,,
Srbject ' 3xr-ixu .

4xr+3l2
.:. X}+2XIS-3 J,6 , r:,,-.'. .l , l
'. j'
xlI"za2'+ ?i.r'':- - i: .'_
'.rir.xiZo' '.'. i.,. . :.

,"ll
'.r.i.
',,*i-' ...
...-,,.'..i.;:f,,11".1".
)'
.

il -, . ."1'' '
' ,:- l
- ."9 ',_'.:\ "i"r:',:.'
,r.:.r,
' '.-;
t''.'...t'
i$ ,, pase3or3

2A168?BF2EFCEAFFTDI I 1F48CB621E7'
 \
S<rn ^.Tv ( ccses; Co nrg.{err Q.P. Code i

[Time: Three Hours]

S t..-t - CO A
.-r' .:l.: ' .

Please check whether you have got the right question paper. . . .',''..r... . .'
N.B: l.t. vusslrurr no rI rr
Question rru compulsory.
is r/uurPurrurJ. li, .,. .... ..t . ..
,:..rr''...'
.,.'. . .. .. -.'r...','..:.;,'
, .. .

2. Attempt any three questions liom remaining five questions.

3. Assume suitable dan if required
4'Drawneatdiagramwherevernecessarj":::..;:.....:.:.l.,',....l::

1,1

ow to identily sign ofexponent?

-':-;.'
D. What is virtual
v rr !u4r memory?
r! rrrvr J
II , :: ir" '.. ':. ,..1',.' i,l

TLB? ' : .,-.;,i. ' ' l

E. What is -r,.-,,, ..1. : ':rl

Q] Algorittim fo! two's.iompie

II) Using Booth's a,lgoiilhp

B. Describe hard:witbc 10

Q3 10

10

Q{ ing techniques

10

CL5

10

o6
problem 10

I
I
t
I OF2OBDB8E25O2FEO6692B79F2DFD2F48
l
'r
S .E' c comP) <sft Y CASCT3 Reu - 1-.)lL
ol) m ?uiev
Duration: 3 Hours

N.B.: (l) Question No. 1 is compulsory.

C4raptU c,f QP CODE: 24607
'I'otal Marks assigned: 80
0
(2) Attempt any three of remaining live questions.
(3) Assume any suitablc dala if necessary and justill, the same.

l. (a) What is antialiasing? Explain any one method ofantialiasing. [05]

(b) Define shearing and give exarnple. [05]
(c) Derive the translormation matrix for fixed point scaling. [05]
(d) Explain inside outside test used in filling algorithn. [0s]

(a) Explain the midpoint circle gen€.ation algorithm. I l0]

(b) Discuss all the steps r.:sed in refiection ofrn ohject about an arbitrary line Ii0]
with an example.

3. (a) Explain the Cohen-Sutherland line clipping algorithm lvith suitable example. t l0l
(b) Explain any one polygon clipping algorithm. I l0l

4, (a) Define window, viewport and derive window to viewpon transformation. ll0l
(b) Discuss parallel and perspective pmjeotions, Ir0]

5, (a) Discuss Bezier curve witlr il.s prope ics. !01

(b) Explain Couraud and Phong shading alo0g with their aLlvantages and I t0]
d isad v ar r tages

6. Write a shon note on any two ofthe following t20l

(a) i-D rcnreseoration melhods.
(b) Area Subdivision method
(c) FLactals.

n4Rrr5p5nlt a060raqF7? 1R{16?aqi IA

 s e CeomP)
-Tca
som P cBs 4-s

(3 Hours)

N.B. (1)Ouestion No. I is comPulsory

izi .qtt.rnpt *y trtt"e out of remaining five questions
i3j Assumptions made should be clearly stated

1.

2.

10
J. (a) Design a PDA that checks for well -
10
\ (b) Cionsider the following grammar

S-,+iCtSliCtSeS:ld
C---+ b

For the string 'ibtibtaeal fihd the

(D
(ii)
(iii)
(iu)'
. sting where l={a,b}. l0
4.
10

10
10
{ an-l b2o+1 lnt:l )
z0

of Context Free Language

 ..rct r'; -D'*TT o.4
sgcconngu-\"^,) $.ar v )
ccrgscJ ) Qev
^ 94L rtlt, , r
-D"*--< b.^t<- w,awa+e\'\t'l ,, :'.-...;-.,.. ,. .
e P:Cbaei ra5o8 ' i'
', l, .' L'

. Ii-.. ,-.,.;,,,.: .. ...t :..

(3 Hours) ." :' lofal [I4iks,'.EQ;

N.B.: (l) Question No.l is compulsory' r.

qu-eg!ion!;, ..:' : . ' i'.'' .1''.,t '.'
(2) Solve any three questions out of the remaining ,
f :: ,.i'
needed' :,".t'..r'r.. ''i.,:r -.,;.'-;:.:'.:.
-.. .., . ..1

(3) Make suitable assumptions if '-i.i'

.:l ::.'.,- 1" -.. ...:' ,:.1.-'l::.-)'.t-
.'":'.'1!:..;'"'rf...:
: '" ':"'"-: - .

1. (a) Describe Data Independence' ..:-,::t.,,:.'i:r'':''r-"'.'"' ':;-: '5

(b) compare File sv*"- *Jo*uu^" syqGq-.."-:t,..'i.l '-11:;"'...,:]:'':'.1..:,,..],,:.,].;.r'tt.].sr,,.:|'
:]
(c) ExPlain ACID ProPerties
(d) Explain Aggregate Functions in Sdt't ':.'' ' :' . . ..., ,. ,,,.1.15
$orirurllz{ign Te-ctrqiqllel.ivith o(:rltple
10
2. (a) Define Normalization. Discuss.di-ffdiert
10
(b) Describetheoverattarchitegtirtlolp.,p.{Q*i1tr."sU.1$t'e*llae'a-',.,.,'.-i,,)

3.
.'.
pr4ur rJPwJ vr integiilvooiist1ainli.wiltre.ia.1efi;''.'.
(a)Explaintypesof
.\'' '.: '. ..
1q ' '':",., .1 'in
fol a(Ccimpany' which 10
l* -
iUl nt^"* in-
E'R Diug*.
oiug*m andtconveri
unatconv6ti it
lt inloli4dtiolal-model{o1.
into'igldtioial-modpl
Pr'ojedls; Several Employees
has several Employeqs wgrking'on different typei'of

are working for one Depa$ne!l; 9vbrv.P9p4rt{,n9!t !4qra,!!4nager'

Several Emploaeei'are sripeiyised'by'91,e'pip!9yee,
, ...r.: ,a.:
.-.,i.. ... ..':'

4. (a) Discuss Data Detrnition and:Manipqlatlon Conimands in SQL' 10

. iui l sxpialri securitv and Authorization:in DBM$:' l0

5.,.:'16i-e!priin G rollilviag'Re!$io.nd:etgduta'opelations
with example: 10
-:i.Cartesian
.1'' ..l ,,'.,.1.. Produot: ':iii'r Projeot" ' '
::..::_ ,l.t ..r r-: ii:.Naiural Join. ,., -.''.,iy.'\ftigq.,..r:'
.'\.:.
.
recovery and shadow paging in detail. 10

:.' .. -':'
20
6. Write Short notes on:
'.'''.''',.' (1) $!91s. in Qusly Procelsir-rg l
'.:1.
ri(b),Rold. of Datiibdse Adniinistrator
t . ,(c)ii)eadtocks :

, ',.,ta). Sii";ializaiion and Aggregation

. . ,,i
' **+**t*****
. .. ,.I

D22DB1 B264DODADCC265B273A9A28368
I

, , .,.-,:,.,r,- ) .
S€ saYn -rv C cBoO
'GsJ r-nw}Yv;Vt
cnuapw-[ve
Su-tr--
"r\rr'.D - AsApply
,F\ '> A
f"!
€ ..r -:.
,ifce4t -,.l,?K t'dt,r,ld
[lt,ll? "'c{
:.\ ,'.,, .,.li,.r

\ 2-
Q5.AlWhatisall pairs shortest path algorithm? the same on followirig Grdph. 1QM'. r' :
.f .ir,
'-:.,.
':',. \-./
, :,.,.).a....,' .

. i .,, .:
., .l'

./
'/
,//s

b) Find MST of Following Graph using Priihs and. Prism's Algorithm. . ,- , . i 10M . ..
'...'.,.,1

'*{\q Il' c"/-i&r

:' lxly -TI
.: r!-
I \ Itf; I
:
r"

20M

ADs 5F 6222431 8 ABD44 I CFBD767JA5CAC