COURSE CODE - 2050114 12. a. Write a program for queues.

PG DEGREE EXAMINATION - FEB 2011 (Or)

MCA / MSC (IT & MGT) b. Write a program using lists.
DATA STRUCTURES AND ALGORITHMS USING C, C++
13. a. Explain in detail about heap sort.
(For Candidate Admitted from Calendar 2007 Onwards)
(Or)
Time: 3 Hours Max.Marks:75 b. Explain in detail about knapsack.
PART - A
14. a. Describe in detail about greedy algorithm.
Answer All the Questions: 10 X 2 = 20
(Or)
1. What is array?
b. Explain in detail about traveling salesman.
2. What is structure of stack?
15. a. Describe in detail about search trees.
3. Difference between stack and queue.
4. What is the process of insertion sort? (Or)
5. Define binary and search trees? b. Explain in detail about string matching algorithm.
6. What are the topological table and files?
PART - C
7. What is greedy algorithm?
Answer any Two Questions: 2 X 15 = 30
8. What are keys used in sorting?
9. What is a file? 16. Define sorting. Explain the different types of sorting.
10. What is time and space complexity?
17. Explain in detail about marking techniques.
PART - B
18. Define a tree. Explain in detail about the different types of trees.
Answer All the Questions: 5 X 5 = 25
19. Explain in time and space complexity?
11. a. Explain in detail about array.
20. Discuss about topological tables and files?
(Or)
b. Write a program on search trees.