No.) Exam. Roll No '• i, , END TERM EXAMINATION TERM EXAMINATION' . FOURTHSEMESTER RTECH....

Northern India Engineering College, New Delhi

----IT w~.

i, ,

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

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

" ; ; Paper Code : ETCS - 202" I.

.' 1-,

. \~'\ ~

Subject: Software Engineering

Time: 3 Hours Maximum Marks: 75

': " Note : Attempt All questions. Internal choice is indicated. ::f

II

IIif.•.• ~ •.!:

:..':.." '

Q. L 'Give a short answer:. ' .

,'( I"'~

'. :

.-)

.. t",

• r-,

"""", .:

(d)

L J~), .. , ,i -

I' ,, I,I,;" I. '1"1"'9':~-~

..." .1"

(2.5 x 10)

(a) What is software component?,I

! 'l

(b) Distinguish Iterative Enhancement model and Evolutionary Process

model. i"

(c)..

What are the different activities in Requirements Analysis?

What are the different dependencies present in Use Case Diagram?ii

What are the different techniques to estimate size of the program?

Which technique is better and why?

Cf)' What are .the different activities of Risk Management?

(g) Differentiate Quality attribute and Quality criteria giving example, I

i

of each. 'I

. !(h) What are the different CMM level? What does CMM level

specifies?

(i)

, 1 P.T.O.


~------------

.;,.>,,,-

-::" --"1r ~. -- ,. '

l.." .

i:'( ; .

.-;~ .

.j

i,",,. ,

,. -!

"

-'.i·

: r'

I'

~ .\. :.

! .~-/-, ~/

I

Q.2.

,.

--

Draw"neat sketch of Spiral ~odelland explain its different activities.I -

What do the different cycles indicate in this model? What are its

advantages over traditional Iterative Process models? Why it is noti

'suitable for small. projects?t ;

l ';,OR

(a) Why Requirementsare hard to elicite? Explain the Requirements

elicitation technique Use Case Diagram using example of ~anking

system.

(b) How are DFD and ER Diagram useful in requirements analysis?

(12.5)

(6)

.:(2.5)

(4) .

Q. 3. (a) What are the advantages and disadvantages of Intermediate version (4)

of COCOMO over Basic version of COCOMO.

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

Quality Characteristics of SRS?

(b) Dra w the flow diagram to calculate efforts and duration of project

using advanced version of COCOMO.

(c) How productivity and efforts are measured using Putnam

Estimation mode?

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

1 •

they play in software design? Describe the, properties of best

coupling and cohesion giving examples of each.

I,I

2

.'

(4)

(4)

)V';\~: .~ ,

, "

..

iIII


\.,',.'7"

, . 'f i .

, :

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

drawing. structure chart?

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

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

having

",' .

" '\t: \. 'i ." ~ •

! '. "" !., ,; ..' ... :1

'~..I~'''~f\;,' :..":

1.,1') ::,:,Ir~::j.t! ''!itl;)I',~,}~!:J

',:jtr,!'--,p.l ~ 'j

"~:;~~1'

4~:"~j., ;I.~'

101t·jr:-l ..::"":"). . . J ~

',. • I~J .

': ,':.r~i.Ii,'

,",il!

J .\,., .: ,r't

Number of distinct operator: 12

Number of operands: 5

Total number of operatoroccurrences : 20

Total number of operand occurrences: 15

Calculate the different Halstead software metrics for above

programs ..

'. (b) What are information flow metrics? How they are calculated for a (6.5)! .

given structurechart? What is the purpose of data structure metrics?:'- f

I \: IL 1

1

OR

(a) For a logarithmic poisson execution time model initial failure (6)

intensityis 15 failures CPU hour, failure intensity decay parameter

is 0.025/fai1ureand failure experienced are 65. Compute the current. : f .

failure intensity.; )

(b) .Explain McCall's model of quality. How it is different from (6.5)- l

Boehm.quality model?

3

"-:-l' "-.. - ... .

I

(4)/'

(6)

P.T.O.


"

• '~_',~ . I.

.f :

i ' •..~'/-I-

I' ,.

.Consider a program that input two integers having values in range1 .

(l0, 250) 'and classifies them as even or odd. For this programI

. generate: ;"

(i) Test cases using Boundary value analysis

(b)

Equivalence Class testing. ! ' .

i

Explain the steps to perform path testing using flow graph with

the help of suitable example.

(ii)

OR-J

(a) What are the different levels of testing and their purposes?

(b) Explain any two models of Software Maintenance.

(c) What is the difference between reverse engineering and

reengineering? Explain different steps of reengineering .

•••

4

I\i~.~,.,YoI I

(6)/

(6.5)

I[

(3)

(5)

(4.5)

. i


___ 0.···

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

Exam. Roll No : : .

END:T'ERM EXAMINATIONFOURTH SEMESTER [B. TECH], MAY - 2011

Paper Code : ETCS - 204,. ,

·,·r

Subject: Algorithm Analysis & Design /


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

Q. 1. (a) Define Big oh notation .

(c)

(d)~

I

~:;(e)

Cf)(g)

,,

t~,~:~~~~)

(b).", ,.-;

Arrange the following in order of best to worst efficiency:2 ' ?' 2 ,fo (n 10gn), 0 (n- ), 0 (n"), 0 (n log" n).(4)

(h)

(i)

What is wo-rst case running time ciCqulCk sort? When does it occur?

What do w.e understand by the "optim~1 substructure property" in a" '

dynamicprogramming problem?!,

What is the time complexity of merge sort?\ I .', I

What areimion find problems?I 'I, I I

Will, eithcrtKruskal' s or Prim's Algorithm work correctly on graphs1 ;

that hav~ negative edge weights?i !

What is np: complete problem?; 1,

Give an example of dynamic programming approach.~ r .: i

Define Greedy Choice Property.~ I ..

, ,

PT.O,


'fl ,~' .. -';. I J

", . t

, "

1'" :t. :1 '.

UNIT - I

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

numbers.

, ''', " --... ~,

.: ,:,."" ,4",_

,-, i: I

":'

'1":( .J, .

,1 ,

20 40 50 15 10 05 80 90., (b) , .Discuss the order of Complexity -OfMatrix Multiplication using

" '

Strasseri's algorithm.. ~ .', ••.....

I ::

Q. '4. (a)

OR

(7V2)

!j

Solve, the foqo~ing Recurrence relation using Masters Theorem:

(a) T/n)=j:iT(nl2)+logn~ . . r !r I!o» T(n)=111(nl2)+logn

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

I '

1 ;j

UNIT - II, [

What dopes Dynamic Programming have common with Divide and (61/2)f ;

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

1;0, 1,0,'1 > and < 0,1 ,0,1,1 ,0, 1, 1> ',i• 1

(b), ;

Compare: and contrast the following approaches to designingi j

algori thms :

(6)

(i)

(ii)

Greedy algorithms

Divide and conquer

(iii) Dynamic programming

OR

2

I',:.y~·~,I ~'

1 II

I.-.t~

i J--'

" .'\

!


Consider two Teams A and B',' playing a -Serie~-of Games until one of• 1

the Teams wins n games, Assume that the probability of A winningI '

a game is the same for each game and equal to p and the probabili.ty of

A losing a game is q = l-p. Let p (1, J) be the probability of A winning

Q. S.

,the series if A needs 1 more games to win the series and B needs J more

',! ' ,games to win the series, ,

i ! I

Set up a recurrence relation for p (I, J) that can be used by a dynamic! I" '

programmjinjg algorithm ' .i I

(ii)' .Find the Probability of Team A Winning the Series of Seven games,\ j!' .

if the probability of winning a game is 0.4. I

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

discuss its; time complexity .

(i)

.,';

i.UNIT - III

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

(b) Describe the dynamic programming algorithm for computing

theminimum cost order of multiplying a string of n matrices

'Ml * M2* M3* ..... Mn.

OR

, "

('~)r:\.'t-:.~i:"{~4:,·.

" '

Q. 7. Write the short comments on the following:

(i) 'Floyed Warshall algorithm

(12Vz)

(ii) Bellman-Ford algorithm'

",i' ,,' ,,;,,

3 P.T.O.

".\

,i,, !

"

j

-:

Northern India Engineering College, New Delhi'" J

'J"

, ' .~.

....

,.r"l'f~~.~.0'1'"

I .

l~~

..::..-,

,-' UNIT - IV

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

/.:

OR

Q. 9. For thegiven Te'xt T= "aaabaadaabaa" andpattern is "aabaa", (12Y2)

illustrate the comparisons done. by naive Strin.? matching algorithm.

Repeat the s~lution forKMP Pattern matching algorithrr, by not counting'. ,.

the. comparisons made to compute the failure function.

--------

••• . J

. ,!~.

I '

I -II iI I

I II I; Ii. !, I!' 1

~ ~

..

I !I

',i

I

,1

4

.v,


~-·-IIi

(Please writeYl!..ur Exam Roll No.) Exam Roll No .

END TERM EXAMINATION' .FOURTHSEMESTER RTECH. MAY-JUNE-2011

Paper Code: ETEC206 Subject: Digital circuit & systems- ITime: 3 Hours Maximum Marks :75

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

Q1 (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 (10 1l}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 + 26U) Draw the logic circuit to realize the function

Y = ABC + ABC + B

Q2 (a) Reduce the given expression to SOP and implement logic circuit- (5)---- -- - --- - - -X = ABCD+AECD+ABCD+ACD+ABCD

(b] Differentiate between analog and digital signal stating their meritsand demerits.

(c) (i) Draw AND-OR logic circuit for Y = AB + AC.(ii)Replace the AND-OR circuit by NANDonly circuit.

(2.5)(5)

Q3 (a) Mininize the logic functions using K-map. (2.5)YeA, E, C, D) =I1 M(O,I;2,3,5,7,8,9,ll,14)

(b) Solve using K-map and implement using logic gates (5)f(A, E, C, D) = 2:m(O,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)

Q4

~=f\~ ~~:L

(a) Design a full subtractor using two half subtractors and a logic gate. (5)(b) Implement Y (C, B, A) = 2: m (0, 2, 4, 6, 7) using a 4: Lmultiplexer. (5)(c) Implement a 3 input majority gate using decoder. (2.5)

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

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

(2.5)it be

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

P.T.O.


: j "

.----:1,II

, ,:",1

[-2-]

(b) Design \ a 3 bit synchronous up/down counter with gray code- sequence.rThe counting should be up for E = Orand 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 & PLA circuits(d) CMOS logic family(e) Wired AND logic(f) n bit register and n bit latch(g) Dualslope ADC.

(2.5x5=a)\~.~

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

. ,


~

:I. ,~,""

I

(Please write your Exam-Roll No.)

," '

.\:, e'

Exam. Roll No ,..

END 'TERM EXAMINATION":FOURTH SEMESTER [B.TECH.), MAY - 2011

Subject: Communication SystemsPaper Code: ETIT - 208

Paper ld : 31208

Time: 3 Hours --- .Maximum Marks: 75

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

';. :""1

: .:.~'.i::!

.".:!.: !. Q. 2. (a).!.. '~~' ..

,~> "; . '", ,"

.\

,.- ,";.'',' :;,.;,'

., .. /~.j,:.. :~",

(c)

Explain the need of modulation in communication systems., :! " '

iReprese9t D~B:~SCsignal in frequency domain and draw the

spectrum. :1

DistingUishJ~~ween natural and flat top sa~pling.! i

Define the teri'cross talk' and where it will exist?

Explain thet&JnDeviatibn Ratio with respect to FM ..

Giv~ the exp~e~Sion for pdf of Gaussian Distribution.Ii

Define the term companding and explain its significance:, ,I

(3)'!,

-:~(3)

(4)

Cd) (3)

(e) (3)

(f) (3)

(g) (3)

(h) Give the advantagesof orsk over BPSK.P i! j

"'II

(3)

l"

UNIT-I

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)

------ P.T.O.


.(I

1-I

I

I

Q. 3. (a)

_\

---"'1-. I

I.;.

~ I', - ~D,escribe the method of generating Flat-top sampled signal.

Represent flat-top sampled signal in time domain and freqcuncy

domain]

(b)} . .

Obtain the relation for modulated bandwidth of1 !

(i) _Pft...Msignal~ f

(6.5)

(6)

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

<>, !

•• ,,0,

I '.: .

(ii) PWM signalit '\

(iii) PPM siznal -. '--

, e

UNIT - II

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

and w are constants and e is uniform random variable over [-IT, IT]

is ergodic in both the mean and auto correlation. (6.5)

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

Discriminator. Give the relevant phasor diagrams.

(b) The pdf of X is given by ---i;.(x) =ke -ax ~(x)

I .' - \where is.positive constant. Determine the value of constant 'K'. (6.5)

i ~ 1 •

; .

J!! .I

I!rIi1,-!t,

2

.J

iI:IIII

I

•-e


I' '.

j ....

" "I•• "'!

, '.I' ..--~ 'I';'. ",., ,', ,

ii

t ',

.1·

'. '

:'.g:

• '1,1"

"1'

,,:,:' .

\ '\

~: ;

s , , :

"j ,','

I'

Q. 6. (a)

UNIT - III: i

The output signal to-quantizing-Noise Ratio (SNR) in a peM system. i ' 0

is defin~q as the ratio of average sjgnal power to average 'quantizing

noise power. For a full scale sinusoidal modulating signal, with

amplitude A, show thatI

(SNR)o =i(~J' =~ L2N 2

': q 0

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.

i, ,

Q. 8. (a)

Obtain the relation for Impulse -response of Matched filter to. '

mtximiZ~ SNR. List out the properties of Matched filter.

(b)

I • .i.!

.1'! I• i UNIT - IVl f

D~find t~e term Mutual lnformation.iGive the properties ofI ~ t 'I 1 I '

Mutual Information..: r I " .Show th~t Mutual Information is a non negative number i.e.", ii' ' ,

I Irrx, Y)40

f.. !"1 'I

III 3. ;

)

i,. ,, I

L, t::T'; 1- "

I )

I',"~r

:'1" •

. .~~! :.••~

", '~

(8)

(4.5)

(6)

(6.5)

. (6)

(6.5)

P.T.O.


Q. 9. (a)

.c.--- '~'il. ,

. I

!

~'.

Consider a DMS with source probabilities {0-35, 0-15, 0-2, 0-05; 0-25}•. I .(i) Determine Huffman code for this source

(ii) Determine Average length of code words

(b)

(iii) What is the efficiency of the code?I .:

Determi~e theLernpel Ziv code for the following bit stream:. , i

; I

010011111dololOOOOOlOlOlOl100110000.; . . ; IRecover the ;otiginal sequence from the encoded stream .

I !

•••

.l

4

(6)

(6.5)


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

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

Paper Code: ETCS - 210

Paper ID : 32210

Subject: Computer GraphicsI.


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

Explain the advantages of the representation in homogeneous•coordinate system for 2D and 3D.

What is the relationship between the rotations RS, R-S and R -IS

How is Bezier surface formed?

(5 x 5)

Distinguish between perspective and parallel projections.

What is the Back-face detection?

UNIT -I

What steps are required to plot a line whose slope is betw~e~ 0° and (6)

45° using Bresenham's method?

Perform a 45° rotation of triangle A (0, 0), B (1, 1), (5,2). (6.5)

Find the form of the matrix for reflection about a line L will slope m (6)

and y intercept (0, 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 theCohen-Sutherland algorithm clip the line segments AB and CD

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

1 P.T.O .

.~~ \.,

-.~ . 'c


i 1r .1_,rPlfaSewrite your Exam. Roll No.)

II .!

Paper Code: ETCS - 212 ' Subject: Operating Systems

Paper ld : 32212 ~I!

Time: 3 Hours.. .. Maximum Marks: 75j i

Noie : .AttemptOne question from each unit. Q. No.ll is compulsory.

" i

:Q. 1. Answer to the point and in brief: '(21/2 X 10)

..

;'.'~'''11·:. ( ..." " .

i·

;:- ..

'I ••

i.

..

..,.." ','

I.Q"~·'·2.:_ ,L·;(

. .: l•. ' .1.

II '.

I. ;

.-j ~ :',,~-\~\~'-~~'.'--' ?

Exam. Roll No .

E'ND TERM;EXAMINATION'FOU~TH SEMESTER [B.TECH.], MAY - 2011

-:

,.~,...;... .

. ;.

(a) Describe the layered approach of am operating system.

(b) Differentiate between a· multiproce sing and multiprogramming.

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

(d) Discuss three major complications t at concurrent processing adds

to an operating system.

(e)

(f)

What is an RTOS? Define its basic Kernel services.

Differentiate between - a thread an! a process.

What is deadlock? Can a single proress have deadlock? '

Discuss, the concept of 'overlays' a implemented in an operating

system.

Compare - Interrupt and Polling.,

oj'

(g)

(h)

(i)

(j) Write a short note on - Windows 7.---'-'-

(a)

UNIT - I

Why • w~ need an operating systelrl? Compare an as for a PC'and an OS for a mobile .

t i ,

Differenti~tb between ~ a parallel as and a distributed OS.(b)

P.T.O.,


'.,

1~. r,/·-·FI::

I !1I.i

Q. 3. (a) Differentiate between --,

(i)

(ii)

,Contiguous and Non-contiguous Memory. ,

Physical address and Logical address

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

Q. 4... (a) What are. the goals of a good scheduling algorithm? Discuss,i

Preemptive: scheduling and Non-preejnptive scheduling by taking

a suitable example.

(b) Differentiate between - User level threads and Kernel level

threads? HGW 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.

(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.(3+3+3+3V2)

.UNIT - Ul------

Q .. 6. (a)1

IDifferentiate between - Disk Scheduling and CPU 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 ~~s at cylinder 145. The queue of pending requests is :i ;' j!

233,1456,125,91,789, 1600,2345, 13, :

,i

iIi.I,

(b)

2

...•...:; ~,.r.~~.~>~4-%.~

.,;~


J. •, ;, I-

; .'

Q. 7. (a)

,, . '

~ ,"L~/ (b)1-;, 'I

. \;! (c)

(d)

.l. .• ', '.:,

1"

starting from the current head position, what is the total distance

(in, cylinders) that the disk arm moves to satisfy all the requests

for ELEVATOR algorithm?

Cc) Differentiate between - Blocking and Non-blocking 110

(d) ,Consider a system having 10 tape drives, with 'n' processes

<;blJIpeting for them. Each process may need three dri yes. For how

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

Differentiate between Inter-RecordGrap (IRG) and Inter Block1

Gap (lBG). !, "

Which type of disk-scheduling is better in an OS? Give suitable

example in.support of your answer. ,.'. . 1 ! .

Differentiate :petween buffering and spooling.I I I

What i~ a resource allocation graph? How does it help in detectioni '

of a deadlock:? Depict two different scenarios in which five, , I

different processes are :! I

(i) . deadlocked and:. i

Cii) "not d~aCilocked.

( .r

UNIT - IV

(b)

, , '

Assuming a 'cluster size of 512 bytes calculate the percentage. 'I '

wastage in file, space due to imcornplete filling of last cluster for; \

. a file of siz< 1pOOO bytes.

, What is meant.by an 'alias filename' and explain its UNIX, .

, implementatio~?

What are thetradeoffs involved in rereading code pages from the

file system as compared to using swap space to store them?(c)

3

. (4+4+4V2)

P.T.O.

/

, .1!I,I

Northern India Engineering College, New Delhi~:. .' ..

• ;'f p'

J '

;,,:.' '

. ,'.i.; ,

iff··\

. i. ~

:, .

i'

.'"

. (

f

1-, I'IJ

..1

.' .

.,

. J

,,

\.....•..,,-1 ('....>!-_ ..-

,~ .r :1/.L', ,

r :

(V~~'I -, I

iiw

Q. 9. (a) -Differentiate between' .•

(i) FAT16andFAT32

(ii) Conventional 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 as by using these.i

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

II'!I

I

•••

Exam Roll No .['7 flZ @ cD

END TERM EXAMINATION(Please write your Exam Roll No.)

FOURTH SEMESfER B. TECH. MA y-201 0

Subject:.-~fJftware Eng~neerlngMaximum Marks :75.,

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

:J~\;t"'.:\·, /', Paper Code: EfC.S202.Time: 3 Hours.

I

.~,

~/

Q1 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?

(6)desirable

(6.5)

Q2 (a)Defme 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.(b) List advantages of software requirement specification. Describe the

characteristic\s of a good softwr.re requirement specification...

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 =24Nmnber of user outputs = 65

\ ..../ Number of user enquiries = 12Number of files = 12Number of external interfaces = 4Assume that all complexity adjustment values are moderate. (5)


J,

.~.j

Q4,,(a) Consider 'the program given below. Calculate halstead software science metrics,(1}1.112' program volume, program length, program level, effort). (10)

void main(){int x, y;

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

{if (x > y)

x =x-y;else y = y-x;

}printf("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 hI. (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)

.~.j

Q5. (a) Whatare 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)nput is a triple ofpositive irttegers (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 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. I

Ql (a) Give the range of Microwave frequencies and list the type ofcommunication 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)(el) Determine the equivalent noise temperature for a nOIse figure of

lOdE. (3)(e) Draw the spectnlm 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) AM Broadcasting (ii)FM Broadcasting (iii) Television Broadcasting

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

Pc=lOOW that is modulated simultaneously by three modulatingsignals with ml =0.2, m2=0.4 and m3=0.S, determine- (6)(i) Total modulation Index (m)(ii)Upper and lower sideband power(iii}Totaltransmitted 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.


Exam Roll No ....•.......•...•.....•CDEND TERM EXAMINATION

(Please write your Exam Roll No.)

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

PaperCode:ETCS210Paper Id: 32210Time: 3 Hours

I

FOURTH SEMESTER B.TECH. MAy-lOlOSubject: Computer Graphics

--~._--- ----- ..__ . - .__ .

1. Attempt all parts of the following: (5x5=25)(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 first 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.

2. Attempt anyone part of the following: (12.5)(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 dermed by the direction angles a, ~, y.

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

3. Attempt anyone part of the following: (12.5)(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: (12.5)(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)

Spel.ular reflection. Give the associated mathematical expression forthese. .

(ii) Discuss the A-buffer algorithm.

5. Attempt anyone part of the following: (12.5)(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 anElparallel 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.

"''''''''''''''''**''''''''''''


(3)(5)

(4)•

Se ment . , Base l.1en tho 219 6001 ,2300 14r2,190 1003 1327 5804- i952 96

What are the phys,ical addresses for the following logical addresses?(i) 0430, 1 (ii)/l to (iii) 2500 (iv)3400 (v)4112 ,(cl Under what circumstances would a user be better off using a time-

sharing systen?' rather than a PC or single-user ~rkstation? (4.5)~r

i ,::" ' i: UNIT" III' '. I l" :-(al What ar.e the !two differences between user-level threads and Kemel-

level threads?IUnder what circumstances is one type better than theother? ,, I (4)

i P.T.O.iI

I I

Q3

Q2

Q2

Ql

I,I

Paper Code: ETCS212Paper Id: 32212Time: 3 Hours

, L'

cD, (Please write your Exam Roll,No.), E'<:l11l1 Roll No .

~ :ENl) '1rERM EXAMINATIONFOURTH SEMESTER U.TECH. MAY-2010

Subject: Operating Systems ~

; i ; i , Maximum Marks :75 'Note: Attempt ~ne question from eac11unit. 0.1 Is compulsory. I

t" .

Answer the following in brief:- (2.5xlO=25)(a) What ar~ the tnatn advantages of multiprogramming?(b) Define the essential properties of Batch Operating System.(c) What are the dif~erences between a trap and an interrupt?(dl Define the diff~rences between preemptive and non-preemptive

schedulihg. f"

(e) Describe, the 8.ctions taken by a thread library to context switchbetween user-level threads.

(f) What are Lhe!benefits and the detriments of each of the following?Consider both tqe systems and the programmer's level.(i) Symmetric' arid Asymmetric communication.(ii)Fixed~sized ahd variable-sized messages.

(g) Discuss three: IJJ!ajorcomplications that concurrent processing adds to.' " !an operating sy~tem.

(h) Can "busy Waititlg" be avoided altog~ther? Explain your answer.(i) What is the' ~ause of thrashing? How does the system detect

thrashing? "m In what situations would using memory as a RAMdisk be more useful1 .. I " l' 1 h ? 't lan u smg 1t.as, a (1.13 <: cae e.' "

, ~.~,I UNIT-I

(a) Describe P1C fol!owing allocation algorithms:-(i) First F.H f.iiYPcst Fit (iii)Worst Fit

(b) Why are' ::;ome't.i.messegmentation and paging' combined into onescheme?: ..!. (4)

(cl Under whatcir¢umstances do page Jaults occur? Describe the achonstaken by the operating system when a page fault occurs. (4.5)

; OR_(a) Why are page sizes always powers of '2'? Explain.(b) Consiclerthe following segment table:

\ ~.. \

".. [/

,, '

i '

f'I,r ~,


[-2-]

Q3! .)

j

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

(c) Suppose' that a scheduling algorithm (at level of short termscheduling) favQ.urs those processes that have used the leastprocessor time in the recent past. Why will this algorithm favour 1(0boundprograITi~ and yet not permanently starve CPU-boundprograms? : l (5)

j OR(a) Explain the differences in degrees to which the following scheduling

algorithms discliminate in favour of short processes:- (6.5)(i) FCFS' I (ii)!Rk (iii)Multilevel feedback Queues

(bl Write a bounded. buffer monitor in which the buffers (portions) areembedded,~thiI}. the monitor itself. (6),.

UNIT-IV I,

(a) Systems that s;upport sequential files always have an operation to.rewind files.' Dd' systems that support random access files need thistoo? Why or Why not, explain. (4.5)

(b) Some 'systems provide file sharing by maintaining a single copy of afile, otheIj sy~t~r,ns maintain severa~copies, one for: efl-chof the userssharing the file.!Discuss the relative merits of each approach. (4)

(c) Why must thefbit map for file allo~ation be kept on mass storage,rather than in thain memory? Explain, (4)

. '! i OR,(a) An op~rating system only supports a single directory but allows that

<:;lirectoryto have arbitrarily many files with arbitrarily long file names.Can something:approximating a hierarchical file system be simulated?How? .' 'I (5)

(b)Why is it adv;antageous to the user for an operating system todynamically allocate its internal tables? What are the penalties to theoperating systef,n for doing so? 1 (4)

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

I . j: , I: ************

UNIT-III(a) Consider a system consisting of six tape drives, with 'n' processes. competing' foi-jt~em. Each process may need two drives. For which

values of 'n', i~ tlle system deadlock free. (4.5)(bl Why is rotationd1 latency usually not considered in disk scheduling?

How would you modify SSTF, SCAN and C-SCAN to include latencyoptimization? (8)

OR(a) Describe three ~ircumstanccs separately under which blocking 1(0

and non.-bloclcirig I/O should be used. Why not just implement non-blocking'I/o :~n~ have processes busy-wait until their device is ready?Expl9in. ; ,;. r (4)

(b) Is disk..sclledy.ling other than FCFS scheduling, useful in a single userenvir;of1mdnt? E~plain Y011f answer. ;, . (4.5)

(e) Is it .P9ssible to/have a deadlock involving only one process? Explainyouriahswer, , \. (4)

l ~ ,,! ~, Ii: :

! ; : ! ; 1 1 :;.~

Q5

Q5

i j

Q4

Q4

,. ,

f

, 'I", ,Ii

1,

I,\ .

, l .

" 1


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

END TERM EXAMINATIONMAY-2010Subject: Algorithm Analylsis & Design

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

Q1. a) Define e, 0 and 0 notation?

b) Show the parenthesis structure of following 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 and

best case? (7.5)

b) Find out the e notation for?

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

ii) Yz n2 -3n

(7.5)

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

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

Wi 70 60 50 40 30 20 10

b) Write an algorithm for LCS(Longest Common Subsequence)? Determine an LCSof < 1 0 0 1 01,0, 1> and < 0, 1,0, 1, 1,0,1, 1,0 >? . , , (;.5') ,

P.T.O.


(UNIT -III)

i"

[-2-]

QS. a) Suppose th¢ dimensions of matrices A, B, C, Dare 20 x 2,2 x 15, 13 x 40 and 40 x 4 respectively.What will be optim~1 number of scalar multiplications? (7.5)

b) Define greedy algorithm? Find the optimal solution to the knapsack instance' n=3, m=20, (Pl, P2, P3)=(25,24,15) and (Wi, W2, W3)= (18, 15, 10)? (7.5)

~ I

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

b) Write prim's algorithm? Find minimum cost spanning tree using prim's algorithm? (7.5)

22

!1-·!

.~L/

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

b) Define topological sorting and strongly connected cor,'ponents?

(UNIT-IV)

(7.5)

(7.5)

Q8. a) Give the text T= 2 3 5902314152673992 1 and p= 31415 and modulo q=13 and m=15solve the prQt:Jiemusing 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)

1

j

b) Describe Hamiltonian Cycle in NP? (7.5)


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

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

l!§p!~~ode: ETEC206 Subject:Digital Circuits & System-ITime: 3 Hours MaximumMaries:75

[---------------N-ot-e-:- A-tt-em-p--tfive questionsincluding Q.1which is compulsory. I

Ql (a) Simplify the Boolean Expression AB(ABC + ABC + ABC). (3x5==15)(b) Implement the given Boolean expression using 3 logic gates only

---- -- --Y = ABC D + ABC D + ABCD + ABCD .

(c) Express f(A,B,C,D)= AB +ABC +CDas the sum of minterms and as theproduct of maxterms.

(d) Minimize the multiple-output switching function given below, using a fourvariable Karnaugh map f(A,B,C,D) = .2:(1,2,6,7,8,13,14,15)+.2:(3,5,12). The 4>

~terms are don't care terms.

(e) Differentiate between Mealy machine and Moore maching with on example ofsequential circuit.

Q2 (a) Construct a 3x1MUX 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.8Kn, Rs = 3.3KQand timingcapacitor C == O.I,uF . (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)

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

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

(Sx3==lS)


No.) Exam. Roll No '• i, , END TERM EXAMINATION TERM EXAMINATION' . FOURTHSEMESTER RTECH....

Documents

Transcript of No.) Exam. Roll No '• i, , END TERM EXAMINATION TERM EXAMINATION' . FOURTHSEMESTER RTECH....