Code: 9D58101

M.Tech I Semester Regular Examinations February 2014

ADVANCED DATA STRUCTURES & ALGORITHMS
(Common to CSE, CS, SE and CN)
(For students admitted in 2013 only)

Time: 3 hours

Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
*****

1 (a)
(b)

What is linked list? Explain the insertion and deletion of a node into a double linked list.
Write the procedure to evaluate the postfix expression. Explain with suitable example.

2 (a)
(b)

Give a brief description about the asymptotic notations.

Write the procedure to find the Fibonacci sequence of any given number by using
recursion.

3 (a)
(b)

Discuss in detail about the threaded binary trees.

Explain the binary tree traversal techniques with suitable example.

With the help of a suitable example, explain the insertion and deletion operations into a
binary search tree.

5 (a)
(b)

Explain any three collision resolution techniques.

Write short notes on splay trees.

6 (a)
(b)

Write and explain the procedure to find the max and min values present in a set.
Derive the average case time complexity for quick sort.

7 (a)
(b)

Write and explain the general method of a dynamic programming.

Give a brief description about the reliability design problem.

8 (a)
(b)

Explain the solution to 8-queens problem.

Write and explain the control abstraction for LC-search.

*****