Department of Computer Science and Engineering

CONTINUOUS ASSESSMENT TEST-1 (CAT-2), AUGUST 2025

Year/Semester: II/III Regulation: R2023

Course Name: DESIGN AND ANALYSIS OF ALGORITHM Course Code: U23CSBC01

Set 1

Part A - 2 Marks
1. Differentiate LC and FIFO branch and bound.

2. List steps in solving 0/1 knapsack using B&B.

3. List two applications of backtracking.

4. What is the base case in the N-Queen problem?

5. What is LC Branch and Bound?

Part B - 5 Marks
1. Discuss how Hamiltonian cycle is found using backtracking.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain the Sum of Subsets problem with suitable example.

4. Explain 0/1 knapsack using backtracking approach.

Part C - 10 Marks
1. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Solve 0/1 knapsack problem using backtracking and show all steps.
Set 2

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. Define the Sum of Subsets problem.

3. Differentiate LC and FIFO branch and bound.

4. What is the base case in the N-Queen problem?

5. State the Hamiltonian cycle problem.

Part B - 5 Marks
1. Describe the N-Queen problem and its backtracking solution.

2. Explain the Sum of Subsets problem with suitable example.

3. Discuss LC branch and bound with example.

4. Discuss how Hamiltonian cycle is found using backtracking.

Part C - 10 Marks
1. Explain Graph coloring problem with an example and backtracking solution.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Discuss N-Queen problem with complete backtracking solution for 4 queens.

Set 3

Part A - 2 Marks
1. State the Hamiltonian cycle problem.

2. List two problems solved by branch and bound.

3. What is the base case in the N-Queen problem?

4. Define the TSP.

5. List the steps in solving 0/1 Knapsack using backtracking.

Part B - 5 Marks
1. Explain the Sum of Subsets problem with suitable example.

2. Discuss how Hamiltonian cycle is found using backtracking.

3. Explain TSP using branch and bound.

4. Write steps for solving graph coloring problem using backtracking.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Discuss N-Queen problem with complete backtracking solution for 4 queens.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

Set 4

Part A - 2 Marks
1. Define branch and bound.

2. List the steps in solving 0/1 Knapsack using backtracking.

3. Define the TSP.

4. What is LC Branch and Bound?

5. What is the role of bounding function in B&B?

Part B - 5 Marks
1. Explain TSP using branch and bound.

2. Describe the N-Queen problem and its backtracking solution.

3. Write steps for solving graph coloring problem using backtracking.

4. Discuss LC branch and bound with example.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Describe Hamiltonian cycle detection using backtracking with example.

3. Solve 0/1 knapsack problem using backtracking and show all steps.

Set 5

Part A - 2 Marks
1. Define the Sum of Subsets problem.

2. Define branch and bound.

3. List steps in solving 0/1 knapsack using B&B.

4. What is the FIFO approach in B&B?

5. Define backtracking.

Part B - 5 Marks
1. Discuss LC branch and bound with example.

2. Explain TSP using branch and bound.

3. Explain the Sum of Subsets problem with suitable example.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

2. Describe Hamiltonian cycle detection using backtracking with example.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 6

Part A - 2 Marks
1. State the Hamiltonian cycle problem.

2. Define the Sum of Subsets problem.

3. Differentiate LC and FIFO branch and bound.

4. What is LC Branch and Bound?

5. What is the FIFO approach in B&B?

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Explain 0/1 knapsack using backtracking approach.

3. Explain the Sum of Subsets problem with suitable example.

4. Illustrate the solution of 0/1 knapsack using branch and bound.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Solve TSP using branch and bound method with a given cost matrix.
3. Explain Graph coloring problem with an example and backtracking solution.

Set 7

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. What is the base case in the N-Queen problem?

3. Define the TSP.

4. Define backtracking.

5. What is the general method of backtracking?

Part B - 5 Marks
1. Explain TSP using branch and bound.

2. Explain the backtracking method with general structure.

3. Explain 0/1 knapsack using backtracking approach.

4. Discuss how Hamiltonian cycle is found using backtracking.

Part C - 10 Marks
1. Describe and implement the general method of branch and bound with example.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Explain the complete procedure of solving a TSP using B&B with bounding function.

Set 8

