• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Top MCQs on Backtracking Algorithm with Answers

Question 1

Which of the following is not a backtracking algorithm?
  • Knight tour problem
  • N queen problem
  • Tower of hanoi
  • M coloring problem

Question 2

Backtracking can be used to solve: 

  • Linear programming problems

  • Problems with a single feasible solution

  • Combinatorial optimization problems

  • Problems with a fixed set of solutions

Question 3

Backtracking may lead to a solution that is:

  •  Optimal 

  • Suboptimal 

  • Efficient 

  • Deterministic

Question 4

Backtracking is best suited for solving problems that involve:

  • Sorting elements 

  • Searching in a sorted list

  •  Dynamic programming 

  • Exploring all possible solutions

Question 5

Which of the following is an example of a problem that can be solved using backtracking?

  • Finding the median of an array

  •  Binary search in a sorted list 

  • Sudoku puzzle solving 

  • Calculating the sum of elements in an array

Question 6

Which of the following is NOT a characteristic of the backtracking algorithm? 

  • Recursive approach

  • Breadth-first exploration 

  • Depth-first exploration 

  • Trial and error

Question 7

Backtracking involves: 

  • Starting from the end of the problem 

  • Using a stack to keep track of solutions

  • Iterating through all elements in a list 

  • Going back to a previous step if the current step doesn't work 

Question 8

Who coined the term "Backtracking"?

  • Lehmer

  • Donald

  • Ross

  • Ford

Question 9

The backtracking algorithm is implemented by constructing a tree of choices known as?

  • State-chart-tree

  • Node tree

  • Backtracking tree

  • State-space tree

Question 10

 What happens when the backtracking algorithm reaches a complete solution?

  • It backtracks to the root

  • It traverses from a different route

  • it continues searching for other possible solutions

  • Recursively traverses through the same route

There are 10 questions to complete.

Last Updated :
Take a part in the ongoing discussion