7/27/2019 CS9215-SET I.pdf

1/3

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. Develop a program for implementing a complete binary tree data structure.

Perform the following operations:

(100)

a. Pre-order traversal

b. In-order traversal

c. Post-order traversal

2. Develop a program for implementing a binary search tree data structure. Perform

the following operations:

(100)

a. Insert a node

b. Delete a node

3. Develop a program for implementing a binary search tree data structure. Perform

the following operations:

(100)

a. Insert a nodeb. Search a node

c. Find and print the minimum element present in the tree

7/27/2019 CS9215-SET I.pdf

2/3

4. Develop a program for implementing a max heap data structure and perform

search operation.

(100)

5. Develop a program for implementing a min heap data structure. Perform thefollowing operations:

(100)

a. Insert a node

b. Delete a node

6. Develop a program for implementing a min heap data structure. Perform searchoperation.

(100)

7. Develop a program for implementing a Deap data structure. Perform the

following operations:

(100)

a. Insert a node

b. Delete a node

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

9. Develop a program for implementing a Leftist tree data structure. Perform the

following operations:

(100)

a. Insert a node

b. Delete a node

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

operation.

(100)

7/27/2019 CS9215-SET I.pdf

3/3

11. Develop a program for implementing a B-tree data structure. Perform the

following operations:

(100)

a. Insert a node

b. Delete a node

12. Develop a program for implementing a B-tree data structure. Perform searchoperation.

(100)

13. Develop a program for implementing an AVL tree data structure. Perform the

following operations:

(100)

a. Insert a node

b. Delete a node

14. Develop a program for implementing a Trie data structure. Perform the following

operations:

(100)

a. Insert a node

b. Delete a node

15. Develop a program for implementing a Trie data structure. Perform search

operation.

(100)

16. Develop a program using non recursive functions to sort an array of N numbers

using quick sort.

(100)

17. 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 integervalues). The problem is how to pack the knapsack to achieve maximum total

value of packed items. Develop a program to implement the above. (0-1Knapsack problem)

(100)

18. Develop a program to perform breadth first search traversal and depth first

search traversal on a graph.

(100)

19. Develop a program for graph colouring using backtracking. (100)

20. Develop a program to implement the Quick Hull algorithm to compute theconvex hull of a set of sorted points.

(100)