BTS(C)-vI- 04.

12- 011-J

B. Tech Degree VI Semesler Examination Aprit 2012

CS 60I

COMPILER CONSTRUCTION
(2006 Scheme) Maximum Marks : 100 PAR.T A
(Answer

Time : 3 Hours

2!!f questions)
(8 x 5

:40)

I.

(a) (b) (c) (d) (e) (0 (g) (h)

Define tokens, patterns and lexemes and give exarnples, What is the role of finite automata in compiler design? Distinguish between top down and bottom up parsing. Mention the names onetop down and boftom up pnsser. What is an operator grammar? Give example. Distinguish between synthesized and inherited attributes with examples. What is an activation record? Explain its role. Define basic block. Give an example. Explain any two code optimization techniques with example.

of

PART B
(4 x 15

:60)
(ts)
(10)

II.

rtrith a neat diagram, explain the different

input and output ofeach

phase.

phases of a

compiler. Mention the

ru.
ry.

OR
(a)

Explain input buffering.

What is the sigrrificance of lexical analysis phase in compiter design?

(b)

(s)

Compute the FIRST and FOLLOW of the grammar and construct the predictive parsing table. E -+TE' T

(l 5)

E'-++TE'/ E -+ FT, T'-+*FT'/ E

F

-+(E)tid
OR

V.

(a) (b)
(a)

Define closure and goto operation ofLR parser. Explain LR parsing algorithm.
What are the diffqrent parameter parsing techniques? What are the data structures used for the implementation of a symbol table?

(s) (10) (8) (7)

VI.

(b)

Explain

OR

vII. vm.
(a)

With an example explain the bottom up evaluation of S-attributed definition.

(b)
What are the different types of three-address statements? What are the various methods to implement three address staternents?

1s)

(8) (7)

x.

OR
What are the issues in the design of a code generator? Explain.

(l s)

BTS

(C)-U -04.12- 0t2-i

B.Tech Degree W Semestet Examination April 2012

CSTEE 602

DIGITAL SIGNAL PROCESSING

(2A06 Scherc)

Time : 3

Hours (Answerltr+questions)
PART A

Ma'ximum Marks : l0o

(8x5=

4o)

I.

