CS 2251 Design and Analysis of Algorithm question paper download

CS2251 - DESIGN AND ANALYSIS OF Algorithm
(Regulation 2008)
Time: Three hours Maximum: 100 Marks
Answer ALL Questions
PART A - (10 × 2 = 20 Marks)
1.Differentiate from Time Complexity 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.Explicit and Implicit Differentiate 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)
11th (a) Explain how Time Complexity is Calculated. Give an example.
or
(b) Elaborate on Asymptotic Notation with examples.
12th (a) With a Suitable algorithm, EXPLAIN the problem of finding the Maximum
and minimum items in a set of n elements.
or
(b) Explain Merge Sort Problem using Divide and Conquer technique. Give an
example.
13th (a) Write down and EXPLAIN the algorithm to Solve all pairs shortest paths
Problem.
or
(b) Explain how dynamic programming is applied to traveling Solve
salesperson problem.
14th (a) Describe the backtracking solution Solve the 8-Queens problem.
or
(b) With an example, EXPLAIN Graph Coloring Algorithm.
15th (a) Explain in detail the Graph Traversal.
or
(b) With an example, EXPLAIN how the branch-and-bound technique is used to
Solve 0/1 Knapsack problem.

Tweet