Part A - 2 Marks
1. What is the FIFO approach in B&B?

2. What is LC Branch and Bound?

3. What is the role of bounding function in B&B?

4. What is the base case in the N-Queen problem?

5. What is the general method of backtracking?

Part B - 5 Marks
1. Write steps for solving graph coloring problem using backtracking.
2. Explain the backtracking method with general structure.

3. Explain FIFO branch and bound approach.

4. Describe the N-Queen problem and its backtracking solution.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Describe and implement the general method of branch and bound with example.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 9

Part A - 2 Marks
1. Define the TSP.

2. List two applications of backtracking.

3. What is the FIFO approach in B&B?

4. What is the purpose of graph coloring?

5. List steps in solving 0/1 knapsack using B&B.

Part B - 5 Marks
1. Explain the Sum of Subsets problem with suitable example.

2. Describe general method of branch and bound.

3. Differentiate backtracking and branch and bound methods.

4. Explain TSP using branch and bound.

Part C - 10 Marks
1. Describe and implement the general method of branch and bound with example.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

Set 10

Part A - 2 Marks
1. What is LC Branch and Bound?
2. What is the role of bounding function in B&B?

3. List steps in solving 0/1 knapsack using B&B.

4. Define branch and bound.

5. What is the FIFO approach in B&B?

Part B - 5 Marks
1. Describe general method of branch and bound.

2. Explain 0/1 knapsack using backtracking approach.

3. Explain TSP using branch and bound.

4. Describe the N-Queen problem and its backtracking solution.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 11

Part A - 2 Marks
1. What is the FIFO approach in B&B?

2. What is the base case in the N-Queen problem?

3. Define branch and bound.

4. Define the Sum of Subsets problem.

5. List the steps in solving 0/1 Knapsack using backtracking.

Part B - 5 Marks
1. Explain FIFO branch and bound approach.

2. Differentiate backtracking and branch and bound methods.

3. Describe general method of branch and bound.

4. Explain TSP using branch and bound.

Part C - 10 Marks
1. Solve 0/1 knapsack problem using backtracking and show all steps.
2. Describe Hamiltonian cycle detection using backtracking with example.

3. Discuss N-Queen problem with complete backtracking solution for 4 queens.

Set 12

Part A - 2 Marks
1. What is the role of bounding function in B&B?

2. List steps in solving 0/1 knapsack using B&B.

3. List the steps in solving 0/1 Knapsack using backtracking.

4. What is LC Branch and Bound?

5. What is the FIFO approach in B&B?

Part B - 5 Marks
1. Explain 0/1 knapsack using backtracking approach.

2. Discuss LC branch and bound with example.

3. Explain TSP using branch and bound.

4. Explain the backtracking method with general structure.

Part C - 10 Marks
1. Solve TSP using branch and bound method with a given cost matrix.

2. Explain the complete procedure of solving a TSP using B&B with bounding function.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 13

Part A - 2 Marks
1. List the steps in solving 0/1 Knapsack using backtracking.

2. What is the purpose of graph coloring?

3. List two applications of backtracking.

4. Define the TSP.

5. What is the general method of backtracking?

Part B - 5 Marks
1. Write steps for solving graph coloring problem using backtracking.

2. Differentiate backtracking and branch and bound methods.

3. Discuss LC branch and bound with example.

4. Explain TSP using branch and bound.

Part C - 10 Marks
1. Explain the complete procedure of solving a TSP using B&B with bounding function.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 14

Part A - 2 Marks
1. Differentiate LC and FIFO branch and bound.

2. What is the base case in the N-Queen problem?

3. Define backtracking.

4. What is LC Branch and Bound?

5. Define branch and bound.

Part B - 5 Marks
1. Explain TSP using branch and bound.

2. Explain the Sum of Subsets problem with suitable example.

3. Discuss LC branch and bound with example.

4. Describe general method of branch and bound.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Describe and implement the general method of branch and bound with example.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.
Set 15

Part A - 2 Marks
1. Define the TSP.

2. List two problems solved by branch and bound.

3. List steps in solving 0/1 knapsack using B&B.

4. What is the role of bounding function in B&B?

5. List two applications of backtracking.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.

2. Explain 0/1 knapsack using backtracking approach.

