(please write .your exam. roll /11,0.) exam. roll no . te ... · ~.i • (b) differentiate between...

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

END, TE:RM EXAMINATIONFOURTH:SEMESTER[B.TECH.], MAY - 2011

'Paper Code : ETCS - 202 Subject: Software Engineering..

Maximum Marks :75Time: 3 Hours,

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

Q. 1. Give a short answer:

, ,." t ,

(2.5 x 10).'.'-

(a) What is software component?

(b) Distinguish Iterative Enhancement model and Evolutionary Process

model.

(c) What are the. differerit activities in Requirements Analysis?

,(d) What are the different dependencies present in Use Case Diagram?

(e) What are the different techniques to estimate size of the program? '

,Which technique is better and why? --- -I ,

(f) What are [the different activities of Risk Management?)

Differenti'ate Quality 'attribute and Quality criteria giving example

of each. ' I'

(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 testing tools that are popularly used these days.

,. -1 :,'j'

1 P.TO.

"J

Northern India Engineering College, New Delhi

, .:.1

'/ ',,:'~'~~i....

'I'

. ,j,

. "

! I

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

What do the different cycles indicate in this model? What are itsi .advantages over traditional Iterative Process models? Why it is not

'suitable for small. projects?

OR

(12.5)

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

elicitation technique Use Case Diagram using example of Banking

.• ~Q. 3. (a)I~r/

::,"['

~ 'I' .

system.

(b)

(c)

How are DFD and ER Diagram useful in requirements analysis?

List different users of SRS with their objectives. What are the

Quality Characteristics of SRS{-'-· -.~I

What 'are the advantages and disadvantages of Intermediate version

of CO COMO over Basic version of COCOMO. :

(b) Drawthe flow diagram to calculate efforts and duration of project;.. .' .

using advanced version of COCOMO.:; ,

(c)Hpw productivity and efforts are measured using Putnam~. ~. .

'Estimation mode?

OR(a) What do you understand by 'Coupling and Cohension. What roles

. they play in software design? Describe the properties of best .t j I:' .i ,; . "

coupling and, cohesion giving examples of each.. I ); .! ..

. ;..

,i .1: . ~ .;:.'~i!', ,.

!I

. Ii

.i .:

2

.'

o(2.5)

(4)

(4)

(4) ..

(4)

r~'i) i+.

p. •

;-·1:; ,'.

III,

, I:j1,

. !

f

1II

III


(f~i~~t.'!;""~tV ; ~

. ~. -,:

(b), What is a structure chart and what are the different steps for

dra wing, structure' chart?

• I.~. i

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

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

having

rt .b~;;~I' ,1 I

" (b)

~l,!

f :,~,Ir.v ~IL_:....--~j

Number of distinct operator: 12-.~~.-

Number of operands: 5

Total number of operator occurrences: 20

Total number of operand occurrences: 15

Calculate the different Halstead software metrics for abover '~iprograms.~-

I ',:.What are information flow metrics? How they are ~a1culated for a '(6.5)

I i

given ~~cture .chart? What.is the purpose of data structure metrics?

OR

(a) :For a Iogarithmic poisson execution time model initial failure (6), ,~. , i

;intensity~i~lPWa"i~u~fs(~PU hour, faij~ureintensity decay parameter'. ,,~.' ~",'J. i: ....iN~:.I,;:'l(, J··,~t!':I·" '-';' • ~

'is::O.025/failti~e':i~1).~l':fail,~re'experienced are '65. Compute the current!--;¥' ,1,,)~I~;. 'J t,g~ > '(,;;(\,,' .!. ,1"'1~'\ •

, failure intensity." : .,: ' ", '.. 'j

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

Boehm qualitymodel?

It,. "':., ,

-:

","

3

(4)

(6)

P.T.O.

-:

. ~I

i.

..J.i,'i.,

.. '


:', ,Q. 9. (a) .•.Differentiate between

".I!", -., :.

'I'

"j', j,

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

,'.\ ..,I,

~'" ..

t .

(i)

(ii)

FAT 16 and FAT 32Conventional File System and Network File System

. (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.

(c) What is an Access Control Matrix? How is it useful to control fileaccess? Discuss, with a suitable example.

'i.

•••

ill, ,.\

. ,;

(:

4

fJi::''Y~t

/i~.

IIl.iiiI

:II

.. ji

-/.iI. I

'J'I , .

,I~i

I


, q,,':,Z(, ""j.l:, .

Jh,,/" ,,:i~:X,:I:,Q.s. (a)

rt~·,:;k:j,~;

'! ':: ....-.1'*. ',:,'

'., "

~.

Consider a program that input two integers having values in range

(1o. 250) and classifies them as even or odd. For this program

, generate/

(i) Test cases using Boundary value-analysis,(i1), Equivalence Class testing

" '

ti

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

the 'help of suitable example.

.. !I

,OR'

(a) What are the, different levels of testing and their purposes?. I j

(b) Explairiany ~W;Omodels of Software Maintenance., ; l' .

, ..'" I ;',' ,,' '

'What is the '~ifference between reverse engineering and

reengineeringvExplain different steps of reengineering.

(c)!, ~

! •

•••,

(1

II " , '

, i\

'j 4

(6)

(6.5)

(3)

(5)

(4.5)

~~I

II~{V

.•. :;:'

I I

II

.1IJ

../•Northern India Engineering College, New Delhi

, . ,f~!i II

I l.•.t--

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

END TERM EXAMINA1:IONFOURTH SEMESTER [B.TE€-H:-];-MAY - 2011

Paper Code: ETCS; - 2i2,j

Paper Id : 32212 1" r ~

, t' /'-i T~ine:3Hours

Subject: Operating Systems -:

>, •

i ,

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)

, ,Can paging-and segmentation be co~bined? How? '

Discuss three major complications that concurrent processing. addsto an operating system.

(e) What is an RTOS? Define its basic Kernel services.

(a)

(b)

(c)

(d)

Describe the layered approach of an operating system,

Differentiat~ between a. multiprocessing and multiprogramming,

"

(f) Differentiate between - a thread and a process,

(g) What is deadlock? Can a single process have deadlock?

(h) Discuss, the concept of 'overlays' as implemented in art operating'

system.

(i) Compare - Interrupt and Polling.

U) Write a short note on - Windows 7.

. II

I

UNIT -.I (5+ 71/2). I·

i,!I

" ,

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

and an as for a mobile.

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

I .• '

[ \~.,,~'

", ','

i':

•• I· I.'I ;,.' "

-::

I!

..r" '

,!-HI!

1I" :~l '

1 P.T.O.,


';,t "

, .. '

Q. 3. (a)

Q. 4. (a)

,----

Differentiate between .:, '

(b)

(i) ! Contiguous and Non-contiguous Memory

(ii) ,PhysIcal address and Logical address, !t 1 .: .l ,

What is Fragmentation? What are its types? Discuss, anyone.

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

UNIT - II..

What are. the goals of a good scheduling algorithm? Discuss,, '. .'

Preemptive, scheduling and Non-preemptive scheduling by taking.' • t .

a suitable ~xample.

(b)':,

Differentiate between - User levelthreads and Kernel level

threads? How does an as deals with the same? Write an

algorithm for anyone type of thread (either user-level or Kernel

level) as serviced by an as.

Q. 5. (a) Differentiate between=- Monitors and Semaphores.

Q. 6. (a)

(b)

. ~ 1

,;,1.)~··J:'~···J

,\\

, '

(b) Describe the principle of mutual exclusion? Is it a favourable or

unfavourable condition for deadlock. Write an algorithm using

'wait' and 'signal' operations for mutual exclusion.

UNIT - III

--------Differentiate between - Disk Scheduling and CP.D scheduling.

! .i .

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

(41/2+8)

(3+3+3+3V2)

1"'1"",,·."r I"

,. '

,, i ';"-::;;~~

.. O;,.~~

II.I:

1.J

\ .jl'


.;, .!} ..

; I

"'r'

Q. 7. (a)

..i,;l

'(!:~;'I,'::;

'."

t ~1_'; .~VIQ~:8. (a)I, .

"

,!

\

!.1

>:.,

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 algorithm?. i \

, , : 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'. '!

many processes (maximum) the system will be deadlock free.

(b)

Differentiate between Inter-Record Grap (IRG) and Inter Block

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

example in support of your answer. ,.

Differentiate .between buffering and spooling.

What is a resource allocation graph? How does it help in detection

of a deadlock? Depict two different scenarios in which five'

different processes are :

(i}. deadlocked and

(ii) Dot deadlocked.

(c)

(d)

-----

,UNIT - IV

(b)

Assuming a ~luster size of 512 bytes calculate the percentage

wastagr in file space due to imcomplete filling of last cluster for

a file df size J 0000 bytes.:I

What ismea~t by an 'alias filename' and explain its UNIXimplementatipn?

What are the \trad~offs inv~lved in rereading code pages from the

file system-as compared to using swap space to store them?

(c)

..

3 P.T.O.

-·-r\t·I .

. \~ev

/

. ;

"I

II'ri

i

\I

I.1I

Ii


ii;':.i,l"

'! "

~" . I "

" -

rI.

t~q:~, I .

L.~..


END TERM EXAMINATION..FOURTH SEMESTER [B.TECH.], MAY - 2011

Paper Code : ETCS - 210

Paper ID : 32210

Subject: ComputerGraphics

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 homogeneouscoordinate system for 2D and 3D-:--

(b) What is the relationship between the rotations R8, R-:8 and R -Ie

(5 x 5)

.~i/1--

(c)

Cd)(e)

How is Bezier surface formed?

Distinguish between perspective and parallel projections.

What is the Back-face detection?

UNIT -I

Q. 2. (a) What steps are required to plot a line whose slope is between 0° and (6)45° using Bresenham's method?

(b) 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

Cohen-Sutherland algorithm clip the line segments AB and CDwhere A (~A, 2), B (-1; 7), C (-1, 5) and D (3,8).

1 P.T.O.

;\,\r: ~

" !


'/.:(I~,-~',j'

" 'ijL~~'v'I

't~/-J

UNIT -II

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

(6)

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

Q. 5. (a) 'Derive the Bezier curve.,

UNIT-IVQ. 8. (a) Describe the technique of Gourand shading. How does it differ

from Phong shading?

(b) How does the Z-buffer algorithm determine which surfaces arehidden?

(b)

.'i l/r-

Q.6. (a)

(b)

Q.7. (a)»-«: .~!,

I

(b)

/'

.~.

.1

(6.5)

(6)Given vertices of Bezier Bo [0, 0], B 1 [1, 2], B2 [3, 2], B3 [2, 0],find points on Bezier curve at t (0.15, 0.4, 0.75) .

UNIT - IIIExplain the two principal vanishing point perspective projection. (6)

Explain the oblique projection on xy plane. (6.5)

What is solid modeling? Discuss the generation of solid objects (6.5)using sweep method .

Describe the Constructive Solid Geometry (CSG) representation (6)for solids.

(6.5)

(6)

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 whenviewed from M.

1\

". ,

./

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

•••

2


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

. ,' .• ' ':

. "

.',i

t'<'J .,' 'END ~ERM EXAMINATION. '",

•.FOURTH SEMES~ER [B.TECH.], MAY - 2011 .'

Paper Code': ETIT - 298.j

" , . Paper /d : 31208 ISubject: Communication Systems

,.;' ",: :ll~:ne.VJHours

, Note~' Q. 1 is compulsory. Attempt One question from each unit.: ,:,

,Maximum Marks: 75

(a)

Ii, ·r· I·

Explain theneedof modulation in communication systems."I

(3) ,"I "

!"" ..... ;/;1.

(3)I .c,

(b) Represent DSB,-SC signal in frequency domain and draw the

~ -i

(c)! Distinguish between natural and flat top sampling.. '

(4)

(3)

spectrum.

, (d) Define the tern 'cross talk' and where it will exist?

(e) Explain the term Deviation Ratio with .respect to FM. (3)

,. (f) Give the expression for pdf of Gaussian Distribution.' (3)

(g) Define the term companding and explain its significance:. l

(3)

II

:"t ." (h) Give the advantages of QPSK over BPSK. (3)

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


\' ':

,-.> '.. • ~

; i). ,.'

.'

---_.

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

Represent flat-top sampled signal in time domain and freqeuncyi

domain: (6~5)

(b) Obtainthe relation for modulated' bandwidth ofI·

(i)

(ii) -

(iii)

PAM signal{. ~ ~

PWMsignalt\ 'I'PPM siznal~. Ii '-' .

(6)

.~.i,.:;~"; .•..-!f:-.

!"~.: .,;

UNIT -II

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

(6) :".~ ....

; ,I, jl.,:,,(. ;"

I

I

, .

(b) Show that the process X (t) defined as X(t)==Acos(wt+8) where A

and w are constants and 8 is uniform random variable over [-TC, TC] , '

is ergodic in both the mean and auto correlation. (6.S) ,

Q. 5. (a) Explain the demodulation of FM signal by Foster-Seelye

Discriminator. Give the relevant phasor diagrams.

(b) The pdf of X is given by

Ix (x) = k e - ax fl ( X ) ,i1

I !

, ----~where is positive constant. Determine the value of constant 'K'.I '

I1

(6.5)'

I ,

!

'i: " .!'I '

!i

I•.... !

I, ,

'j " 2. ~. \

,1, ;.

~-,~\

\.. ,r


,.,.

, , I'L~; J

I",l "

;r:':;~l't:l'~,:,:},,11:- ,./)L:.Jt:i .J

l?t{,,!~~t'F';!I\'

}~t,~~~ii~::1·;II.,., lVI,f'I'\"'"Jifil \ -;: ~"1r

K '.

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

Q. 6~ (a)

'. ~

-" UNIT - III': . i.1

, ,~ <, • •

I,

, 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 thatr ',J ,, .. ,

where L is the no. of quantizing levels.

(b) Explain the concept of minimum shift keying (MSK) modulation

technique. '

Q. 7. (a) , What is one bit quantizer? Explain Delta Modulation technique in

detail.

, "

"

Q. 8. (a)

I'

-'

",

(b) Obtain the relation for Impulse response of Matched filter to

m~ximiz;e $NR. List out the properties of Matched filter.ii' :/ i ', '

UNIT - IV

(b)

Define the term Mutual Information. Give the properties of!, \

, ~ ' I,

Mutual. Information.Il

Show 'that Mutual Information is a non negative number i.e.i ~ !"

I(X;Y)~O ,

r • I,; I, "

: I:, ,

3

.-j

f·(j~:;·iV',

I

I\~~.~

,,, ,

, .'

(8)

(4.5) I:I

(6)

(6.5)., ,

• :~.~ I

(6)

(6.5)

i,1.

P.T.O.,, , ,

r:


"r~1(~$;'~)1;::''~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}. '

(i)

(ii)

1 .

Determine Huffman code for this source

Determine Average length of code words

(iii) What is the efficiency of the code?

(b) Determine the LempeI Ziv code for the following bit stream:

01001111100101000001010101100110000

Recover the original sequence from the encoded stream.

•••

~ ~,'

"

!~ ' I

J j'i,

'j

,]

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

-I;.."

, '

: \ ~i .'. \i . ,. ",\

(6)

(6.5)

J' ',1r,~,I'~'"1 I '

,\~~

/

" ')-~-

I.I,II

iI

I, I, ,

1I.

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- ITime: 31-10urs Maximum Marks :75

Note: Q. No. 1is compulsory. Attempt four questions from rest of the questions. I

Q2

Q3

Q4

Q5

Q6

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 + 26Ul Draw the logic circuit to realize the function

Y = ABC + ABC + B

(a) Reduce the given expression to SOP and implement logic circuit----- -- - --- - - -

X =ABCD+ABCD+ABCD+ACD+ABCD(b) Differentiate between analog and digital signal

and demerits.(c) (i) Draw AND-OR logic circuit for Y == AB + AC.

(ii) Replace the AND-ORcircuit by NANDonly circuit.

(5)

stating their merits(2.5)

(5)

(a) Mininize the logic functions using K-map. (2.5)Y(A,B, C, D) ==ITM(0,},2,3,5,7,8,9,11,14)

(b) Solve using K-map and implement using logic gates (5)I(A, B, C, D) = L:m(0,3,4,5,7) + d(8,9,1 0,11,12,13,14,15)

(c) Fig 1 shows a logic circuit. What function is the circuit per forming? (5)

~=J:\~ ~~:L

(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)

(a) Differentiate between edge triggering and level triggering.(b) What is race around condition in SR flip flop? How can

overcome?(c) Convert a SR flip flop into a JK Flip flop

(2.5)it be

(5)(5)

(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 clockpulses. (5)

P.T.O.


'f

l"."

:i.'

, ,

i .

,. [-2-1

(b) Design a 3 bit, synchronous up/down counter with gray code. 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 thecircuit 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.(a) Content addressable manory(b) Unipolar & bipolar logic family(c) PAL& PLAcircuits(d) CMOS logic family(e) Wired AND logic(1) n bit register and n bit latch(g)Dualslope ADC.

------ (2.5x5=~\~'O

************


r

'fllif.:.'t';

I !, ,1,+<--,


END T'ERM EXAMINATION1 FOUR~H SEMESTER [B. TECH], MAY - 2011!

Paper Code: ETCS - 204i .~

"

IV- -" --1--'

I Time: 3 Hours

Subject,' Algorithm Analysis & Design -:

i.-----,,..-------------------------------------,Maximum Marks: 75

, t-

I -Note: Question' No. 1 is compulsory. Attempt any One question from each unit.

, ! ' .

,;

,!;'II':"'Ii!i,iiii'~!ilnI;i .',!,i\)I'_lf.Yll: ;i

Ilft•tI, .\:~:(tlt~~l·'~ ' ~'!'~

'1' ',!'~ .-- t: ",

ii ;~ ;~I

,I! -II

1

Define Bigoh notation... 1'.

(10 X 2'12= 25)

~(c) . What is worstcase running time of quick sort? When does it occur?

(d)

(e)

(f)

(g)

(h)

(i)

'i'

l't. .UI! .

i .

. I

..What do We understand by the "optimal substructure property" in a

\ . . .dynamic programming problem?

I

What is the time complexity of merge sort?

What are union find problems?

Will eitherKruskals or Prim' s Algorithm work correctly on graphsJ' .iIJ

that have negative edge weights? .

I.1

What is np complete problem?

Give an example of dynamic 'programming approach.\

i I

Define Greedy Choice .Property.·

1.

P.T.O ..

iI.

.!:_. J

I


J'

Q. 2. (a)

. i. ~'i

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

Explain the merge sort. Perform the quick sort to sort the following

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.• ! ~

OR

(: .~ .Q. 3. Solve the following Recurrence relation using Masters Theorem:

(a) T(n)=J2T(nI2)+logn

(b) T (n) = 4T (1112) + log n

,(c) T(n)=T(nl2)+n(2-cosn)

'UNIT - II

(5)

(7Y2)

(12Y2)

Q. '4. (a) What dopes Dynamic Programming have common with Divide and (61/2)

conquer and what are th~ differences? Determine the LCS' of < 1,0, 0,

1,0,1,0,1> and < 0,1,0,1,1,0,1,1>

(b) Compare and contrast the following approaches to designing

algorithms:

(i) Greedy algorithms

Divide and conquer!

J -~ ."

. OR1

.1,. ". I

.,'!

,: .

1 ,

2. I~

\,'"

1. !'., .'~!

·1 ;

/'"'\r1 I

1 I~~

';, ..

,-J. . II

Ii

rI

(6) 0·' .(,'.

IIfI'[.j


. i, iI, j . :

~ i ,! ; ~'I

Q.S.:. Consider two :~bams A 'a~d B:,playing a Series of Garnes until one of. ~ '. , f!·'· .' .

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.

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

if the probability of winning a game is 0.4

(iii) Write the Pseudo-code for Dynamic Programming algorithm and

discuss its time complexity.

UNIT - III

Q.6. (a) Discuss Dijkstra algorithm through-an-example.

Q.7.

(b) Describe the dynamic programming algorithm for computing

the'~inimum cost order of multiplying a string of n matrices,,'tI'!if-:~ ;! ' ·Ml* M2*M3*; .... Mn.

OR!t . ;

Write the short comments on the following:. t'·

.: "1 ,'\""l . . .'

(i) Flayed Watshall algorithm, i .I .

. ; I

(ii) Bellman-Ford algorithm ... i." ••....

. .. ,

i,., i 3

.. '-1

,\\

~

~:~.. .>-'.

I .

/

(6)

(6V2)

(12V2)

P.T.O.


I, l :

, ~UNIT ~ IV

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

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 countingv.

the comparisons made to compute the failure function,", I

,j,

lW 'f" 'r.~::l': J~;:{~,~;::,;.

"~of '.

i~~~[]/:',i'billi!j;, .'Iyb:, 1L'f

~I •

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

i:~lii,~';Jb'" -~:~":,;, ~ft!. .' \

Ili!Il",. ,; ',I , .,;t;·;... ~-_Jtlllk,~

OR

•••

--,--

,.~.I "Ir,

Ij

:1';

,j,;

r',

" ,1'.

I·

,, "

f !

I

I :liliI1- i, i

':

* ., ,, '

'/!

, ( .

" ,

:1 '.:

4

'.

()

I: 1

1it~

, , 1ij

( III

, :j

, I

!


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

END TERM EXAMINATIONFOURTH SEMESTER B. TECH. MA v-2UlO

Spbje<;t:$pftware Ecngineering I. , Maximum Marks :75

Note: Attempt all questions. Internal choice is indicated.l

Ql Attempt all questions (5*5=25)(a) What is modularity? List the important properties of a modular system(b) List out requirement elicitation techniques. Which one is most popular and why?(c) What is risk exposure? What techniques can be used to control each risk.(d) Explain the significance of software reliability engineering.(e) Define module cohesion and explain various types of cohesion?

Q2 (a)Define the term "Software engineering". Explain the major differences betweensoftware engineering and other traditional engineering disciplines.- (6)(b) Describe spiral model in detail. What are the limitations of such a model? (6.5)

OR(a) Compare iterative enhancement model and evolutionary process model. (6)(b) List advantages of software requirement specification. Describe the desirable

characteristic\s of a good softwr..re requirement specification. (6.5)

Q3. (a) Explain all the levels of COCOMO model. Assume that the size of an organicsoftware product has been estimated to be 25K lines of code. Determine. the effortrequired to developed the software product and the nominal development time. (6)

(b) Define cohesion and explain types of cohesion with example. (6.5)OR

(a) Explain briefly Putnam Model. Describe the trade-off between time versus cost inPutnam resource allocation model. (4.5)

(b) How function oriented designs differs from object oriented designs? (3)(c) Compute the function point value for a project with the following information

domain characteristics.Number of user inputs =24Number of user outputs = 65Number of user enquiries = 12Number of files = 12Number of external interfaces = 4Assume that all complexity adjustment values are moderate. (5)


.----.

.-~/

Q4. (a) Consider the program given below. Calculate halstead software science metrics(171,172' program volume, program length, program level, effort). (l0)

void maine ) c{int x, y;

scanf ("%d \n", &x);scanf ("%d \n", &y);

while (x ! = y){

if (x> y)x = x-y;

else y = y - x;}

ptintf ("x = %d", x);}

(b) Describe the software quality. Explain various quality attributes in detail. (2.5)OR

(a) What are software metrics? Describe data structure metrics. (4)(b) Assume that a program will experience 200 failures in infinite time. It has nowexperienced 100. The initial failure intensity was 20 failures/CPU hr. (6)

(i) Determine the current failure intensity.(ii) Find the decrement of failure intensity per failure.

(iii) Calculate the failures experienced and failure intensity after 20 and 100 CPUhrs; of execution.

(c) What are the various key process areas at defined level in CMM? (2.5)

Q5. (a) What are various kinds of functional testing? Describe anyone in detail. (6)(b) Describe various maintenance cost estimation models. (6.5)

OR(a) What is software maintenance? Describe various categories of maintenance.Which category consumes maximum effort and why? (5)(b) Consider the program to find the median of three numbers. Its input is a triple ofpositive integers (say x, y, and z) and values are from interval [100,500]. Generateboundary and robust test cases. (5)(c) What is the purpose of integration testing? How is it done? (2.5)


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

END TERM EXAMINATIONMAY-2010Subject: Algorithm Analylsis & Design

Maximum Marks :75Note: Q.1 is compulsory. Attempt anyone question from each unit. I

QL a) Define e, (1and 0 notation?

b) Show the parenthesis structure offollowing graph

c) Define the term polynomial time verification?

d) Write an algorithm for Binary Search?

e) Write down a non recursive version of FIND- SETwith path compression?

(UNIT-I)

(3)

(3)

(3)

(3)

(3)

Q2. a} Write an algorithm for QUICK SORTand show its performance in worst case, average case andbest case? (7.5)

b) Find out the e notation for?

i) 1/3 n3 + % n2 + 1/6 n

ii) Y, n2 -3n

(7.S)

Q3. a) Write an algorithm MEDIAN to get the median element from the sequence S of n elements?(7.5)

b) Consider the following recurrence equation, define a function tin) (7.S)

