Discussion
Which of the following is a feature of the Backtracking algorithm ?
Answer: B
Backtracking builds a solution incrementally and removes those solutions that are not feasible.
Backtracking extends a partial solution one choice at a time and, as soon as a choice cannot lead to a valid solution, undoes it and tries the next. The N-queens problem and sudoku solving are typical uses.
It finds a valid solution but not necessarily the optimal one, it needs no sorting, and divide and conquer is a different strategy that splits a problem into independent subproblems.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development