Vous êtes sur la page 1sur 20

" (Please write .your Exam. Roll /11,0.) Exam. Roll No .

END, TE:RM EXAMINATION


FOURTH:SEMESTER[B.TECH.], MAY - 2011
'Paper Code : ETCS - 202 Subject: Software Engineering
..

Time: 3 Hours, Maximum Marks :75


,! I
}Vote:
'.,;'
Attempt.All
,
questions. Internal choice is indicated.
I

Q. 1. Give a short answer: (2.5 x 10)


.'.'-

(a) What is software component?

l h i
(b) Distinguish Iterative Enhancement model and Evolutionary Process
D e
model.
e w
e , N
lle g
(c) What are the. differerit activities in Requirements Analysis?

,(d) What are the different dependencies present inC


o
rin g Use Case Diagram?

(e) What are the different techniques e toeestimate size of the program? '
ginwhy? --- -
,Which technique is betternand
i a E
(f) What are [theIn d activities of Risk Management?
I ,

rn Quality 'attribute and Quality criteria giving example


different

rt h e )

o
Differenti'ate
N of each. ' I'

."
,
t ,
, (h) What are the different CMM level? What does CMM level
specifies? I

! !
(i) Does fault' necessarily lead to failure? Justify your answer with
. l t,
,>i
I
.
example.' ; ..j
I', ',: '[:,!,.:, ,
Name ,. four software
-1 :,'
testing tools that are popularly used these days.
j'

1 P.TO.
"J
! I

r~'
i
) i+.

Q.. 2.· Draw neat sketch of Spiral Model and explain its different activities. (12.5)
"

What do the idifferent cycles indicate in this


.
model? What are its
advantages over traditional Iterative Process models? Why it is not
p. •
'suitable for small. projects?

OR

(a) Why Requirements-are hard to elicite? Explain the Requirements (6)


;-·1:; ,'.
elicitation technique Use Case Diagram using example of Banking
system.
o
i
eh
l
(b) How are DFD and ER Diagram useful in requirements analysis? (2.5)

(c)
e w D
List different users of SRS with their objectives. What are the (4) I
, .:.1
e , N I
I,

g
Quality Characteristics of SRS{-'-· -. , I:

lle
j
~ ,
o
1
'/ ~
I
C of Intermediate version
',,:'~'~
i.... . !

.• ~Q. 3.
n g
ri of COCOMO. :
(a) What 'are the advantages and disadvantages (4)
I ~r/
of CO COMO over Basic e e
in
::,"[' version

(b) Drawthe flowE n g


i a diagram to calculate efforts and duration of project (4) ..

I n d version of COCOMO.
;.. .' .

n
using advanced f

h e r
ort
:; ,
(c)Hpw productivity and efforts are measured using Putnam
N
~. ~ . .

'Estimation mode?

OR
(a) What do you understand by 'Coupling and Cohension. What roles (4)
1
. they play in software design? Describe the properties of best . II
j I:' .

I
t
i ,; . "
coupling and, cohesion giving examples of each.
.
!
I
..
); .
I
I
'I' ,i .
. ,j, 1: . ~ .
. " ~ 'I' . ;:.'~i!', ,.

!
I
. ;.. . I
i
.i .:

.'
(f~i~~t.'""!;
~tV ; ~
. ~.-,:

(b), What is a structure chart and what are the different steps for (4)
dra wing, structure' chart? -:

(c) What are the steps of arriving object oriented design?


• I.~. i

Q.4. (a) What do you understand by token count? Consider a program (6)
having . ~I

i.

Number of distinct operator: 12


-.~~.-
Number of operands: 5

i
Total number of operator occurrences: 20

e l h
D
rt . Total number of operand occurrences: 15
b~;;~
I' ,
Calculate the different Halstead software metrics for above
e w
N
1 I

e ,
r '~

g
i
programs.~-
I ',: e
oll are ~a1culated for a '(6.5)
" (b) .What are information flow metrics? How they
g C
r i n
I i

given ~~cture .chart? What.is the


n eORe purpose of data structure metrics?

ng i
E
ia poisson execution time model initial failure
n,d
r n I
(a) :For a Iogarithmic (6),

e
~. , i

orth 'is::O.025/failti~e':i~1).~l':fail,~re
;intensity~i~lPWa"i~u~fs(~PU hour, faij~ureintensity decay parameter
'. iN~:.I,;:
,,~.' ~",'J. i: .... 'l(, J··,~t!':I·" '-';' • ~

