## October 29, 2011

### CS1151 DATA STRUCTURES question papers Nov/Dec 2006 Year Anna university question papers Previous Year Question Paper Download

CS1151 DATA STRUCTURES question papers Nov/Dec 2006 Year Anna university question papers Previous Year Question Paper Download
B.E/B.Tech DEGREE EXAMINATION Nov/Dec 2006
Third semester
Computer Science and Engineering
CS1151 - DATA STRUCTURES
(Regulation 2004)
Time: 3 hours                                                    Maximum marks: 100

PART A (10 x 2 =20 marks)

1. What is meant by top-down design?

2. What notation is used to specify the complexity of an algorithm?

3. What is an Abstract Data Type (ADT)?

4. Define a ‘list’. Mention any two operations that are performed on a list

6. Give a simple hash function when the input keys are integers .

7. How many passes does the insertion sort algorithm do to sort a list of 5 elements? What happens in its ith pass?

8. How many comparisons are done to merge two sorted lists of  lengths ‘m’ and ‘n’ into a single sorted list?

9. Draw a directed acyclic graph with 4 vertices and give its Topological sort.

10. Define the minimum spanning tree (MST) of an undirected graph.

PART B (5 x 16 = 80)

11.  (a)    What is the Stack ADT? Give any one implementation of Stack and explain clearly the data structure and the routines used.

(or)

(b)  How does a queue works? Explain the algorithm for inserting and deleting from a Queue.

12.   (a)   (i) Show that the maximum number of nodes in a binary tree of height ‘h’ is 2(h+1) - 1.

(ii)   What is meant by ‘collision resolution’ in hashing? Explain in detail any one strategy for dealing with it.

(or)
(i) Define a binary search tree(BST). Write a routine to insert a node into a BST.

(ii). Give one implementation of a priority queue and explain the routines used

13.  (a) Write down the complete QUICKSORT algorithm and illustrate its working to sort the list (45, 23, 11, 35, 62, 87, 24, 66)

(or)

(b)   Write down the complete HEAPSORT algorithm and illustrate its working to sort the list ( 25, 73, 10, 95, 68, 82, 22, 60 ).

14. (a) Explain with examples how a node is inserted into an AVL tree. Discuss all possible cases.

(or)

14.   (b)  What is an external sort algorithm? Explain, with an example.

15(a) Write a routine to find a shortest path between two given vertices in a weighted directed graph. Use it to find the shortest path between A and F in the graph of question

(or)

(b) Write a routine to find a minimum spanning tree of a weighted directed graph. Use it to find the MST of the following graph.

Anna University Chennai Previous Years Question Papers. Find model question papers and previous years question papers of any university

## Government jobs in india 