Algorithms | Backtracking | Question 1

Which of the following is not a backtracking algorithm?
(A) Knight tour problem
(B) N queen problem
(C) Tower of hanoi
(D) M coloring problem

Answer: (C)

Explanation: Knight tour problem, N Queen problem and M coloring problem involve backtracking. Tower of hanoi uses simple recursion.

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.