ANNA UNIVERSITY: CHENNAI 600 025 M.E./M.Tech.

. DEGREE EXAMINATIONS, JAN - 2012 Regulations - 2009 First Semester (Computer Science and Engg. / Information Technology) CS9215: DATA STRUCTURES LABORATORY Time: 3 Hours Maximum Marks: 100

1. a. b. c. 2. a. b. 3. a. b. c.

Develop a program for implementing a complete binary tree data structure. Perform the following operations: Pre-order traversal In-order traversal Post-order traversal Develop a program for implementing a binary search tree data structure. Perform the following operations: Insert a node Delete a node Develop a program for implementing a binary search tree data structure. Perform the following operations: Insert a node Search a node Find and print the minimum element present in the tree

(100)

(100)

(100)

4.

Develop a program for implementing a max heap data structure and perform search operation. Develop a program for implementing a min heap data structure. Perform the following operations: a. b. Insert a node Delete a node

(100)

5.

(100)

6.

Develop a program for implementing a min heap data structure. Perform search operation. Develop a program for implementing a Deap data structure. Perform the following operations: a. b. Insert a node Delete a node

(100)

7.

(100)

8.

Develop a program for implementing a Deap structure. Perform search operation. (100)

9. a. b.

Develop a program for implementing a Leftist tree data structure. Perform the following operations: Insert a node Delete a node

(100)

10.

Develop a program for implementing a Leftist tree data structure. Perform search operation.

(100)

11. a. b. 12.

Develop a program for implementing a B-tree data structure. Perform the following operations: Insert a node Delete a node Develop a program for implementing a B-tree data structure. Perform search operation.

(100)

(100)

13. a. b. 14. a. b. 15.

Develop a program for implementing an AVL tree data structure. Perform the following operations: Insert a node Delete a node

(100)

Develop a program for implementing a Trie data structure. Perform the following (100) operations: Insert a node Delete a node Develop a program for implementing a Trie data structure. Perform search operation. Develop a program using non recursive functions to sort an array of N numbers using quick sort. Given a knapsack with maximum capacity W and a set S consisting of n items, each item i has some weight wi and benefit value bi (all wi, bi and W are integer values). The problem is how to pack the knapsack to achieve maximum total value of packed items. Develop a program to implement the above. (0-1 Knapsack problem) Develop a program to perform breadth first search traversal and depth first search traversal on a graph. Develop a program for graph colouring using backtracking. Develop a program to implement the Quick Hull algorithm to compute the convex hull of a set of sorted points. (100)

16. 17.

(100) (100)

18.

(100)

19. 20.

(100) (100)