3. Explain the Sum of Subsets problem with suitable example.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Solve TSP using branch and bound method with a given cost matrix.

Set 16

Part A - 2 Marks
1. What is the purpose of graph coloring?

2. Define the Sum of Subsets problem.

3. List the steps in solving 0/1 Knapsack using backtracking.

4. List steps in solving 0/1 knapsack using B&B.

5. List two applications of backtracking.

Part B - 5 Marks
1. Describe general method of branch and bound.

2. Discuss how Hamiltonian cycle is found using backtracking.

3. Explain TSP using branch and bound.

4. Write steps for solving graph coloring problem using backtracking.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Explain Graph coloring problem with an example and backtracking solution.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

Set 17

Part A - 2 Marks
1. What is the role of bounding function in B&B?

2. Differentiate LC and FIFO branch and bound.

3. What is the FIFO approach in B&B?

4. List the steps in solving 0/1 Knapsack using backtracking.

5. Define the Sum of Subsets problem.

Part B - 5 Marks
1. Describe general method of branch and bound.

2. Explain the backtracking method with general structure.

3. Explain 0/1 knapsack using backtracking approach.

4. Explain TSP using branch and bound.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Explain Graph coloring problem with an example and backtracking solution.

3. Solve 0/1 knapsack problem using backtracking and show all steps.

Set 18

Part A - 2 Marks
1. State the Hamiltonian cycle problem.

2. Define branch and bound.

3. Define backtracking.

4. What is the FIFO approach in B&B?

5. What is the base case in the N-Queen problem?

Part B - 5 Marks
1. Describe the N-Queen problem and its backtracking solution.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain the Sum of Subsets problem with suitable example.

4. Illustrate the solution of 0/1 knapsack using branch and bound.

Part C - 10 Marks
1. Solve 0/1 knapsack problem using backtracking and show all steps.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 19

Part A - 2 Marks
1. List steps in solving 0/1 knapsack using B&B.

2. List the steps in solving 0/1 Knapsack using backtracking.

3. What is the role of bounding function in B&B?

4. Define the Sum of Subsets problem.

5. Define branch and bound.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.

2. Write steps for solving graph coloring problem using backtracking.

3. Describe the N-Queen problem and its backtracking solution.

4. Discuss LC branch and bound with example.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Discuss and compare LC and FIFO branch and bound with illustrations.
3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

Set 20

Part A - 2 Marks
1. List steps in solving 0/1 knapsack using B&B.

2. Define the Sum of Subsets problem.

3. What is the base case in the N-Queen problem?

4. What is the general method of backtracking?

5. Define backtracking.

Part B - 5 Marks
1. Discuss how Hamiltonian cycle is found using backtracking.

2. Describe the N-Queen problem and its backtracking solution.

3. Describe general method of branch and bound.

4. Explain the backtracking method with general structure.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 21

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. Define backtracking.

3. List the steps in solving 0/1 Knapsack using backtracking.

4. What is the base case in the N-Queen problem?

5. State the Hamiltonian cycle problem.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.
2. Describe the N-Queen problem and its backtracking solution.

3. Explain FIFO branch and bound approach.

4. Differentiate backtracking and branch and bound methods.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Describe Hamiltonian cycle detection using backtracking with example.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

Set 22

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. What is the general method of backtracking?

3. What is the base case in the N-Queen problem?

4. What is LC Branch and Bound?

5. Define the TSP.

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Explain TSP using branch and bound.

3. Discuss how Hamiltonian cycle is found using backtracking.

4. Explain the backtracking method with general structure.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 23

Part A - 2 Marks
1. State the Hamiltonian cycle problem.
2. Define backtracking.

3. List two problems solved by branch and bound.

4. List steps in solving 0/1 knapsack using B&B.

5. What is LC Branch and Bound?

Part B - 5 Marks
1. Discuss LC branch and bound with example.

2. Describe general method of branch and bound.

3. Explain the backtracking method with general structure.

4. Explain the Sum of Subsets problem with suitable example.

Part C - 10 Marks
1. Explain the complete procedure of solving a TSP using B&B with bounding function.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

Set 24

Part A - 2 Marks
1. List two applications of backtracking.

2. What is the role of bounding function in B&B?

