Madurai Kamraj University (MKU) 2006 B.C.A Computer Application -6 COMPUTER ALGORITHMS AND DATASTRUCTURE - Question Paper

Time: 3 hours Maximum: 100 marks
PART A ans any 6 ques.. (6 x five =30 marks)

1. Write algorithm to control abstraction for Divide-and-Conquer.
2. Write an algorithm for finding kth smallest element
3. What is meant by Knapsack problem? provide example.
4. Write about two-way merge trends.
5. Write short notes on Travelling Salesperson issue.
6. describe preemptive. provide example.
7. describe stack. Write an algorithm to remove an item from the stack.
8. describe generalized list. provide example.
9. How do you represent a tree in memory? discuss.
10. Write short note on decision trees.

PARTB ans any 4 ques.. (4 x 10 =40 marks)
11. explain the method for finding the maximum and minimum.
12. discuss minimum-cost spanning trees with example
13. discuss all-pairs shortest path with example.
14. describe queue. discuss the operations of queue with example.
15. define storage compaction with example.
16. explain the in order and post order traversal with example.

PART C ans any 2 ques.. (2 x 15 =30 marks)

17.(a) discuss quick sort with example. (b) discuss the two-way merge tree. algorithm
for generating (8)

18. discuss Multistage graph with example.

19. discuss doubly linked list with example.

Earning:   Approval pending.