Reg. No.

Question Paper Code : 53135

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010 Third Semester

Electrical and Electronics Engineering

EE 2204 DATA STRUCTURES AND ALGORITHMS

(Common to Electronics and Instrumentation Engineering and Instrumentation and Control Engineering) (Regulation 2008) Time : Three hours

PART A (10 2 = 20 Marks) 1. 2. 3. 4. 5. 6. 7. 8. 9.

Distinguish between linear and non-linear data structures. Write down the steps to modify a node in linked lists. Define a path in a tree.

What is a binary search tree? Define hashing.

What is meant by open addressing? What is minimum spanning tree?

31
10.

Define depth-first traversal in a tree.

Differentiate divide and conquer technique from branch and bound technique. Explain dynamic programming.

31

Answer ALL questions

31 5
Maximum : 100 Marks

PART B (5 16 = 80 Marks) 11. (a) Write down and explain the algorithms for basic operations on stack ADT. Or (b) 12. (a)

Explain polynomial manipulation using linked lists with an example. With suitable examples, explain binary tree traversal algorithms. Or

(b)

Explain the following operations in binary search trees : (i) (ii) Insertion of a node Searching a node

(iii) Modification of a node. 13. (a) With suitable examples, explain the basic operations on AVL trees.

(b)

Explain the following in hashing : (i) (ii) Folding method Division method

5
Or Or Or 2

31

(iii) Linear probing. 14. (a)

Explain in detail the Dijkstras algorithm to solve the shortest path problem.

(b) 15. (a)

Discuss in detail the applications of graphs. (i) (ii) With an example, explain backtracking. Discuss the asymptotic notations. (8) (8)

31

(b)

Write detailed notes on NP-complete problems.

31 5
(6) (5) (5) (6) (5) (5)

53135