CS1151 DATA STRUCTURES question papers May/Jun 2007 question papers Previous Year Question Paper Download

CS1151 DATA STRUCTURES question papers May/Jun 2007  Anna university question papers Previous Year Question Paper Download

B.E/B.Tech DEGREE EXAMINATION May/Jun 2007
Third semester
Computer Science and Engineering
CS1151 - DATA STRUCTURES
(Regulation 2004)
Time: 3 hours                                                    Maximum marks: 100
Answer ALL questions
PART A (10 x 2 =20 marks)

1. Write the basic idea behind the Divide and conquer strategy.

2. What is O-notation?

3. What is an ADT?

4. List the characteristics of stacks

5. What is binary search tree?

6. What is hashing?

7. Develop pseudo code that will illustrate the process logic in Insertion sort.

8. What is the best case time complexity of the Quick sort algorithm?

9. What is an adjacency list? When is it used?

10. What is an activity node graph ?

PART B (5 x 16 = 80)

11. (a)  (i)  Outline in brief about Top-down design.

  (ii) Foumulate an algorithm to convert a decimal integer to its corresponding octal representation.

(or)

(b)  (i)  Discuss in detail about the Implementation of algorithms.

(ii)  Given the character representation of an integer, convert it to its conventional decimal format.

(a)  (i)  Write a program in C to return the position of an element X in a list L.

(ii)  State and explain the algorithm to perform Radix sort.

(or)

(b)  (i)  Write a program in C to create an empty stack and to push an element into it.

(ii)  Explain how queues can be implemented using Arrays.

13.  (a)  (i) Construct an expression tree for the expression A + (B-C) * D + (E * F).

(ii)  Write a program in C to create an empty binary tree and to search for an element X in it.

(or)

(b)  (i) Explain in detail the Linear probing technique.

(ii) Write a function to delete the minimum element from a Binary heap. Routine to perform Deletion in a binary heap:

14(a)  State and explain the algorithm to perform Heap sort. Also analyze the time complexity of the algorithm.

(or)

(b) Write a C program to perform Merge sort. Also analyze the time complexity of the algorithm.

15. (a)  (i) Formulate an algorithm to find the shortest path using Dijkstra’s algorithm.

(ii)  Construct a Minimum Spanning Tree for the graph shown below.

                        
     

1. MST using Prim’s algorithm

2.MST using Kruskal’s algorithm

(or)

(i)  Explain the Prim’s algorithm with an example.

(ii) Write short notes on Biconnectivity.

FEEL USEFUL PLEASE GIVE +1