Scribd
Upload
120 views1 page

CS 2251 - Design and Analysis of Algorithms Question Bank: Unit 4 - Backtracking Part A

Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, abandoning a partial solution ("backtracking") as soon as it is determined that the solution cannot possibly be completed from that state. The document lists questions about backtracking algorithms, including defining backtracking, factors that influence efficiency, the n-queens problem, and applications that can be solved using backtracking such as the knapsack problem, Hamiltonian circuits, graph coloring, and subset sum problems.

Uploaded by

CSETUBE
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
120 views1 page

CS 2251 - Design and Analysis of Algorithms Question Bank: Unit 4 - Backtracking Part A

Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, abandoning a partial solution ("backtracking") as soon as it is determined that the solution cannot possibly be completed from that state. The document lists questions about backtracking algorithms, including defining backtracking, factors that influence efficiency, the n-queens problem, and applications that can be solved using backtracking such as the knapsack problem, Hamiltonian circuits, graph coloring, and subset sum problems.

Uploaded by

CSETUBE
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

CS 2251 – Design and Analysis of Algorithms question bank

Unit 4 – Backtracking
Part A

1. What is backtracking?
2. What are the requirements that are needed for performing Backtracking?
3. What are the factors that influence the efficiency of the backtracking algorithm?
4. State the principle of backtracking?
5. What is n – queens problem?
6. Draw the solution for the 4 – queen problem.
7. State 8 – queens problem.
8. How can the output of a backtracking algorithm be thought of?
9. What is knapsack problem?
10. Define the Hamiltonian circuit.
11. State Sum of Subsets problem.
12. State m - colorability decision problem.
13. Define chromatic number of the graph.

Part B

1. Explain subset – sum problem and discuss the possible solution strategies using
backtracking.
2. Write short notes on n – Queen’s problem.
3. Discuss the use of Greedy method in solving Knapsack problem and subset – sum
problem.
4. What is backtracking? Explain in detail.
5. Explain in detail about the graph coloring techniques.
6. Explain the applications of backtracking.

You might also like