7/27/2019 DAA Imprt Qns

1/4

Design and analysis of Algorithm Question Bank

Question Bank

UNITI

PART A

1. What is an algorithm?2. What is a program?3. Define Algorithm Validation.4. Define program proving and program verification.5. Differentiate algorithm and program.6. Write an algorithm to find if the given no is Armstrong no?7. What are the design techniques that are used to devise algorithms?8. What is divide and conquer technique?9. Give the control abstraction for divide and conquer technique.10. Write the recurrence relation for DandC.11. Write a straight forward max min algorithm.12. Explain the greedy method.13. Define feasible and optimal solution.14. Write the control abstraction for greedy method.15. What are the constraints of knapsack problem?16. How do you time a very short event?17. What are the design techniques that are used to devise algorithms?

PART B

1. Explain the binary search algorithm with an example.2. Explain min max problem using Divide and conquer technique.3. Explain merge sort with an example.4. Explain Quick sort with an example.5. Explain Heap sort with an example.

UNIT II

PART A

7/27/2019 DAA Imprt Qns

2/4

1.

Explain the greedy method.

2. Define feasible and optimal solution.3. Write the control abstraction for greedy method.4. What are the constraints of knapsack problem?5. What is a minimum cost spanning tree?6. Specify the algorithms used for constructing Minimum costspanning tree.

7. State single source shortest path algorithm (Dijkstras algorithm).PART-B

1. Solve the knapsack problem using greedy technique.2. Explain Prims algorithm to construct Minimum cost spanning tree.3. Explain Kruskals algorithm to construct Minimum cost spanningtree.

4. Explain Optimal Randomized algorithm to construct Minimumcost spanning tree.

5. Explain single source shortest path algorithm (Dijkstrasalgorithm).

UNITIII

PARTA

1. Define Dynamic programming technique.

2. Define Principle of optimality.

3. What do you mean by multistage graph?

4. Differentiate the 2 approaches in finding the minimum cost path of multistage

graph.

5. Find the minimum cost path using forward and backward technique.6. 0/1 knapsack problem cannot be solved by Greedy technique. Why?

7. Give the constraints to solve the Traveling sales person problem in dynamic

programming.

PARTB

1. Explain dynamic programming technique2. Explain optimal binary tree3. Solve the all-pairs shorest path problem for the digraph with theweight matrix

7/27/2019 DAA Imprt Qns

3/4

given below.A B C D

A 0 3

B 2 0

C 7 0 1

D 6 0

4. What is multistage graph? Explain with an eg. Write the pseudo code for the

finding the minimum cost path using forward approach.

5. What is multistage graph? Explain with an eg. Write the pseudo code for the

finding the minimum cost path using backward approach.

6. How will you construct a optimal search tree with example.

UNITIVPARTA

1. What is m-colorability optimization?

2. Define sum of subsets problem.

3. What is chromatic numbers?

4. Define Backtracking.

5. What are the applications of backtracking?6. What are the algorithm design techniques?

7. Define n-queens problem.

8. Define Hamiltonian Circuit problem in an undirected Graph.

9. What is state space tree?

10. State the principle of Backtracking.

11. State if Backtracking always produces optimal solution.

12. What are explicit constraints and implicit constraints?13. Explain 8-Queen problem in brief.14. Give any 4 problems that could be solved by backtracking.15. What are the constraints of 8-Queens problem16. 7. What is a Hamiltonian cycle?17. 9. Compare and contrast LC-BB and FIFO BB.18. . What is a reduced cost matrix?

PARTB

1. Explain N-Queens problem using Backtracking.

2. Explain Graph Coloring.3. Explain sum of subsets.

7/27/2019 DAA Imprt Qns

4/4

4. Explain Hamiltonian cycles.5. Solve Knapsack problem using backtracking.

6. Apply Backtracking technique to solve the following instance of the

subset sum

problems.s=(1,3,4,5) & d=11

7. Explain subset-sum problem and discuss the possible solution strategies

using

backtracking.

UNITV

PARTA

1. Define Traversal2. Compare Backtracking & Branch and Bound techniques with anexample.

3. What are the applications of branch & bound?4. What are the three function specify for Nondeterministic algorithm.5. Compare NP-hard and NP-completeness.6. What is P and NP?7. What is deterministic algorithm?8. What is Non-Deterministic Algorithm?9. Draw the relationship between P, NP, NP complete and NP-hard.10. What is the property of NP-Complete problem?11. What is the property of NP-Hard problem?12. What are the two most famous unsolved problems in Computerscience?

PARTB

1. Explain Traveling Salesperson problem using branch and boundtechniques.

2. What is branch and bound? Explain detail.3. Discuss the solution for knapsack problem using branch boundtechniques

4. Explain the basic concepts of P, NP, NP-Complete and NP-Hard.5. Prove a graph problem is NP-Hard.6. Explain a NP-Hard Scheduling problem.7. Explain a NP-Hard code generation problem.8. Explain the concepts of Approximation algorithm