3. Differentiate LC and FIFO branch and bound.

4. List two problems solved by branch and bound.

5. List steps in solving 0/1 knapsack using B&B.

Part B - 5 Marks
1. Describe the N-Queen problem and its backtracking solution.

2. Write steps for solving graph coloring problem using backtracking.

3. Discuss how Hamiltonian cycle is found using backtracking.

4. Explain TSP using branch and bound.

Part C - 10 Marks
1. Solve TSP using branch and bound method with a given cost matrix.
2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Discuss N-Queen problem with complete backtracking solution for 4 queens.

Set 25

Part A - 2 Marks
1. What is the purpose of graph coloring?

2. Define the TSP.

3. What is LC Branch and Bound?

4. Differentiate LC and FIFO branch and bound.

5. List steps in solving 0/1 knapsack using B&B.

Part B - 5 Marks
1. Explain FIFO branch and bound approach.

2. Explain the backtracking method with general structure.

3. Differentiate backtracking and branch and bound methods.

4. Explain 0/1 knapsack using backtracking approach.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Explain the complete procedure of solving a TSP using B&B with bounding function.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

Set 26

Part A - 2 Marks
1. What is the FIFO approach in B&B?

2. Define the Sum of Subsets problem.

3. What is the purpose of graph coloring?

4. List two problems solved by branch and bound.

5. What is the role of bounding function in B&B?

Part B - 5 Marks
1. Explain the Sum of Subsets problem with suitable example.

2. Discuss how Hamiltonian cycle is found using backtracking.

3. Write steps for solving graph coloring problem using backtracking.

4. Discuss LC branch and bound with example.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Explain the complete procedure of solving a TSP using B&B with bounding function.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 27

Part A - 2 Marks
1. What is the purpose of graph coloring?

2. List two problems solved by branch and bound.

3. What is the FIFO approach in B&B?

4. Define branch and bound.

5. What is the role of bounding function in B&B?

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.

2. Write steps for solving graph coloring problem using backtracking.

3. Differentiate backtracking and branch and bound methods.

4. Explain 0/1 knapsack using backtracking approach.

Part C - 10 Marks
1. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.
Set 28

Part A - 2 Marks
1. What is the general method of backtracking?

2. State the Hamiltonian cycle problem.

3. List two applications of backtracking.

4. What is the FIFO approach in B&B?

5. What is LC Branch and Bound?

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Explain the Sum of Subsets problem with suitable example.

3. Describe general method of branch and bound.

4. Describe the N-Queen problem and its backtracking solution.

Part C - 10 Marks
1. Describe and implement the general method of branch and bound with example.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Discuss N-Queen problem with complete backtracking solution for 4 queens.

Set 29

Part A - 2 Marks
1. What is the purpose of graph coloring?

2. What is LC Branch and Bound?

3. What is the FIFO approach in B&B?

4. What is the base case in the N-Queen problem?

5. List two problems solved by branch and bound.

Part B - 5 Marks
1. Explain TSP using branch and bound.

2. Discuss how Hamiltonian cycle is found using backtracking.

3. Illustrate the solution of 0/1 knapsack using branch and bound.

4. Differentiate backtracking and branch and bound methods.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Explain the complete procedure of solving a TSP using B&B with bounding function.

Set 30

Part A - 2 Marks
1. Differentiate LC and FIFO branch and bound.

2. What is the general method of backtracking?

3. Define the TSP.

4. Define backtracking.

5. Define branch and bound.

Part B - 5 Marks
1. Discuss how Hamiltonian cycle is found using backtracking.

2. Explain TSP using branch and bound.

3. Describe the N-Queen problem and its backtracking solution.

4. Illustrate the solution of 0/1 knapsack using branch and bound.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

Set 31

Part A - 2 Marks
1. List the steps in solving 0/1 Knapsack using backtracking.

2. State the Hamiltonian cycle problem.

3. Define the TSP.

4. What is the base case in the N-Queen problem?

5. Define branch and bound.

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Discuss LC branch and bound with example.

3. Describe general method of branch and bound.

4. Write steps for solving graph coloring problem using backtracking.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Discuss N-Queen problem with complete backtracking solution for 4 queens.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 32

Part A - 2 Marks
1. What is the role of bounding function in B&B?

