DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CLASS TEST - III
CS8451- DESIGN AND ANALYSIS OF ALGORITHMS
Year : II Date :
Semester : IV Duration: 50 minutes
Max. Marks : 40 marks
Answer ALL questions
PART A − ( 10 x 2 = 20 marks )
1. State principle of optimality.
(CO 3)
2. What is the use of Floyd’s algorithm? (CO 3)

3. List the memory functions used under Dynamic programming. (CO 3)

4. What is meant by dynamic programming? (CO 3)

5. State the general principle of greedy algorithm. (CO 3)

6. Differentiate greedy method from dynamic programming. (CO 3)

7. What is meant by multi-stage graph? (CO 3)

8. How the Binomial coefficient is computed? (CO 3)
9. Define  Single Source Shortest Path problem (CO 3)
10. What are the drawbacks of greedy algorithm? (CO 3)
11. What is the purpose of Huffman tree? (CO 3)
12. What are spanning tree and minimum spanning tree? (CO 3)
13. Compare Prim’s with Kruskal’s algorithm. (CO 3)
14. Define – Optimal solution (CO 3)
15. What is meant by feasible solution? (CO 3)
16. What is meant by transitive closure? (CO 3)
17. What are the general characteristics of greedy algorithm? (CO 3)
18. What is meant by objective function? (CO 3)
19. What is meant by Euclidean minimum spanning tree problem? (CO 3)
20. What is meant by 0/1 knapsack problem (CO 3)

Prepared By Approved By
Principal