t(n)= t(n-l) + 2" otherwise

1 if n=O

(UNIT-II)

Q4: a) What is.task scheduling problem? Find the optimal schedule for the following task with givenweights (penalties) and deadlines (

7.5)1 2

d; 4 2

3

4

4

3

5

1

6

4

7

6

w, 70 60 50 40 30 20 10

b) Write an algorithm for lCS (longest Co~mon Subsequence)? Determine an LCSof < 1,0,0, 1, 0,1,0,1> and < 0, 1,0,1,1,0,1,1,0 >? (7.5)

P.T.O.

~\


'it

Q5. a) Suppose the dimensions of matrices A, B, C, Dare 20 x 2, 2 x 15, 13 x 40 and 40 x 4 respectively.What will be optimal number of scalar multiplications? (7.5)

b) Define greedy algorithm? Find the optimal solution to the knapsack instance n=3, m=20, (PI. P2,P3)=(25,24,15) and (WI. W2, W3)= (18, 1S, 1O)? (7.5)

(UNIT -III)

Q6. a) Write an algorithm for BFS?Solve water jug problem using BFS?Let consider two jug one whichcari'store 4- gallons of water and the other 3-gallons of water measure 2 gallons water at large jug? (7.5)

.'.bi. Write prim'5 algorithm? Find minimum cost spanning tree using prim's algorithm? (7.5)

