Sri Indu College of Engineering and Technology, Sheriguda
Department of Computer Science and Engineering
R20CSE3203 Design and Analysis of Algorithms
Assignment – 2
Declaration Date: 21-05-2024
Submission Date: 03-06-2024
Set – 1
H.T No. 21D41A05D1 to 21D41A05D5
PART – A
1. What is dynamic programming? L1 CO4
2. Write general method of dynamic programming. L1 CO4
PART - B
1. Compare Divide and Conquer approach and greedy method L4 CO4
2. Solve the following problem of Job sequencing with the dead line L5 CO4
specified using Greedystrategy: N=4, (p1, p2, p3,
p4)=(100,10,15,27) (d1, d2, d3, d4)= (2,1,2,1).
3. Find the optimal solution for the given instance L5 CO4
of knapsack problem .n=3,knapsack capacity
m=20, weight=(18,15,10),profits=(25,24,15).
Set – 2
H.T No. 21D41A05D6 to 21D41A05E0
PART – A
1. What is optimal binary search tree? L1 CO4
2. What is travelling sales man problem.
L1 CO4
PART - B
1. Illustrate Reliability Design. L4 CO4
2. Explain with an example of Travelling Salesman Problem. L2 CO4
3. Explain about Matrix Chain Multiplication using Dynamic L2 CO4
Programming method?
Set – 3
H.T No. 21D41A05E1 to 21D41A05E6
PART – A
1. Define Backtracking . L1 CO5
2. What do you mean by State Space Tree? L1 CO5
PART - B
1. What is Backtracking? Explain in detail. L2 CO5
2. Explain Subset-sum Problem & Discuss the possible solution L2 CO5
strategies using backtracking.
3. Write short notes on (a) Graph coloring (b) 8-Queens problem L2 CO5
Set – 4
H.T No. 21D41A05E7 to 21D41A05F1
PART – A
1. Define n-Queens Problem. L1 CO5
2. What is Hamiltonian cycle ? L1 CO5
PART - B
1. Explain n-Queens problem with an algorithm. L2 CO5
2. Apply Backtracking technique to solve the following instance L3 CO5
of the sum of sub sets problems w={5,7,10,12,15,18,20} &
m=35
3. Explain graph coloring algorithm with an example L2 CO5
Set – 5
H.T No. 21D41A05F2 to 21D41A05F6
PART – A
1. Define the term Branch and Bound Technique . L1 CO5
2. Differentiate Feasible Solution and optimal solution . L4 CO5
PART - B
1. Explain Hamiltonian cycle with an example. L2 CO5
2. Using Backtracking enumerate how can you solve the L6 CO5
following problems
(a) 8-Queens problem
(b) Hamiltonian Cycle problem
3. Find out solution for knapsack problem using LC and FIFO L5 CO5
Branch and Bound
Set – 6
H.T No. 21D41A05F7 to 21D41A05G1
PART – A
1. What is LIFO Search? L1 CO5
2. What is FIFO Search? L1 CO5
PART - B
1. Compare Backtracking and Branch and Bound method. L4 CO5
2. Explain with an example how branch and bound technique is L2 CO5
used to solve knapsack problem.
3. Explain General method of Branch and Bound. L2 CO5
Set – 7
H.T No. 21D41A05G3 to 21D41A05G6
PART – A
1. Define the following terms live node and E-node. L1 CO5
2. List the properties of LC-Search. L1 CO5
PART - B
1. Explain n-Queens problem with an algorithm. L2 CO5
2. Apply Backtracking technique to solve the following instance L3 CO5
of the sum of sub sets problems w={5,7,10,12,15,18,20} &
m=35
3. Explain graph coloring algorithm with an example L2 CO5
Set – 8
H.T No. 21D41A05G7 to 21D41A05H2
PART – A
1. What is Sum of Subset problem. L1 CO5
2. What is Graph Coloring. L1 CO5
PART - B
1. Explain n-Queens problem with an algorithm. L2 CO5
2. Apply Backtracking technique to solve the following instance L3 CO5
of the sum of sub sets problems w={5,7,10,12,15,18,20} &
m=35
3. Explain graph coloring algorithm with an example L2 CO5
Set – 9
H.T No. 21D41A05H3 to 21D41A05H7
PART – A
1. Define polynomial. L1 CO6
2. Define NP. L1 CO6
PART - B
1. a. How are P and NP problems related? L4 CO6
b. Differentiate Time Efficiency and Space Efficiency.
2. Explain the strategy to prove that a problem is NP-hard? L2 CO6
3. a. Write and explain the Cooks theorem. L3 CO6
b. What is non deterministic algorithm explain.
Set – 10
H.T No. 21D41A05H8 to 21D41A05J2
PART – A
1. What is NP-hard problem? L1 CO6
2. What is NP-complete problem? L1 CO6
PART - B
1. Explain NP-hard and NP-Complete Classes. L2 CO6
2. Distinguish between Deterministic and non-deterministic L4 CO6
algorithm.
3. What is meant by Halting problem explain with an example
L1 CO6
Set – 11
H.T No. 21D41A05J3 to 21D41A05J7
PART – A
1. What is halting problem? L1 CO6
2. Define Cook’s theorem. L2 CO6
PART - B
1. Differentiate between NP-Complete and NP-Hard. L4 CO6
2. Explain Optimization problem. L2 CO6
3. Briefly explain the concepts of the NP-Hard and NP- L2 CO6
Complete?
Set – 12
H.T No. 21D41A05J8 to 21D41A05K2
PART – A
1. What is Deterministic algorithm? L1 CO6
2. What is Decision Problem? L1 CO6
PART - B
1. Explain the P, NP, NP-Hard and NP- complete classes? Give L2 CO6
relationship between them?
2. State and explain Cook’s Theorem L2 CO6
3. Explain different types of NP problems. L2 CO6
Set – 13
H.T No. 21D41A05K3 to 22D41A0515
PART – A
1. Compare P and NP. L4 CO6
2. Differentiate between NP-Complete and NP-Hard. L4 CO6
PART - B
1. What is meant by Halting problem explain with an example
L1 CO6
2. Differentiate between NP-Complete and NP-Hard. L4 CO6
3. Explain Optimization problem. L2 CO6
Set – 14
H.T No. 22D41A0516 to 22D41A0520
PART – A
1. Explain the P, NP, NP-Hard and NP- complete classes. L2 CO6
2. What is non deterministic algorithm explain. L1 CO6
PART - B
1. Explain the P, NP, NP-Hard and NP- complete classes? Give L2 CO6
relationship between them?
2. State and explain Cook’s Theorem L2 CO6
3. Explain different types of NP problems. L2 CO6
H.T No. 22D45A0524 to 22D45A0527
PART – A
1. What is Hamiltonian cycle ? L1 CO5
2. Define the term Branch and Bound Technique . L1 CO5
PART - B
1. L2 CO5
2. Explain Hamiltonian cycle with an example. L2 CO5
3. Using Backtracking enumerate how can you solve the L6 CO5
following problems
(c) 8-Queens problem
(d) Hamiltonian Cycle problem
