Discussion
Why is backtracking necessary in depth first search?
Answer: D
When a branch runs out of unexplored successors without reaching a goal, the search must return to the most recent node with alternatives remaining and try the next one. That is exactly what a stack, or recursion, provides automatically. No states are skipped, the frontier order is fixed, and costs are accumulated incrementally. An algorithm whose control structure is provided free by the language's call stack is unusually simple to implement, which is part of its durability.
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