Discussion
Three of the following are complete under mild conditions. Which is the odd one out?
Depth first tree search in an infinite space
Breadth first search with finite branching factor
Uniform cost search with positive step costs
Iterative deepening with finite branching factor
Answer: D
Breadth first, uniform cost and iterative deepening all find a solution if one exists at finite depth. Depth first tree search may descend an infinite branch forever and never return, so it is incomplete in an infinite space. Adding a depth limit or cycle detection restores completeness in the finite case. The odd one out is the algorithm whose only advantage, memory, is bought by surrendering a guarantee.
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