(a) O) (o) (d) (e) (9 (g) (h)

Find the discrete quation

x

r[r]

for the sigrral x(r)glven below, when

it

is

sampled with a sample period

of T = 0'003 seconds'
if it is digitized by an,ADC

(r) = 2 sot 1 t st\ + z as(zoto'+t)

Transform of the following signal Derermine the with Period T - 0.03 seconds

*-

x(t)=Yn

cos(zsr)z(r)

Given the DFS of the sequence

Given the sequence Radix
each.

i(r)

as

*(f),

what is the DFS

of i'(z)?

Derive the result. (* represents complex conjugate)'

x[n]=[t,&2,6f

compuGthe

FFTX(K)

usingRadix-2 and

-4

algorithms. Compare the achral number of multipiications Iquired for

group Show ttrat an FIR filter with antisymmefic impulse response has conshnt phase delay' delay, but not constant rmplement y(n)=x(n)+2x(n-l\$x{n-2\in Direct Form and transposed

Direct Forrn.

if"* it"itfr

variance of the qoanti*tion noise is 52/12, where s is tlre quantization steP size. Witf, a neat tabular colum& oompare the features of fixed point and floating point
DSP Processors.

PART B

(4x15=60)

il.

(a)

Test whether the following qyst,ms are

linear

(5)

(,)

y(,)=f!,t,-,)
f'fu- *)+c, c
| +{r(r
+g
a constant

(ii) y(z)=f

(b)

The difference equation of a simple filter is gtven

by

(10)

(n)

a, 1n-

+}x1"; +} x(n *r)'

Find

(i) (ii)

The sYstern function The impulse response represents

Is the above system realizable if'n' realizableif 'n" is aspatial variable?

a ternporal variable? Is it
(S)

m.

(a)

A system is defined by the following

* equation,

y(r)

+[r(r

+1)

+x(r) + x(z -r)]

Find the system function, its polgs and zeros'

Hence plot the pole-zero pattem of the system

(P.r.o)

O)

Determine the inverse

x(*)=fu
l-el>r

#-

transform

of

(7)

ifthe Ro'c

are

(i)

(ii)

l-l<+ (iii) +<l*l.r

IV.

(a) (b)

Using DFT, compute the 4 point circular convolution sequences 4(n) =lt l,z1r , a (r) = [3, 4,s,6,1r .

of the of the

(10) (5)

The DFT of a l0 point sequence is to be computed. Calculate the number

(i)

complex multiplications

(iii) real

(ii) complex additions multiplications (rv) real additions, required to compute the DFT
OR
(15)

V.

Given an 8 point FFT processor, which can be used only once, compute
DFTs of the sequence.

,
\rI. (a)

q(")= [rroz4z3tl xr(n)= F432s76tl

Draw the sigpal flow grap[ mark outputs at each stage. An FlRfilterhas the followingpairs of complex co4iugate

zeros,

(7\

nt*'=S'5'*11 ei'*q=fu*Jt
Ctreck whether this filter has got linear phase. State your leasons for the conclusion.

O)

A filter is given by the system

n (*)

+!*i*-'

function * io" ***' +*.'

OR

(8)
.

Implement the filter with minimurn number of multipliers. Will the filter have linear phase characteristics?

VIL

(a)

A system is given by

(10)

H(*)=t'-tt -

'

(t-*-')' It
t'

(r-|*")(r-|*")

vltr.

(b) (a) (b)

Implementthe system in Direct Form*II Transposed direct form =Il Cascade forrn, with subsections canonio Parallel form, with subseotions canonic What is the disadvantage of using Rectangular windowing for FIR filter

(t) (ii) (iii) (lv)

design?

(5)
(8)

Asystem is given by y(n)=0.999

y(n-t)+x(r)

Caloulate the quantization noise power at the output ofthe filter if the signal is quantizedto (i) 8 bits (ii) l6bits, bothcases includingthe sign bit. Explain limit cycle

oscillations.

(7\
(8) (7)

DL

(a) O)

OR

With a neat tabular columrU compare the architectural features of

processors and general purpose microprocessors With a neat block diagram, describe an image compression

DSP

system.

BTS (C)

- Vr -04.12

013

B.Tech Degree W Semester Examination April 2012

CS/IT 603 OPERATING SYSTEMS
(2006 Scheme)

Time:

3 Hours

Ma"rimum Marks: 1@

PARTA (Answer ALL questions)

(8x5=40)

(a) (b) (c) (d) (e) (0 (g) (h)

Define operating system. List out any five services provided by operating systm. Differentiate between preemptive and non preernpive scheduling.
Describe the memory management rrith buddy systems.

Define TLB. Explain the basic operations in TLB. De{ine file attribute. List any five file attributes.
Describe disk cache with a figure.

Define deadlock. Explain the conditions for deadlock.

Describe resource allocation graph with an example.

PART B
(4 x 15 =60)

r.
u.

(a)

(b)

Describe semaphore and its usage. Define a process. Describe process state diagram and PCB.

(s)
(10)
three

OR

List the five criteria for process scheduling and illustrate any
scheduling algorithm with an example.

process

(15)

ry.
V.

(a)

(b) (a) (b)

Differentiate between paging and segmentation. Define RAID. List and describe the RAID Levels.

(s)

(r0)
(s)
(10)

OR
Describe the three methods for contiguous memory allocation.

Explain the need of page replacement algorithms and describe any threc page
replacement algorithm.

VI,

(a)

(b)

Describe the need ofdevice controllers. Describe the operation of DMA with a diagram.

(s)
(10) (5) (10)

OR VII.
(a) (b) Explain any three directory structures schemes. Describe the file access and control mechanisms.

vm.
IX.

(a) (b)

Differentiate betwsen dead lock and starvation

Describ the methods for deadtock detegtion and recovery.

(5) (10)

OR
Illustrate Banker's algorithm for several instance of resource type with an example.

(l s)

BTS (C)

- Vr -

04.12

014

-L

B.Tech Degree W Semester Examination April 2012

cs/rr 6M ANALYTTS
Time:3 Hours
PART A (Answ*ALL questions)

m3#r*

oF

AlcoRrrrrlr{s
Maximum lMarks : 100

(8x5:40)

I.

(a)

Explain the significance of notations uOu and

"Q'

in the complexity analysis

of

(b)
(c) (d)
(e)

algorithms. How do we analyse algorithms based on (i) amount of space used and

(ii)

optimalit5i?

Explain the heap sort procedure. Define a Red

Black Tree.

Discuss any one method used to represent gaphs.

(0
G)
(h)

Explain the dpamic programming technique used in algorithm desigr. Differentiate between NP complete and NP hard problems.

Write notes on approximation algoritlrms.

PART B

(4xls=60)
tr.
What do we understand by complexity of an algorithm? E:rplain worst complexity and average case complexity with a suitable example.

case

(15)

OR

Itr.

E4plain the significance ofrecunence equation. Solve the recrrrence

equation

(15)

r(n)=rcr(/u)+n
ry.
Write an algorithm for insertion sorting method. Atnlyze its

complexity. shatery

(15) (15)

OR

v.

Explain binary search algorithm as an example ofdivide and conquer and find its average case complority.

VI.

Write an algorithm to find the bicomponents of an undireoted graph.

(ts)
(15)

OR

vIL
vm.
DL
(a)

Explain Warshall's algorithm for finding transitive closure of

binary relation.

(b) (a) (b)

What do you know by optimization problem? Give an example. Explain the first fit deoeasing sfrate5/ for bin packing pmblem

(s)
(10) (5) (10)

OR
E4plain the soquantial coloring algorithm for graph coloring problem. Discuss various straGgies applied for TSP problem.

BTS (C)

-Vr

-04.12

01s

B.Tech Degree W Semester Examination Apfl 2012

CS/EC/EB/EI 605 CONTROL SYSTEMS ENGII\TEERING
(2006 Scheme)

Time:3 Hours
PART A
(Answer,{.ZZ questions)

Maximum Marks : 100

(8x5=
(a) Find the inverse Laplace tansform Obtain the force current analory. Derive expression for the impulse response of a 2"d order system.

40)

of F(s) =

52

+2s+3

53 +6s2

+l2s+8

o)
(c)

(d)
(e)

Briefly explain the effects of derivative and integral conftol.

Define resonant pealg resonant frequency and bandwidth.
State md explain Nyquist stability criterion.

(0
(e) (h)

Explain the properties of root loci. Draw the circuit diagram of a phass -lag network and derive the transfer function.

PART B
(4 x

15:60)
(15)

II.

Define transfer function. Find the kansfer function of the electrical shown in figure.

network

&r

.,,

R{

f,
u.
ry.

-i."' rl1 f'

OR
(15)

State and explain Mason's gain formula. Find the tansfer function of the signal flow graph shown in figure, using Masonls gain formula.

Derive.expression for the rise time, peak time and manimum peak of a2"" order system subjected to unit step input.

overshoot

(15)

OR

(P.r.o)

V. ,

(a)

The sverall

ffisfer fimction'of a unity

feedback system

is given

by

(9)

Determine the genoalized error constantso Q=-9-. n(") s2 +6s+10' -----

oryression

for error sipal and steaOy state error for the

rryu

(b) VI.

Using Routh-Hurwitz criterion, find the range of 'K' to keep &e systenn be stable. The characteristic equation is sa + 25s3 + 15s2 + 20s + K = 0 . Draw the bode plot of the rmity feedback system whose open loop fimction is given Uy

"

(r) = L+ t + t2 .

to

(6)

fiansfer
mrgia

(15)

C(s)= ,-.1!.

s(t+o.ss)(t+o.oss)

Find the gain

VII.

fte sbrlity ofthesystemOR The open loop transfer fimction of a rmity feedbaok system is given
phase margin and check

by

(15)

OG)=;F,

Skstch the polar

plot and determine fte

gain

margin and phase margin.

VItr.

Sketch the root locus for a unity feedback system with open toop

transfer

(15)

functionasgrvenby

G(' .")

=r

l.
OR

D(

The open loop transfer firnction

C(s)

of the uncompensatsd sytem is

mrgin is afleast
55o

(15)

r(s)=;1;}1.

Desip a suitable compensator for fie systcrn so

that the static velocity e,rror constant Kv--20, the phase and the gain margin is atleast l2dB.

BTS(C)

- Vr-

04.12

016 - B

B. Tech Degree W Semester Examination April 2012

CS/IT 606 COMPUTER NETWORKS
(20.06 Scheme)

Time : 3 Hours

Maximum Marks ; 100

PART A
(Answer,{,trL questions)

I.

(a) (b) (c) (d) (e) (0 G) ' (h)

(8x5=40)
What is the significance of 'layered concept'

in

Computer Networks?

How can piggbacking improve the efficiency in datatransmission between

sender and receiver? Compare the properties of TCP and UDP connections between two nodes.

Why fragmentation is required in IP packets? How fragmented IP packets

reassembled before passing to the dsstination application? Explain the process of error detection using Hamming Codes.

Differentiate between broadcast networks and point-to-point networks.

Discuss the characteristics of FDDI networks. What me the major characteristics of ISDNNetworks?

PART B

(4x15=60)

II. m. ry. V.
VI.

Briefly explain how HTTP communication takes place between two nodes,
special emphasis on persistant and non persistant connections.

with

(15)

OR
architectural diagram, explain the TCP/IP reference model. the functions of each layer in the model.
a neat

With

Explain

(15)

Draw the struoture of a TCP segment. Give the significance of the fields in the TCP segment:

following

(15)

(i) Sequence number

(ii)

Receive

window (iii)
OR

Internet checksum field.

(15)

Briefly describe the differences between the virtual circuit and datagram
networks. What are the characteristics of link state routing? With the indicated link costs given in the following diagram compute the shortest path from 'w' to all other nodes using Dijkstra's algorithm:

(1

s)

VII.

OR
(a)

Explain how CSMA/CD protocol handles collision that may oocur in Ethernet
networks.

(7) (8)

(b)

Differentiate between Go-Buck -N and Selective-Repeat sliding window

protocols.

vm.
IX.

What are the specifications of Ethernet standard? Explain the frame structure of Ethemet.

(l s)

OR
Discuss the various data encoding schemes used in Compute.r Networks. (1s)