Question Paper Code:

12
0

Reg. No. :

7656

M.E./M.Tech. DEGREE EXAMINATION, MAY/JUNE 201.

First Semester

Computer Science and Engineering

CS9212 DATA STRUCTURES AND ALGORITHMS

(Common to M.Tech. Information Technology)
(Regulation 2009)
Time : Three hours

Maximum : 100 Marks

12
0

Answer ALL Questions

PART A (10 2 = 20 Marks)

Define big Oh notation.

2.

Give two examples for NP Hard Problem.

3.

Give an example for Fibonacci heap.

4.

Define binomial heap.

5.

Define AVL trees.

6.

What is the purpose of Red black trees?

7.

What is the run time complexity of Quick Sort?

8.

Define the advantages of greedy algorithms.

What are the advantages of dynamic programming?

12

9.

1.

10.

List two example problems which can be solved by back tracking.

11.

(a)

(i)

Write algorithm to perform inorder and preorder traversal of binary

tree.
(8)

(ii)

Explain about recurrence equation with an example.

Or

(b)

12.

(a)

(i)

Explain the principles of Amortized analysis.

(ii)

Write algorithm to insert a node in the beginning of a list.

(8)

(10)

(6)

Write algorithm to construct Fibonacci heap with suitable example.

Or

(16)

(b)

Write algorithm to construct Binomial heap with suitable example.

(a)

(i)

Construct a B-tree to insert the following (order of the tree is 3)

5, 25, 3, 75, 4, 43, 6, 8, 10.
(12)

(ii)

What are the properties of a Red black tree?

12
0

13.

12
0

PART B (5 16 = 80 Marks)

(16)

(4)

Or

(b)

14.

(a)

(i)

What is the need for splay trees? Give an example.

(8)

(ii)

Write algorithm to Construct Tries.

(8)

(i)

Write algorithm for Quick Sort.

(8)

(ii)

Write intermediate steps to perform Quick Sort for the following :

5, 25, 4, 33, 6, 9, 47, 50, 2.
(8)
Or

Write algorithm for Tree Vertex Splitting.

(a)

Describe how Eight Queens problem can be solved using back tracking.
Write the algorithm.
(16)

15.

(b)

Or

State the Knapsack problem and explain how it can be solved using
branch and bound algorithm.
(16)

12

(b)

(16)

J7656