2. List steps in solving 0/1 knapsack using B&B.

3. Define backtracking.

4. What is the general method of backtracking?

5. State the Hamiltonian cycle problem.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain 0/1 knapsack using backtracking approach.

4. Discuss how Hamiltonian cycle is found using backtracking.

Part C - 10 Marks
1. Explain Graph coloring problem with an example and backtracking solution.

2. Solve 0/1 knapsack problem using backtracking and show all steps.
3. Describe Hamiltonian cycle detection using backtracking with example.

Set 33

Part A - 2 Marks
1. Define the TSP.

2. What is the FIFO approach in B&B?

3. List two problems solved by branch and bound.

4. What is LC Branch and Bound?

5. Define backtracking.

Part B - 5 Marks
1. Describe general method of branch and bound.

2. Explain the Sum of Subsets problem with suitable example.

3. Explain the backtracking method with general structure.

4. Explain TSP using branch and bound.

Part C - 10 Marks
1. Explain the complete procedure of solving a TSP using B&B with bounding function.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 34

Part A - 2 Marks
1. Define the TSP.

2. What is the role of bounding function in B&B?

3. What is the FIFO approach in B&B?

4. What is LC Branch and Bound?

5. What is the base case in the N-Queen problem?

Part B - 5 Marks
1. Explain FIFO branch and bound approach.
2. Explain the backtracking method with general structure.

3. Explain TSP using branch and bound.

4. Discuss LC branch and bound with example.

Part C - 10 Marks
1. Explain the complete procedure of solving a TSP using B&B with bounding function.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Discuss N-Queen problem with complete backtracking solution for 4 queens.

Set 35

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. What is LC Branch and Bound?

3. List steps in solving 0/1 knapsack using B&B.

4. Differentiate LC and FIFO branch and bound.

5. What is the general method of backtracking?

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain 0/1 knapsack using backtracking approach.

4. Describe general method of branch and bound.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 36

Part A - 2 Marks
1. State the Hamiltonian cycle problem.
2. Define the TSP.

3. Define the Sum of Subsets problem.

4. What is the FIFO approach in B&B?

5. List steps in solving 0/1 knapsack using B&B.

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Describe general method of branch and bound.

3. Explain the Sum of Subsets problem with suitable example.

4. Discuss how Hamiltonian cycle is found using backtracking.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Explain Graph coloring problem with an example and backtracking solution.

3. Describe and implement the general method of branch and bound with example.

Set 37

Part A - 2 Marks
1. What is the FIFO approach in B&B?

2. Define backtracking.

3. State the Hamiltonian cycle problem.

4. Define the TSP.

5. What is the general method of backtracking?

Part B - 5 Marks
1. Explain 0/1 knapsack using backtracking approach.

2. Discuss how Hamiltonian cycle is found using backtracking.

3. Explain the backtracking method with general structure.

4. Differentiate backtracking and branch and bound methods.

Part C - 10 Marks
1. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.
2. Describe and implement the general method of branch and bound with example.

3. Discuss and compare LC and FIFO branch and bound with illustrations.

Set 38

Part A - 2 Marks
1. State the Hamiltonian cycle problem.

2. Define backtracking.

3. What is the purpose of graph coloring?

4. What is the base case in the N-Queen problem?

5. What is the role of bounding function in B&B?

Part B - 5 Marks
1. Describe general method of branch and bound.

2. Explain the Sum of Subsets problem with suitable example.

3. Explain TSP using branch and bound.

4. Write steps for solving graph coloring problem using backtracking.

Part C - 10 Marks
1. Solve 0/1 knapsack problem using backtracking and show all steps.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 39

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. Define the TSP.

3. Define backtracking.

4. State the Hamiltonian cycle problem.

5. List steps in solving 0/1 knapsack using B&B.

Part B - 5 Marks
1. Describe general method of branch and bound.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain FIFO branch and bound approach.

4. Describe the N-Queen problem and its backtracking solution.

Part C - 10 Marks
1. Describe and implement the general method of branch and bound with example.

2. Discuss and compare LC and FIFO branch and bound with illustrations.

3. Explain the complete procedure of solving a TSP using B&B with bounding function.

Set 40

Part A - 2 Marks
1. Define the TSP.

