# Design And Analysis Of Algorithms - AM10 4th CS2251

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010
Fourth Semester
Computer Science and Engineering
CS2251 - DESIGN AND ANALYSIS OF ALGORITHMS
(Regulation 2008)

PART A — (10 × 2 = 20 Marks)

1. Differentiate Time Complexity from Space complexity.
2. What is a Recurrence Equation?
3. What is called Substitution Method?
4. What is an Optimal Solution?
5. Define Multistage Graphs.
6. Define Optimal Binary Search Tree.
7. Differentiate Explicit and Implicit Constraints.
8. What is the difference between a Live Node and a Dead Node?
9. What is a Biconnected Graph?
10. What is a FIFO branch-and-bound algorithm?

PART B — (5 × 16 = 80 Marks)
11. (a) Explain how Time Complexity is calculated. Give an example.[Marks 16]
Or
(b) Elaborate on Asymptotic Notations with examples.[Marks 16]
12. (a) With a suitable algorithm, explain the problem of finding the maximum and minimum items in a set of n elements.[Marks 16]
Or
(b) Explain Merge Sort Problem using divide and conquer technique. Give an example.[Marks 16]
13. (a) Write down and explain the algorithm to solve all pairs shortest paths problem.[Marks 16]
Or
(b) Explain how dynamic programming is applied to solve traveling salesperson problem.[Marks 16]
14. (a) Describe the backtracking solution to solve 8-Queens problem.[Marks 16]
Or
(b) With an example, explain Graph Coloring Algorithm.
15. (a) Explain in detail the Graph Traversals.[Marks 16]
Or
(b) With an example, explain how the branch-and-bound technique is used to solve 0/1 knapsack problem.[Marks 16]