Acharya Nagarjuna University (ANU) 2007 M.C.A IV – COMPUTER ALGORITHMS - Question Paper

M.C.A. 2nd YEAR DEGREE EXAMINATION, MAY 2007.
Paper IV – COMPUTER ALGORITHMS

Time: 3 hours Maximum: 75 Marks

part A - (3 x 15 =45 marks)
ans any 3 of the subsequent.

1. Briefly discuss about TREE data structures.
2. discuss the concept of quick sort.
3. discuss optimal binary search trees.
4. discuss graph traversal techniques.
5. discuss travelling salesman protocol.

part B - ( five x five = 25 marks)
ans any 5 of the subsequent.

6. discuss about stacks and queues.
7. What is a graph ?
8. discuss knapsack issue.
9. Briefly discuss primes algorithm.
10. What is multistage graph ?
11. discuss flow ship schedular.
12. discuss 8-Queen issue.
13. discuss FIFO Branch-and-Bound model.

part C - ( five x one = five marks)
ans ALL of the subsequent.

14. describe the term data structures.
15. How to obtains maxima and minima in divide and conquer model ?
16. describe the term dynamic programming.
17. describe graph coloring.
18. describe 0/1 knapsack issue.

Earning:   Approval pending.