2. What is the role of bounding function in B&B?

3. List two problems solved by branch and bound.

4. Differentiate LC and FIFO branch and bound.

5. Define backtracking.

Part B - 5 Marks
1. Explain FIFO branch and bound approach.

2. Illustrate the solution of 0/1 knapsack using branch and bound.

3. Discuss LC branch and bound with example.

4. Explain the backtracking method with general structure.

Part C - 10 Marks
1. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Explain the complete procedure of solving a TSP using B&B with bounding function.
Set 41

Part A - 2 Marks
1. What is the purpose of graph coloring?

2. What is the general method of backtracking?

3. What is the FIFO approach in B&B?

4. List two problems solved by branch and bound.

5. What is the base case in the N-Queen problem?

Part B - 5 Marks
1. Discuss LC branch and bound with example.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain FIFO branch and bound approach.

4. Differentiate backtracking and branch and bound methods.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Discuss N-Queen problem with complete backtracking solution for 4 queens.

Set 42

Part A - 2 Marks
1. What is the purpose of graph coloring?

2. List the steps in solving 0/1 Knapsack using backtracking.

3. What is the base case in the N-Queen problem?

4. What is the general method of backtracking?

5. List two applications of backtracking.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.

2. Write steps for solving graph coloring problem using backtracking.

3. Explain FIFO branch and bound approach.

4. Describe the N-Queen problem and its backtracking solution.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Explain the complete procedure of solving a TSP using B&B with bounding function.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

Set 43

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. List two applications of backtracking.

3. Define the Sum of Subsets problem.

4. Define backtracking.

5. State the Hamiltonian cycle problem.

Part B - 5 Marks
1. Differentiate backtracking and branch and bound methods.

2. Explain the Sum of Subsets problem with suitable example.

3. Explain the backtracking method with general structure.

4. Discuss LC branch and bound with example.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Solve TSP using branch and bound method with a given cost matrix.

3. Solve 0/1 knapsack problem using backtracking and show all steps.

Set 44

Part A - 2 Marks
1. List two applications of backtracking.

2. Define the TSP.

3. What is LC Branch and Bound?

4. List two problems solved by branch and bound.

5. What is the general method of backtracking?

Part B - 5 Marks
1. Explain the Sum of Subsets problem with suitable example.

2. Explain 0/1 knapsack using backtracking approach.

3. Describe the N-Queen problem and its backtracking solution.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Explain Graph coloring problem with an example and backtracking solution.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Solve TSP using branch and bound method with a given cost matrix.

Set 45

Part A - 2 Marks
1. What is LC Branch and Bound?

2. What is the FIFO approach in B&B?

3. Define backtracking.

4. List steps in solving 0/1 knapsack using B&B.

5. List the steps in solving 0/1 Knapsack using backtracking.

Part B - 5 Marks
1. Explain the Sum of Subsets problem with suitable example.

2. Explain 0/1 knapsack using backtracking approach.

3. Describe general method of branch and bound.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Describe Hamiltonian cycle detection using backtracking with example.

3. Solve TSP using branch and bound method with a given cost matrix.

Set 46

Part A - 2 Marks
1. Define branch and bound.

2. List steps in solving 0/1 knapsack using B&B.

3. What is the FIFO approach in B&B?

4. What is the purpose of graph coloring?

5. List two problems solved by branch and bound.

Part B - 5 Marks
1. Write steps for solving graph coloring problem using backtracking.

2. Explain the backtracking method with general structure.

3. Explain 0/1 knapsack using backtracking approach.

4. Illustrate the solution of 0/1 knapsack using branch and bound.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Solve 0/1 knapsack problem using backtracking and show all steps.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

Set 47

Part A - 2 Marks
1. What is the base case in the N-Queen problem?

2. What is the role of bounding function in B&B?

3. List two applications of backtracking.

4. List two problems solved by branch and bound.

5. Define backtracking.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.
2. Write steps for solving graph coloring problem using backtracking.

3. Explain TSP using branch and bound.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Solve TSP using branch and bound method with a given cost matrix.

2. Describe and implement the general method of branch and bound with example.

3. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

Set 48

Part A - 2 Marks
1. Define the TSP.

2. State the Hamiltonian cycle problem.