N , failure intensity." : .,:


'experienced are '65. Compute the current
!--;¥' ,1,,)~ I~;. 'J t,g~ > '(,;;(\,,'
'
.!.

", '.
,1"'1~'\ •

. 'j

(b) 'ExplainMcCall's model of quality. How it is different from (6.5) ..


J.
, ,
i,
Boehm qualitymodel? .,
'i

.. '

It,.
"':.
, ,

-:

","

3 P.T.O.

~
l,
!

f :,~,
Ir.v ~IL_:....--~j
fJi::'
'Y~
t

:', ,
Q. 9. (a) .•.Differentiate between
(i) FAT 16 and FAT 32
(ii) Conventional File System and Network File System
/
i
~.
. (b) What are internal tables? Why is it advantageous to the user for an
operating system to dynamically allocate its internal tables?
Discuss the burden on' an OS by using these.
",
".I!
-. , :. (c) What is an Access Control Matrix? How is it useful to control file
'I' access? Discuss, with a suitable example.
"j', j,

• ••
i,·t . I.
',',!,' l

i
.,
,'.\ .

e lh
I,

D
I

ew l. I

e , N i
'" ..
~
lle g i
i
C o I

r i n g :I
in ee I
E ng .. j
i a
Ind
i

r n
-/

e .i

N orth . I
I
ill
, ,
.\ 'J'I ,.
,I
~i I
t .