22

.,-- . !

I

Q7. a) Solve the given problem using Floyd Warshal algorhhm.

b) Define topological sorting al'\d strongly connected Co;,lponents?

(UNIT-IV)

(7.5)

(7.5)

Q8. a) Give the text T= 2 3 5 902314152673992 1 and p= 3 1415 and modulo q=13 and m=15solve the problem using Rabin Karp algorithm? (7.5)

b) Write the short note on following?

i) NP- Hard problem

ii) NP-Complete problem

(7.5)

Q9.a) Give the Knuth - Morris - Pratt algorithm for pattern matching. Discuss its performance. and

failure function? (7.5)

b) Describe Hamiltonian Cycle in NP?

Jf. •••.•••••••••••

(7.5)



END TERM EXAMINATIONFOURTH SEMESTER B.TECH. MAY-20lO

~p~~_~ode: ETEC206 Subject: Digital Circuits & System-ITime: 3 Hours MaximumMarks:75[-------------N-o--te-:--A-tt-e-m-p-tfive questions including Q.1 which is compulsory. ~

(3x5=15)logic gates only

.~

.j

Ql (a) Simplify the Boolean Expression AB("ABC + ABC + ABC).(b) Implement the given Boolean expression, using 3~--- -- --

Y = ABCD+ABCD+ABCD+ABCD.(c) Express j(A,B,C,D)= AB + ABC + CD as the sum of minterms and as the

product of maxterms.(d) Minimize the multiple-output switching function given below, using a four

v~able Karnaugh map j(A,B,C,D)= 2:(1,2,6,7,8,13,,14,15)+ 2:(3,5,12). The tI>;

terms are don't care terms .(e) Differentiate between Mealy machine and Moore maching with on example of

sequential circuit.

Q2 (a) Construct a 3xlMUX using 2xl Muxes.(b) Explain briefly the BCD to seven segment decoder.(c) Draw the circuit Two-bit comparator.

(5)(5)(5)

Q3 (a) Calculate the frequency and the duty cycle of an astable multivibratoroutput using IC 555 timer with RA = 6.8KO, R8 = 3.3KO and timingcapacitor C == O.lj1F . (5)

(b) Explain the difference between racing and toggling. (2)(c) Convert the following flip flops (i) J-K into D (ii)T into D. (8)

Q4 (a) Design a detector to detect the sequence 10101 (i) with overlap (ii) withoutoverlap. (8)

(b) Design a decade ripple counter using J-K flip flop. (7)

Q5 (a) A six-bit DIA converter using binary weighted resistor has a 640KQ resistorfor LSB. What is the value of resistor used for MSB? (7)

(b) Explain the principle and working of dual slope integrator AID converter.Also, mention its advantages. (8)

Q6 (a) Compare various logic families like RTL, DTL, TTL, ECL, PMOS and CMOSin terms of- (12)(i) fan in (ii)fan out (iii)propagation time(iv)clock rate (v)power dissipation (vi)noise marginAlso, mention their relative merits and demerits.

(b) Explain the working of static and dynamic RAMcells. (3)

Q7 (a) How does the architecture of PLAdiffer from ROM and PAL? (7)(b) Define the following terms in convertion with DACs:- (8)

(i) Nyquist sampling (ii)Accuracy (iii)Resolution (iv) Settling time

Q8 (a) What are universal shift registers? Discuss various applications of shiftregisters. (7)

(b) What is a Johnson counter? Prove that it can be used as a 2N:1 counter. (8)

••. j

Q9 Write short notes on any three of the following:-(a) TTL logic family(b) Content addressable memory(c) Drivers for display devices(d) Linear Ramp ADC

************

(5x3=15)



END TERM EXAMINATIONFOURTH SEMESTER B. TECH. MA y-20t 0

Subject: Communication Systems & Circuits-IMaximum Marks :75

Note: Q.1 is compulsory. Attempt one question from each unit. IQl (a) Give the range of Microwave frequencies and list the type of

communication systems exists at these frequencies. (3)(b) State and explain the concept of shot Noise. (3)(c) List the practical disadvantages of TRF receiver. (3)(d)Determine the equivalent noise temperature for a noise figure of

10dB. (3)(e) Draw the spectrum for VSB signal. (3)(f) Compare the power relations of DSB-FC and SSB-SC signals. (4)(g) Represent wide band FM signal in frequency domain with the

corresponding equations. (3)(h)Give the properties of White Noise. (3)

UNIT-IQ2 (a) Define thermal noise and describe its relationship to temperature and

bandwidth. (5)(b) Calculate the input signal-to-noise ratio for an amplifier with an

output signal-to-noise ratio of 16dB and a Noise figure of SdB. (7.5)

Q3 (a) Describe the reasons why modulation is necessary in electroniccommunications. Explain the difference between baseband signal andcarrier signal. (6)

(b)What do you mean by band width? Give the bandwidth and range offrequencies for the following communication systems:- (6.5)(i) AMBroadcasting (ii)FM Broadcasting (iii)Television Broadcasting

UNIT-IIQ4 (a) For an AM DSBFC transmitter with an unmodulated carrier power

Pc=100W that is modulated simultaneously by three modulatingsignals with ml =0.2, m2=OA and m3=0.S, determine- (6)(i) Total modulation Index (m)(ii)Upper and lower sideband power(iii)Total transmitted power

(b) Explain the working of Ring modulator for the Generation of DSB-SCsignal. Draw all relevant diagrams and signals. (6.5)

Q5 (a) Define Image frequency rejection ratio. (3)(b) Define the term fidelity and how this factor influences radio receiver

performance. (3)(c) Draw the block diagram of AM Superheterodyne receiver and describe

its operation and primary functions of each stage. (6.5)

UNIT-IIIQ6 (a) Differentiate between angle Modulation Systems and Amplitude

Modulation Systems. Justify with relevant mathematical expressions. (6)(b) Explain the generation of wideband FM signal using Armstrong

method with suitable example. (6.5)

P.T.O.


[-2-)

Q7 (a) What is the purpose of limites in FM receiver? (3)(b) Explain Preemphasis and De-emphasis with respect to noise triangle

in FM systems. (3)(c) Draw the schematic diagram for a ratio detector and explain its

operation. (6.5),UNIT-IV

Q8 (a}State and explain with diagrams:- (6)(i) Aliasing effect

,,·(ii)Aperture effect(b) Explain modulation and demodulation of the following signals:- (6.5)

(i) PWM signal(ii) PPM signal

-t'" •

,/ Q9 (a) Explain the effect of Noise on SSB-SC system performance, assumingthe channel is corrupted by white noise. (8)

(b) Compare the noise performance of Amplitude and Angle Modulationsystems by assuming AWGNchannel. (4.5)

************

£ ! j\ ,

\. II

'tt'l" '.'\

i



END TERM EXAMINATION

Maximum Marks :75Note: Attempt all questions as per internal choice is indicated. I

PaperCode:ETCS210Paperld:32210Time: 3 Hours

I

FOURTH SEMESTER B.TECH. MAY-2010Subject: Computer Graphics

1.~-----_.-

Attempt all parts of the following:(a) Discuss the Gourard shading model?(b) What is isometric projection? Discuss the generation of two vanishing

points projector and its associated projections.(c) Why do we require the frrst and second order continuities in a curve? List

properties of Bezier curves.(d) Explain the Bresenham's line drawing algorithm.(e) Discuss the area subdivision method.

(5x5=25)

2. Attempt anyone part of the following:(a) (i) Derive an expression for rotation about an arbitrary axis in 3D space.

(ii) Derive the transformation matrix for scaling an object by the scalingfactor S in a direction defmed by the direction angles a, ~, 'Y.

(b) Given a triangle having vertices (XhYl), (X2,y2), (X3,y3).FiJid the newvertices of triangle after performing the clockwise rotation about the liney=mx+c.

3. Attempt anyone part of the following:(a) (i) Explain the Bresenham's algorithm for drawing a circle having centre

(h, k)and radius r in the third quadrant.(ii) Discuss the Bezier curves for 4 points using the Bernstein polynomials.

(b) (i) Discuss the Bezier bi-cubic surface patches.(ii) How does Cubic B-spline curves' using knot vectors are drawn? Give

the required expressions. How do we join the curve segment?

4. Attempt anyone part of the following:(a) Discuss the Depth Sorting Method for hidden surface removal. Why is the

Polygon Approximations required? Justify.(b) (i) Explain the terms (1) Diffused reflection (II) Ambient lighting (III)

Spe(.,ular reflection. Give the associated mathematical expression forthese. '

(ii) Discuss the A-buffer algorithm.

5. Attempt anyone part of the following:(a) Explain the procedure of specifying an arbitrary 3D view in projections

with the help of required expressions.(b) (i) What are the different kinds of projections? Explain perspective

projection ane parallel projection in detail with the help of neatdiagrams.

(ii) Discuss the rule of Boolean set operation and regularized Boolean setoperations in solid modeling with examples.

************

(12.5)

(12.5)

(12.5)

(12.5)


END TERM EXAMINATION

Maximum Maries :75Note: Attempt one question from each unit. Q.1 is compulsory. I

••(Please write your Extlm Roll No.)

Paper Code: ETCS212Paper Id: 32212Time: 3Hours[

Exam Roll No..•.•..••..........•...

FOURTH SEMESTER B. TECH. MAY -2616

Subject: Operating Systems

Q1 Answer the following in brief:- (2.5xlO=25)(a) What are the main advantages of multiprogramming?(b) Define the essential properties of Batch Operating System.(c) What are the differences between a trap and an interrupt?(d)Define the differences between preemptive and non-preemptive

scheduling.(e) Describe the actions taken by a thread library to context switch

between user-level threads.(f) What are the benefits and the detriments of each of the following?

Consider both the systems and the programmer's level.(i) Symmetric and Asymmetric communication.(ii)Fixed-sized and variable-sized messages.

(g)Discuss three major complications that concurrent processing adds toan operating system.

(h)Can "busy waiting" be avoided altogether? Explain your answer.(i) What is the cause of thrashing? How does the system detect

thrashing?m In what situations would using memory as a RAMdisk be more useful

than using it as a disk cache?

UNIT-IQ2 (aJ Describe the following allocation algorithms:- (4)

(i) First Fit (ii)Fest Fit (iii)Worst Fit(b)Why are sometirnes segmentation and paging combined into one

scheme? (4)(c) Under what circumstances do page faults occur? Describe the actions

taken by the operating system when a page fault occurs. (4.5)OR

Q2 (a) Why are page sizes always powers of '2'? Explain. (3)(b)Consider the following segment table: (5)

-Segment Base Length

0 219 6001 2300 142 90 1003 1327 5804 1952 96

What are the physical addresses for the following logical addresses?(i) 0430 (ii) 110 (iii)2500 (iv)3400 (v)4112(c) Under what circumstances would a user be better off using a time-

sharing system, rather than a PC or single-user workstation? (4.5)

UNIT-IIQ3 (a) What are the two differences between user-level threads and Kemel-

level threads? Under what circumstances is one type better than theother? (4)

P.T.O.


.~'I

Q3

[-2-]

(b) Show that, if the 'wait' and 'signal' operations are not executedatomically, then mutual exslusion may be avoided (violated). (3.5)

(c) Suppose that a scheduling algorithm (at level of short termscheduling) favours those processes that have used the leastprocessor tille in the recent past. Why will this algorithm favour I/Obound programs and yet not permanently . starve CPU-bound

~programs? (5)"OR

(a) 'Explain the differences in degrees to which the following schedulingalgorithms discriminate in favour of short processes:- (6.5)(i) FeF3 (ii)RR (iii)Multilevel feedback Queues

(b) Write a bounded buffer monitor in which the buffers (portions) areembedded within the monitor it.self (6)

UNIT-III.---,.-1 Q4 (a) Consider a system consisting of six tape drives, with 'n' processes

competing for them. Each process may need two drives. For whichvalues of en', is the system deadlock free. (4.5)

(b)Why is rotational latency usually not considered in disk scheduling?How would you modify SSTF, SCAN and C-SCAN to include latencyoptimization? (8)

ORQ4 (a) Describe three circumstances separately under which blocking I/O

and non-blocking I/O should be used. Why not just implement non-blocking I/O and have processes bU!'l-y,·waituntil their device is ready?Explain. (4)

(b) Is disk scheduling other than FCFS scheduling, useful in a single userenvironment? Explain your answer. (4.5)

(c) Is it possible to have a deadlock involving only one process? Explainyour anSwer. (4)

UNIT-IVQ5 (a) Systems that support sequential files always have an operation to

rewind files. Do systems that support random access files need thistoo? Why or why not, explain. (4.5)'

(b) Some systems provide file sharing by maintaming a single copy of afile, other systems maintain several copies, one for each of the userssharing the file. Discuss the relative merits of each approach. (4)

(c) Why must the bit map for file allocation be kept on mass storage,rather than in main memory? Explain. (4)

ORQ5 (a) An operating system only supports a single directory but allows that

directory to have arbitrarily many files with arbitrarily long file names.Can something approximating a hierarchical file system be simulated?How? (5)

(b) Why is it advantageous to the user for an operating system todynamically allocate its internal tables? What are the penalties to theoperating system for doing so? (4)

(c) Some systems support many types of structures for a file's data, whileothers simply support a stream of'bytes. What are the advantages anddisadvantages? (3.5)

************


(please write .your exam. roll /11,0.) exam. roll no . te ... · ~.i • (b) differentiate between...

Documents