Question Paper of Data Structures And Algorithms 2007 of MCA First Semester of Annamalai University

M.C.A. DEGREE EXAMINATION, 2007
( SECOND SEMESTER )
( PAPER - X )

230. DATA STRUCTURES AND ALGORITHMS

May

Time : 3 Hours
Maximum : 100 Marks

Answer any FIVE questions.
All questions carry equal marks. (5 × 20 = 100)

1. (a) Write an algorithm for stack operations. (10)

(b) Explain applications of trees with suitable examples. (10)

2. (a) Explain Heap sort with suitable example. (10)

(b) Write the algorithm for quick sort and explain with an example. (10)

3. (a) Explain the Greedy Algorithms. (10)

(b) Write the Kruskal algorithm for a minimum spanning tree. (10)

4. (a) What is linear search, binary search ? Write algorithms for both and comment on the complexity. (15)

(b) Write short notes on graph coloring. (5)

5. (a) Explain Strassen's matrix multiplication. (10)

(b) Explain the travelling salesperson problem. (10)

6. (a) Explain Branch and Bound algorithm. (10)

(b) Discuss code optimization techniques. (10)

7. (a) Discuss in detail on hashing with examples. (10)

(b) Write an algorithm that will perform an insertion and deletion of a node in a singly linked list. (10)

8. (a) Describe Np - Hard scheduling problems. (10)

(b) Describe Np - Hard code generation. (10)