(:
. ,
;
'i.

4
~~
I

II~{V
, q,,'
:,Z(, "
"j.l:, .

~.
Jh,,/" ,
,:i~:X,:I:,Q. s. (a) Consider a program that input two integers having values in range (6)

rt~·, (1 o. 250) and classifies them as even or odd. For this program
:;k:j,~;
, generate
/
(i) Test cases using Boundary value-analysis
'! ':: .... ,
-.1'*
. ',:,' (i1), Equivalence Class testing
"

t
'
.•. :;:'
i

Explain the steps to 'perform path testing using flow graph with (6.5)
, , I

the 'help of suitable example.

.. ! ,OR'

i
I

e lh
D
(a) What are the, different levels of testing and their purposes? (3)

New (5)
. I j

,
(b) Explairiany ~W;Omodels of Software Maintenance.
e I
, ; l' .
(c)!~ 'What is the '~ifference between reverse engineeringeand
, ..'" I ;','

ll g ,,' '

C o I
g
.1

in
reengineeringvExplain different steps of reengineering. (4.5) I
e e r I I
J
n
!•

g i
n • ••
i a E
In d ,

r n
(1

r t he
No
II " , '

'., " .. /

, i
\

'j 4
,. ,f~! i I
I
I l.•.
t--

(Please write your Exam. Roll No.) Exam. Roll No .

END TERM EXAMINA1:ION


FOURTH SEMESTER [B.TE€-H:-];-MAY - 2011
Paper Code: ETCS; - 2i2 Subject: Operating Systems -:
,j

Paper Id : 32212 1 >, •


" r ~
, t' / i ,
'-i T~ine: 3 Hours Maximum Marks: 75

Note: -Attempt One question from each unit. Q. No.1 is compulsory.


,

Q. 1. Answer to the point and in brief: (2V2 x 10)

(a) Describe the layered approach of an operating system,

(b) Differentiat~ between a. multiprocessing and multiprogramming,


lh i
e
,

D
,

(c) Can paging-and segmentation be co~bined? How? '

New
,
(d) Discuss three major complications that concurrent processing. adds

ge
lle
to an operating system.

C o .I
g
(e) What is an RTOS? Define its basic Kernel services.

Differentiate between - a thread r


e n
i a process, I
e
(f) and

(g) What is deadlock? Cangain I


E n single process have deadlock?

di a of 'overlays' as implemented in art operating'


system. In
" (h) Discuss, the concept

e r n
N o(i)rthCompare - Interrupt and Polling.
U) Write a short note on - Windows 7.

. I·
UNIT -.I (5+ 71/2) i,
!
I
" ,

Q. 2. (a) Why do we need an operating system? Compare an as for a PC

,: . and an as for a mobile.


~.I •
(b) Differentiate between e- a parallel as and a distributed as.
I .• '

",
[ \~. ,,~'
',' 1
i':
" :~l '

I ;,.'
•• I·

"
I.' -::
r" '
,!-HI
!
.. I 1 P.T.O.,

I
!
,---- 1"'1"",,· ."

r I"

';,t "

Q. 3. (a) Differentiate , between '


.:

(i) ! Contiguous and Non-contiguous Memory


(ii) ,PhysIcal address and Logical address ,. '

, !
t 1 .
: .l ,

(b) What is Fragmentation? What are its types? Discuss, anyone.


software-based and one hardware-based solution for the same?

,
UNIT - II (41/2+8) , i
';"-::;;~~

.. O;,.~~
..
Q. 4. (a) What are., the goals of a good scheduling '. .'
algorithm? Discuss,

i
Preemptive, scheduling and Non-preemptive scheduling by taking

e lh
.' • t .

D
a suitable ~xample.

e w II.
':,

N
(b) Differentiate between - User levelthreads and Kernel level
threads? How does an as deals with the same? Write ,an
I:
e g e
o l l
algorithm for anyone type of thread (either user-level
C
or Kernel
level) as serviced by an as.
r i n g
e
ne and Semaphores.
Q. 5. (a) Differentiate between=-
n g iMonitors

(b) Describe theia


E
d
, '

In condition for deadlock. Write an algorithm using


principle of mutual exclusion? Is it a favourable or

r n
e'wait' and 'signal' operations for mutual exclusion.
unfavourable

r t h
No
.J

1 .
(3+3+3+3V2) \

UNIT - III j
-------- l'
Q. 6. (a) Differentiate between - Disk Scheduling and CP.D scheduling.
..
, '
! .
i .

(b) Suppose,
,
a disk drive has 3000 cylinder (0 through 2999).The drive
, '

is currently serving a request at cylinder 125 and the previous


request ~as at cylinder 145. The queue of pending requests is :

233,,456~ 125,91,789, 1600,2345, 13


[ '\

. i ~.
,i
, ,
: l 2

,
\
\
. ~1

,;,1.)~··J:'~···J
.1
! -·-r\t· I .

. \~ev

>:.,

Starting from the current head position, what is the total distance
/
'.On cylinders,) that the disk; arm moves to satisfy all the requests
',' • i '

for
.
ELEV AT-OR
i \
algorithm?
, , : I';' . -; .
• Differentiate between - Blocking and Non-blocking I/O . ;

. , ..

(d)' i :Co,nsider a system having 10 tape drives, with 'n' processes


. ", ,

.;, . competing for them. Each process may need three drives. For how
!} .. '. '!
; I many processes (maximum) the system will be deadlock free.
"
'r'

Q. 7. (a) Differentiate between Inter-Record Grap (IRG) and Inter Block

lhi
Gap (IBG). I
"

(b) Which type of disk-scheduling is better in an as? Give suitable


D e
e w I

N
I'
example in support of your answer. ,. ri
Differentiate .between buffering and spooling.
g e ,
e
(c)
(d) What is a resource allocation graph? How does litl help in detection
C oin which five' i

r i n g
of a deadlock? Depict two different scenarios \I
..i,;l

n e e I
i
different processes are :
deadlocked and g
'(!:~;'I,'::; .1

n
I

E
(i}.
-----
d ia
'.
(ii) Dot deadlocked.
n
"

r n I
~ rthe
,UNIT - IV

No Assuming a ~luster size of 512 bytes calculate the percentage


t
1_'; .~V
IQ~:8. (a)
I, . wastagr in file space due to imcomplete filling of last cluster for
a file df size
J 0000 bytes.
:I
(b) What ismea~t by an 'alias filename' and explain its UNIX
implementatipn?

(c) What are the \trad~offs inv~lved in rereading code pages from the
file system-as compared to using swap space to store them?

..

3 P.T.O.

Ii

"

,
!

\
t~q:
, I .

L.~
..
(Please write your Exam. Roll No.) Exam. Roll No .

END
.. TERM EXAMINATION
FOURTH SEMESTER [B.TECH.], MAY - 2011
Paper Code : ETCS - 210 Subject: ComputerGraphics
Paper ID : 32210

Time: 3 Hours Maximum Marks: 75

Note: Attempt One question from each unit. Q. No. 1 is compulsory.

Q. 1. (a) Explain the advantages of the representation in homogeneous (5 x 5)

i
coordinate system for 2D and 3D-:--

e lh
(b) What is the relationship between the rotations R8, R-:8 and R -Ie
D
.~ How is Bezier surface formed?
N ew
,
(c)
e
i/
g
1--

lle
Cd) Distinguish between perspective and parallel projections.

C o
g
(e) What is the Back-face detection?

r i n
in ee
E ng UNIT -I
i a
dBresenham's
I n
Q. 2. (a) What steps are required to plot a line whose slope is between 0° and (6)

e r n
45° using method?

ii;':.i,l" N ort(b)h Perform a 45° rotation of triangle A (0, 0), B (1, 1), (5,2). (6.5)

Q. 3. (a) Find the form of the matrix for reflection about a line L w~ll slope m (6)
and y intercept (0, b).

(b) Let R be the rectangular window whose lower left hand corner is at (6.5)

'! "
L (- 3, 1) and upper right hand corner is at R(2, 6). Using the
~" . I "

Cohen-Sutherland algorithm clip the line segments AB and CD


where A (~A, 2), B (-1; 7), C (-1, 5) and D (3,8).
" -

r
I.

1 P.T.O.

;
\,
\
r:
~
" !
'/

.:(I~ " 'ijL~~


,-~
',j'
'v'I

't~/-J

UNIT -II
Q. 4. (a) Using Bresenham'salgorithm, draw a circle whose centre is (0, 0) (6)
and radius is 5 units.

(b) Explain B- spline curves. (6.5)

Q. 5. (a) 'Derive the


, Bezier curve. (6.5)
(b) Given vertices of Bezier Bo [0, 0], B 1 [1, 2], B2 [3, 2], B3 [2, 0], (6)

i
.'
l/
find points on Bezier curve at t (0.15, 0.4, 0.75) .
r-
UNIT - III
Q.6. (a) Explain the two principal vanishing point perspective projection. (6)
lhi
D e
ew
(b) Explain the oblique projection on xy plane. (6.5)

,
Q.7. (a) What is solid modeling? Discuss the generation of solideobjects
N
lle g (6.5)
»-«: .~!
, using sweep method .
C o
I

r i n g
e
(b) Describe the Constructive Solid Geometry (CSG) representation (6)

n e
gi
for solids.
n
E UNIT-IV
/'
~
d i a
n
. .

r n
Q. 8. (a) Describe the I technique of Gourand shading. How does it differ (6.5)

r t he Phong shading?
from

N(b)o How does the Z-buffer algorithm determine which surfaces are (6)
hidden?

.1
Q. 9. (a) Given points PI(2, 4, 0), P2 (6,12,40) and P3 (4, 8,12) and a view (6)
point M (0, 0, - 10), determine which points obscurve the other when
viewed from M.

1\ (b) Describe the scan-line method. (6.5)


". ,

•••
. /

2
'
. , ':
.• '

. "

.',i

,".' ,,(Please write your Exam. .sou No.) Exam. Roll No ,..

t'<'J .,'
'END ~ERM EXAMINATION
. '",
•.FOURTH SEMES~ER [B.TECH.], MAY - 2011 .'
Paper Code': ETIT - 298 Subject: Communication Systems
.j
",. Paper /d : 31208 I
,.;' ",: :ll~:ne.VJHours ,Maximum Marks: 75
, Note~' Q. 1 is compulsory. Attempt One question from each unit.
: ,:,
I
, ·r·
i
I· "I
(a) Explain theneedof modulation in communication systems. (3) , "
I " "...
!" .. ;/;1.
I .c,
(b) Represent DSB,-SC signal in frequency domain and draw the (3)

spectrum.
~ -i

l h i
(c)! Distinguish
.
between natural and flat top sampling.
D (4) e
w
e (3)
'

, (d) Define the tern 'cross talk' and where it will exist?
e , N
(e) Explain the term Deviation Ratio with .respect to lFM. le g
C o (3)

r in g
e
(f) Give the expression for pdf of Gaussian Distribution.' (3)
nande explain its significance:
,.

n g i
E
(g) Define the term companding (3)

a
. l

n d i
I
II

:"t ." (3)


(h) Give the advantages of QPSK over BPSK.

e r n
r t h
No UNIT-l
"

.
Q. 2. (a) Describe the Envelope Detection technique for Demodulation of

AM Signal. Give the appropriate wave forms. (6.5)

(b) , What is known as Quadrature carrier multiplexing? Explain the


"

, " functionality with transmitter and receiver block diagrams. (6)

,'.
L
. I I.
: \ ',:' ,'I'

1 r.r.o.

.1
---_.
\' ':

.,.
(a) 'Describe the methodof generating Flat-top sampled signal.

Represent flat-top sampled signal in time domain and freqeuncy


i
domain: (6~5)

(b) Obtainthe relation for modulated' bandwidth of


(i) {.
PAM
~ signal~
(ii) - PWMsignal
.~.i,.:;~
"; .•..-!f:-.

t\ 'I'
(iii) PPM siznal (6)
~. Ii

.: .,;
'-' .

!"~
lhi
UNIT -II
e
D (6) :".
ew
'I

Q. 4. (a) Whatis, angle modulation, How FM and PM are interrelated?


N
~ ....
,

g e , . ; ,I, jl.,:
e
(b) Show that the process X (t) defined as where A ;"
ll variable over [-TC, TC]
X(t)==Acos(wt+8) ,,(.

o
I

C , I
g
'
and w are constants and 8 is uniform random
n
i auto correlation.
is ergodic in both the mean rand
e
e
(6.S) ,

n gin
,-

E
.> '.. • ~

; i). ,.'

i a
.'

I n d the demodulation of FM signal by Foster-Seelye


n
Q. 5. (a) Explain
e r
o rth Discriminator. Give the relevant phasor diagrams.
N (b) The pdf of X is given by
Ix (x) = k e - ax fl ( X )
,
, ----~ i
where is positive constant. Determine the value of constant 'K'. (6.5)' 1
!
I ' I

I
1 'i: " .!'
I , I '
! !
i

•...
I

I
,,
. !

2
'j "
. ~. \

,1, ;.

~-
,
~\
\
.. ,
r
f·(j~:;·
iV',
I

I\~~.

'. ~
': . i.1

, , -" UNIT - III


~ <, • •

I,

Q. 6~ (a) , The output signal to-quantizing-Noise Ratio (SNR) in a peM system ,,


.!' , 0 , ,
is defined as the ratio ofaverage signal power to average. quantizing

noise power. For a full scale ~inusoidal modulating signal with

amplitude A., show that


r
., ., ',J ,

, .'

i
where L is the no. of quantizing levels. (8)

e l h
(b) Explain the concept of minimum shift keying (MSK) modulation
w D
Ne
technique. '

ge , (4.5) I:I

lle
g Co
r i n
ee
Q. 7. (a) , What is one bit quantizer? Explain Delta Modulation technique in

in
ng
detail. (6)

i a E
d $NR. List out the properties
,.,.
Obtain the relation for Impulse response of Matched
n
(b) filter to

r n I
e
m~ximiz;e of Matched filter. (6.5)
h / i
,

ort
"

ii' :
"
, ' .,
N
' ,

,, I'
• :~.~ I

UNIT - IV
L~;
I",l "
J

Q. 8. (a) Define the term Mutual Information. Give the properties of (6)
;r:':;~l't:l'~,:,: ,
!,
~ '
\
I,
},,11:- ,./)L:.Jt:i .J
Mutual. Information.
Il
(b) Show 'that Mutual Information is a non negative number i.e. (6.5)
i ~ !"

I(X;Y)~O ,

i,1.
l?t{,,!~~t'F';!I\'
}~t,~~~ ii~:1:·;
II.,., lV ,f'I'\"'" I
I'
r • I
,; I
, "
3 P.T.O.,
,
Jifi l
\ -;: ~"1 r
: I:
,
r:
,

, ,

.-j

-'
K '. ,

,I~,''(.,;:' ~.-- "~)


'b
J' ',1r,~,
"r~1(~$;'~)1
;::' I'~'"
1 I '
'~f,,~ <" I
,\~~
)fi;(t~I/;~>
..
,! '
, .~;
.:~\.". I

f .'

Q. 9. (a) .
Consider a DMS with source probabilities {0'35, 0'15, 0'2, 0'05, 0'25}
1 .
'

(i) Determine Huffman code for this source /


(ii) Determine Average length of code words

(iii) What is the efficiency of the code? (6)

(b) Determine the LempeI Ziv code for the following bit stream:
01001111100101000001010101100110000
Recover the original sequence from the encoded stream. (6.5)

lh i
••• D e
e w I.
e , N
Co
l le g I
,
r i n g I

e
I

e
i

in I
E ng
i a I
r n Ind , I,
e
,

orth
" ')-
~-

N
1
I.

I
~ ~,'
"

!
~' I

J j'
,
i
,]

~"'~.":
.' .
'j
,J,\
,
..
'

-I; : \ ~i..'. ,.
i
\ "
,\
"
(Please write your Exam Roll No.) • Exam Roll No .

END TERM EXAMINATION, ,

,-- .••.. FOURTHSEMESTER B.TECH. MAy-JUNE-2011


Paper Code: ETEC206 Subject: Digital circuit & systems- I
Time: 31-10urs Maximum Marks :75
Note: Q. No. 1is compulsory. Attempt four questions from rest of the questions. I

Ql (a) What are universal gates? Why are they so called? (2.5xlO=25)
(b) Explain the concept of active low and active high terminals with
suitable illustration.
(c) Convert (3289)10 into binary.
(d) Muttiply (1011)2 by (101)2
(e) Why is a 555 timer so called? Can it be considered a digital device?
(f) Differentiate between asynchronous and synchronous counters.
(g) What is an excitation table? Give example
(h) Give an example of self complementing code.
(i) Perform the following addition using 2's complement -20 + 26
Ul Draw the logic circuit to realize the function
l h i
Y = ABC + ABC + B
D e
w
e circuit- (5)
Q2 (a) Reduce the given expression to SOP and implement logic
e , N
g
---- -- - --- - - -

llesignal stating their merits


X =ABCD+ABCD+ABCD+ACD+ABCD
(b) Differentiate between analog and digital
C o
g
and demerits. (2.5)
(c) (i) Draw AND-OR logic circuit n
(ii) Replace the AND-OR e r i forbyYNANDonly
AB + AC.
== (5)

i ne
circuit circuit.
g
n functions using K-map.
Q3
Y(A,B, C,iD) a E
(a) Mininize the logic (2.5)

I n d ==ITM(0,},2,3,5,7,8,9,11,14)

e r n
(b) Solve using K-map and implement using logic gates (5)

h
=
t
I(A, B, C, D) L:m(0,3,4,5,7) + d(8,9,1 0,11,12,13,14,15)

o r (c) Fig 1 shows a logic circuit. What function is the circuit per forming? (5)
N
~=
J:\
~ ~~:L
Q4 (a) Design a full subtractor using two half sub tractors and a logic gate. (5)
(b) Implement Y(C, B, A) = L rn (0, 2, 4, 6, 7) using a 4: 1 multiplexer. (5)
(c) Implement a 3 input majority gate using decoder. (2.5)

Q5 (a) Differentiate between edge triggering and level triggering. (2.5)


(b) What is race around condition in SR flip flop? How can it be
overcome? (5)
(c) Convert a SR flip flop into a JK Flip flop (5)

Q6 (a) Data 1010 is the input to a 4 bit parallel in serial out shift register.
Draw a diagram to show the state of registers after 1, 2, 3, 4 clock
pulses. (5)

P.T.O.
'f
l"."

,. [-2-1

(b) Design a 3 bit, synchronous up/down counter with gray code


:i.' . sequence. ,The counting should be up for E = 0 and down for E = 1. (5)
(c) What is ripple counter? . (2.5)

, , Q7 (a) What are monostable and astable multivibrators? Simple draw the
circuit diagram of both using IC 555. (5)
(b) What are important characteristies of analog to digilal converters?
Explain in brief, any five. (5)
(c) What do you understand by duty cycle in a multivibrator (2.5)

Q8 Write short note on any five. ------ (2.5x5=~


(a) Content addressable manory \~'O
(b) Unipolar & bipolar logic family
(c) PAL & PLA circuits
(d) CMOS logic family
(e) Wired AND logic
(1) n bit register and n bit latch
(g) Dualslope ADC.
lh i
D e
************
New
ge ,
olle
g C
r i n
in ee
E ng
i a
r n Ind
e
N orth

i .
'fllif.:.
r
't';
I !
, ,1,+<--,
(Please write your Exam. Roll No.) Exam. Roll No .

END T'ERM EXAMINATION


1 FOUR~H SEMESTER
!
[B. TECH], MAY - 2011
Paper Code: ETCS - 204 Subject,' Algorithm Analysis & Design -:
i .~
- -"
IV
--1--'
I Time: 3 Hours Maximum Marks: 75
i.-----,,..-------------------------------------,
" Note:
I -
Question' No. 1 is compulsory. Attempt any One question from each unit.
, ! ' .

, , t-

I
!-
II

Define Bigoh notation. (10 X 2'12= 25)


i
.. 1'.

e l h
w D
N e
e ,does it occur?
,;

g
,!;' olle property" in a
~(c) . What is worstcase running time of quick sort? When .I

..
(d) What do We understand by the "optimalC
g
substructure
dynamic programming problem?rin
.. .

e
\

n e
gi of merge sort?
I

n
aE
(e) What is the time complexity

What are d
n i I

II':" I
(f) union find problems?

e r n .1

t h
(g) Will
'Ii!i,iiii'~!iln eitherKruskals or Prim' s Algorithm work correctly on graphs
r
I;i .'
,!,i\)I'_lf. Yll: ;i
o that have negative edge weights?
J' .iIJ

N
Ilft•t I, .\:~:
.
(tlt~~l·'~ ' ~'!'~
'1' ',!'~ .-- t: ",

(h) What is np complete problem?

(i) Give an example of dynamic 'programming approach.


\
i I

Define Greedy Choice .Property.·


'i'

ii ;~ ;~I

.1
l't. .
UI
! .
P.T.O ..
i .

.!:
i
I. _. J
I
J'
/'"'\r
1 I

1 I~~

. i
. ~'i

, -UNIT .•I
i .: .
I. ~..i

Q. 2. (a) Explain the merge sort. Perform the quick sort to sort the following (5)

numbers. '
';, ..
20 40 50' li5 10 05 80 90.
i'

(b) r .Discuss the :order -of Complexity of Matrix Multiplication using


, " ~ .!I.:

Strassen's •
algorithm.
! ~
(7Y2)

OR

Q. 3. Solve the following Recurrence relation using Masters Theorem: (12Y2)


. ,-J.
i
(: .~
.I

l h
(a) T(n)=J2T(nI2)+logn I

De
w
T = 4T
(b) (n) (1112) + log n
e I
,(c) T(n)=T(nl2)+n(2-cosn)
e , N i
lle g
C o
r i n g 'UNIT - II

n e e have common with Divide and (61/2) r


n gi
Q. '4. (a) What dopes Dynamic Programming
conquer and whatEare th~ differences? Determine the LCS' of < 1,0, 0, I
d i a < 0,1,0,1,1,0,1,1>
n I n
1,0,1,0,1> and

he r
r t
No (b) Compare
algorithms:
and contrast the following approaches to designing (6)
0·' .
.(,'

(i) Greedy algorithms


I
Divide and conquer
J
!
-~ ."

I
. OR
f
I
.
1
'[
,.
.1
". I

j
,'!
.
,
. I~
: .
2

1 ,

\,'"

!'.
1. .'~
,
!
·1 ;
~:~
.
. .>-'.

~I .

. i
, i
I, j . :

~ i ,! ; ~'I

Q.S.:. Consider two :~bams A 'a~d


. ~ '. , f!·'· .'
B:, playing a Series of Garnes until one of
.
/
the Teams winsn games.' Assume that the probability of A winning
..
a game is the .same for each game and equal to p and the probability of
\ " 1 '. ••

A losing a game.is q =' l-p.' L'~t p'(I, J) be the probability of A winning


__ i ~ .?

the series if A:· n~e~ds I moregamEfs to win the series and B needs J more
, ,
games to win the series. .
•.•..• ".t·' , ,
~. i ,'
(i) Set up a recurrence relation for p (I, J) that can be used by a dynamic
programming algorithm.

i
C ii) Find the Probability of Team A Winning the Series of Seven games,
i

e lh
D
if the probability of winning a game is 0.4

e w
(iii) Write the Pseudo-code for Dynamic Programming
e , N andalgorithm
discuss its time complexity.
lle g
C o
r i n g
in ee UNIT - III

E ng through-an-example.
iadynamic programming algorithm for computing
Q.6. (a) Discuss Dijkstra algorithm (6)

I n d
r n
(b) Describe the (6V2)

r t hethe'~inimum cost order of multiplying a string of n matrices


,,'t
!N
I'!i
f-:~ ;
'
o ·Ml* M2*M3*; .... Mn.
!
OR
t . ;
Q.7. Write the short comments on the following: (12V2)
. t'·
.: "1 ,'\""l . . .'
(i) Flayed Watshall
.I
, i
algorithm .
. ; I
(ii) Bellman-Ford . i."
algorithm
••....
..

. ,
. .
i
,., i 3 P.T.O.

.. '-1

,
\\
I, l :
'.

, ~
UNIT ~ IV

Q.' 8. Prove that CNF satisfiability is NP-Complete,

OR

Q. 9. For the given Text T= "aaabaadaabaa" and pattern is "aabaa",


illustrate the comparisons done: by naive String matching algorithm,
Repeat the solution forKMP Pattern matching algorithm by not counting
v.

the comparisons made to compute the failure function,


,
" I

()
••• i
e lh
w D
Ne
--,--
ge ,
I

ol le
C
j

g
:1 ,;

,.~. n
';

r i
,j

r, "I
n e e
i
I

E ng
i a
r n Ind
e
,j,

orth
r',
lW 'f" ' I·
r.~::l': J~;
:{~,~;::,;
"~of '.
.

N ,
" ,1'.

i~~~[]/
, "

f !

I :l
:',i'billi!j;,
'Iyb:, 1L'f
.
il
i ':
:1
I
I
* .
1-, ii ,
,
,
'

it~
1
'/
!
, ( . ,,1
i
j
"
:1 '
.:
,

(I
I
I

4 , :
~I •
j
, I

1;;";.lM~1:!ilJ;;~;1 !

i:~lii,~'
;Jb'" -~
:~":,;, ~
ft!. .' \
Ili!Il",. ,; ',I ,.,;t;·;... ~-_J
tlllk,~

Vous aimerez peut-être aussi