Skip to content

Courses
- For Working Professionals
  - LIVE
  - Self-Paced
- For Students
  - LIVE
  - Self-Paced
- School Courses
- All Courses
Tutorials
- Algorithms
- Data Structures
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - C#
  - JavaScript
  - jQuery
  - SQL
  - PHP
  - Scala
  - Perl
  - Go Language
  - HTML
  - CSS
  - Kotlin
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- Web Technologies
- Software Designs
  - Software Design Patterns
  - System Design Tutorial
- School Learning
  - School Programming
  - Mathematics
  - Maths Notes (Class 8-12)
  - NCERT Solutions
  - RD Sharma Solutions
  - Physics Notes (Class 8-11)
  - Chemistry Notes
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
Jobs
- Apply for Jobs
- Post a Job
  - Hire with Us
  - Know about Jobathon
- Jobathon
Practice

Write

Come write articles for us and get featured

Practice

Learn and code with the best industry experts

Premium

Get access to ad-free content, doubt assistance and more!

Jobs

Come and find your dream job with us

Table of Contents

Backtracking

Last Updated : 06 May, 2017

1

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

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

Backtracking 50 Algorithms MCQs with Answers
Discuss it

Question 1 Explanation:

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

There is 1 question to complete.

1

My Personal Notes

Start Your Coding Journey Now!