3. List two problems solved by branch and bound.

4. What is the purpose of graph coloring?

5. Define the Sum of Subsets problem.

Part B - 5 Marks
1. Explain 0/1 knapsack using backtracking approach.

2. Explain TSP using branch and bound.

3. Describe the N-Queen problem and its backtracking solution.

4. Differentiate backtracking and branch and bound methods.

Part C - 10 Marks
1. Explain the complete procedure of solving a TSP using B&B with bounding function.

2. Describe and implement the general method of branch and bound with example.

3. Solve TSP using branch and bound method with a given cost matrix.

Set 49

Part A - 2 Marks
1. What is the purpose of graph coloring?
2. List the steps in solving 0/1 Knapsack using backtracking.

3. List two applications of backtracking.

4. What is the role of bounding function in B&B?

5. State the Hamiltonian cycle problem.

Part B - 5 Marks
1. Explain the Sum of Subsets problem with suitable example.

2. Illustrate the solution of 0/1 knapsack using branch and bound.

3. Explain FIFO branch and bound approach.

4. Describe the N-Queen problem and its backtracking solution.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Discuss N-Queen problem with complete backtracking solution for 4 queens.

3. Describe and implement the general method of branch and bound with example.

Set 50

Part A - 2 Marks
1. What is the role of bounding function in B&B?

2. What is the purpose of graph coloring?

3. List steps in solving 0/1 knapsack using B&B.

4. List the steps in solving 0/1 Knapsack using backtracking.

5. Define branch and bound.

Part B - 5 Marks
1. Illustrate the solution of 0/1 knapsack using branch and bound.

2. Explain the backtracking method with general structure.

3. Explain FIFO branch and bound approach.

4. Discuss LC branch and bound with example.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.
2. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

3. Explain the complete procedure of solving a TSP using B&B with bounding function.

Set 51

Part A - 2 Marks
1. What is the general method of backtracking?

2. Differentiate LC and FIFO branch and bound.

3. What is the purpose of graph coloring?

4. List two applications of backtracking.

5. Define the Sum of Subsets problem.

Part B - 5 Marks
1. Explain the backtracking method with general structure.

2. Illustrate the solution of 0/1 knapsack using branch and bound.

3. Discuss LC branch and bound with example.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

2. Explain Graph coloring problem with an example and backtracking solution.

3. Describe and implement the general method of branch and bound with example.

Set 52

Part A - 2 Marks
1. What is the FIFO approach in B&B?

2. Define the Sum of Subsets problem.

3. Define the TSP.

4. Differentiate LC and FIFO branch and bound.

5. List two applications of backtracking.

Part B - 5 Marks
1. Explain the backtracking method with general structure.

2. Illustrate the solution of 0/1 knapsack using branch and bound.

3. Explain TSP using branch and bound.

4. Describe general method of branch and bound.

Part C - 10 Marks
1. Explain Graph coloring problem with an example and backtracking solution.

2. Describe Hamiltonian cycle detection using backtracking with example.

3. Explain the complete procedure of solving a TSP using B&B with bounding function.

Set 53

Part A - 2 Marks
1. Define branch and bound.

2. List the steps in solving 0/1 Knapsack using backtracking.

3. List two problems solved by branch and bound.

4. What is the FIFO approach in B&B?

5. What is the purpose of graph coloring?

Part B - 5 Marks
1. Explain 0/1 knapsack using backtracking approach.

2. Explain FIFO branch and bound approach.

3. Write steps for solving graph coloring problem using backtracking.

4. Discuss how Hamiltonian cycle is found using backtracking.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Describe and implement the general method of branch and bound with example.

3. Describe Hamiltonian cycle detection using backtracking with example.

Set 54

Part A - 2 Marks
1. State the Hamiltonian cycle problem.

2. What is the general method of backtracking?

3. List the steps in solving 0/1 Knapsack using backtracking.

4. What is the base case in the N-Queen problem?

5. Define the Sum of Subsets problem.

Part B - 5 Marks
1. Explain 0/1 knapsack using backtracking approach.

2. Describe the N-Queen problem and its backtracking solution.

3. Discuss LC branch and bound with example.

4. Explain FIFO branch and bound approach.

