Time: 3 hours

MODEL QUESTION PAPER

FOUR YEAR B.TECH DEGREE END EXAMINATION
THIRD SEMESTER EXAMINATION
COMPUTER SCIENCE & ENGINEERING
DATA STRUCTURES (DS)
(SCHEME 2013)
Max Marks: 70
Note: i) Question No.1 is compulsory and it must be answered first in
sequence at one place only.
ii) Answer any FOUR from the remaining.

1. a)
b)
c)
d)
e)
f)
g)
h)
i)
j)

Write the difference between Array and Linked list.

How does a node appear in Double linked list?
Write the applications of stack.
Convert the expression A*B+C/(D-E) into post fix form.
Distinguish between linear queue and circular queue.
Define Complete binary tree and Full binary tree.
What is the purpose of splaying operation in splay trees?
What is Binary heap?
Define AVL tree.
Define Hashing.

1X 10=10

2. a) Explain the merging process of two sorted arrays with an example.

b) Write an algorithm for Binary search.

7M
8M

3.a) How do you perform insertion operation in double linked list? Explain.
b) What are the advantages and disadvantages of linked lists over arrays?

9M
6M

4. a) Write an algorithm to evaluate a postfix expression.

b) Write a program to implement a circular queue.

7M
8M

5. a)

Construct a binary tree with the following traversals.

Pre-order : A B D G H C E F I K J
In-order : B G H D A E I C K F J
b) Explain about AVL rotations.

7M

Construct a B-Tree of order 5 for the data given below:

1,7,6,2,11,4,8,13,10,5,19,9,18,24,3,12,14,20,21,16.
b) Write an algorithm for quick sort technique.

8M

7. a) Write a short note on Binomial queues.

b) Explain different collision resolution techniques in hashing.

7M
8M

6. a)

8M

7M