# Backtracking Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 1
Which of the problems cannot be solved by backtracking method?
 A n-queen problem B subset sum problem C hamiltonian circuit problem D travelling salesman problem

Question 1 Explanation:
N-queen problem, subset sum problem, Hamiltonian circuit problems can be solved by backtracking method whereas travelling salesman problem is solved by Branch and bound method.

 Question 2
Backtracking algorithm is implemented by constructing a tree of choice s called as?
 A State-space tree B State-chart tree C Node tree D Backtracking tree

Question 2 Explanation:
Backtracking problem is solved by constructing a tree of choice s called as the state-space tree. Its root represents an initial state before the search for a solution begins.

 Question 3
What happens when the backtracking algorithm reaches a complete solution?
 A It backtracks to the root B It continues searching for other possible solutions C It traverses from a different route D Recursively traverses through the same route

Question 3 Explanation:
When we reach a final solution using a backtracking algorithm, we either stop or continue searching for other possible solutions.

 Question 4
A node is said to be ..... if it has a possibility of reaching a complete solution.
 A Non-promising B Promising C Succeeding D Preceding

Question 4 Explanation:
If a node has a possibility of reaching the final solution, it is called a promising node. Otherwise, it is non-promising.

 Question 5
In what manner is a state-space tree for a backtracking algorithm constructed?
 A Depth-first search B Breadth-first search C Twice around the tree D Nearest neighbour first