Part C - 10 Marks
1. Explain the complete procedure of solving a TSP using B&B with bounding function.

2. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

3. Explain Graph coloring problem with an example and backtracking solution.

Set 55

Part A - 2 Marks
1. List the steps in solving 0/1 Knapsack using backtracking.

2. What is the purpose of graph coloring?

3. Define the Sum of Subsets problem.

4. Define the TSP.

5. What is the base case in the N-Queen problem?

Part B - 5 Marks
1. Discuss LC branch and bound with example.

2. Explain the Sum of Subsets problem with suitable example.

3. Write steps for solving graph coloring problem using backtracking.

4. Illustrate the solution of 0/1 knapsack using branch and bound.

Part C - 10 Marks
1. Solve 0/1 knapsack problem using backtracking and show all steps.

2. Discuss and compare LC and FIFO branch and bound with illustrations.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.

Set 56

Part A - 2 Marks
1. What is the base case in the N-Queen problem?

2. What is the purpose of graph coloring?

3. What is the FIFO approach in B&B?

4. List the steps in solving 0/1 Knapsack using backtracking.

5. Define the Sum of Subsets problem.

Part B - 5 Marks
1. Explain TSP using branch and bound.

2. Explain FIFO branch and bound approach.

3. Differentiate backtracking and branch and bound methods.

4. Discuss how Hamiltonian cycle is found using backtracking.

Part C - 10 Marks
1. Solve TSP using branch and bound method with a given cost matrix.

2. Discuss N-Queen problem with complete backtracking solution for 4 queens.

3. Discuss and compare LC and FIFO branch and bound with illustrations.

Set 57

Part A - 2 Marks
1. What is the base case in the N-Queen problem?

2. Define branch and bound.

3. What is LC Branch and Bound?

4. Define the TSP.

5. What is the role of bounding function in B&B?

Part B - 5 Marks
1. Describe the N-Queen problem and its backtracking solution.

2. Explain 0/1 knapsack using backtracking approach.

3. Explain the Sum of Subsets problem with suitable example.

4. Write steps for solving graph coloring problem using backtracking.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Describe and implement the general method of branch and bound with example.

3. Discuss and compare LC and FIFO branch and bound with illustrations.

Set 58

Part A - 2 Marks
1. List two problems solved by branch and bound.

2. Define branch and bound.

3. Define the Sum of Subsets problem.

4. State the Hamiltonian cycle problem.

5. Define backtracking.

Part B - 5 Marks
1. Explain the backtracking method with general structure.

2. Explain the Sum of Subsets problem with suitable example.

3. Describe general method of branch and bound.

4. Write steps for solving graph coloring problem using backtracking.

Part C - 10 Marks
1. Discuss and compare LC and FIFO branch and bound with illustrations.

2. Discuss N-Queen problem with complete backtracking solution for 4 queens.

3. Solve TSP using branch and bound method with a given cost matrix.

Set 59

Part A - 2 Marks
1. Define the TSP.

2. What is LC Branch and Bound?

3. Define branch and bound.

4. State the Hamiltonian cycle problem.

5. What is the general method of backtracking?

Part B - 5 Marks
1. Discuss LC branch and bound with example.

2. Discuss how Hamiltonian cycle is found using backtracking.

3. Explain TSP using branch and bound.

4. Describe general method of branch and bound.

Part C - 10 Marks
1. Discuss N-Queen problem with complete backtracking solution for 4 queens.

2. Illustrate the Sum of Subsets problem using backtracking for a given set and target.

3. Describe and implement the general method of branch and bound with example.

Set 60

Part A - 2 Marks
1. Differentiate LC and FIFO branch and bound.

2. Define the TSP.

3. What is LC Branch and Bound?

4. Define the Sum of Subsets problem.

5. List two problems solved by branch and bound.

Part B - 5 Marks
1. Discuss LC branch and bound with example.
2. Write steps for solving graph coloring problem using backtracking.

3. Differentiate backtracking and branch and bound methods.

4. Describe general method of branch and bound.

Part C - 10 Marks
1. Describe Hamiltonian cycle detection using backtracking with example.

2. Discuss and compare LC and FIFO branch and bound with illustrations.

3. Illustrate 0/1 knapsack problem using both backtracking and B&B methods.