Skip to content
Related Articles

Related Articles

Algorithms | Backtracking | Question 1

Improve Article
Save Article
Like Article
  • Difficulty Level : Basic
  • Last Updated : 10 Feb, 2013

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
Recommended Articles
Page :

Start Your Coding Journey Now!