4th Semester

Maths, April 2010--page 1




Maths, April 2010--page 2




CAO, April 2010--page 1





CAO, April 2010--page 2



MUP, April 2010





ALC, April 2010--page 1




ALC, April 2010--page 2





DSA, April 2010





DC, April 2010




Maths, April 2009--page 1




Maths, April 2009--page 2





MUP, April 2009



CAO, April 2009



ALC, April 2009--page 1



ALC, April 2009--page 2




DSA, April 2009




DC, April 2009





MUP, April 2008



DC, April 2008

B.TECH IV SEMESTER EXAMINATION


DATA COMMUNICATION


1. a) What are the advantages of digital transmission?
b) What are the most significant transmission impairments?
c) Write note on constellation pattern?
d) Describe the advantages of biphase coding techniques.
e) Compare between synchronous and asynchronous transmission techniques.
f) What is piggybacking?
g) How is interference avoided by using FDM?
h) What is CDMA?

2. a) Describe different types of noises.
b) Write short notes on 1.channel capacity 2.bandwidth.

OR
3. a) Derive and compare the equations that rule the channel capacity and bandwidth.
b) Describe different transmission terminologies.

4. a) Describe different digital signal encoding formats. With the help of neat diagrams
represent the digital data 01001100011.

OR
5. a) Describe any two modulation techniques used in codecs.
b) Short notes on 1. B8ZS 2. HDB3

6. a) What are the reasons for breaking a long data transmission up into a number of
frames?
b) List and explain three different ways in which the CRC algorithm can be described.

OR

7. a) List and briefly describe some of the requirements for effective communication over
a data link.
b) List and describe the three versions of ARQ.

8. a) Why is a statistical time division multiplexer more efficient than a synchronous time
division multiplexer? Compare them.

OR
9. a) List three benefits of spread spectrum.
b) What is frequency hopping spread spectrum?



DSA, April 2008

BTECH DEGREE IV SEMESTER EXAMINATION APRIL 2008
DATA STRUCTURES & ALGORITHMS

Time:3 Hrs Max marks:100


PART A

1.a) Differentiate b/w selection & bubble sorting techniques.

b) Explain different hashing functions.

c) Differentiate b/w singly linked list& doubly linked list.

d) Explain the procedure for the conversion of infix expressions to postfix expression.

e) What are significance of expression trees?

f) How trees are represented using linked lists?

g) Explain prims algorithm for the construction of minimum spanning tree.

h) What are adjacency matrices? What is its role in graph representation?
PART B

2. Discuss the various searching algorithms & explain how complexity can be
determined.
OR

3. With a suitable eg show how quick sort & heap sort take place.

4. a) Differentiate b/w queues dequeues.

b) Explain how priority queues are being implemented.
OR
5. Briefly explain the procedure for the evaluation of post fix expression.

6. Briefly discuss about the various binary tree traversal techniques
OR

7. What are AVL trees? Explain how it is being represented in memory?

8. What is meant by ‘minimum spanning tree’? Explain any technique for the
implementation of minimum spanning tree.
OR

9. a) Discuss the various graph transversal techniques.

b) Explain Dijkstras algorithm.