Discussion
Is breadth first search complete?
Answer: B
Breadth first examines every node at depth d before any at depth d plus one, so if a solution exists at any finite depth it will be found, provided each node has finitely many successors. It does not loop, since repeated states are detected, and an infinite state space is no obstacle so long as the solution is at finite depth. Completeness under a stated condition is worth more than an unqualified claim, and the condition here is mild. Reading the definition literally, rather than recalling a formula, is the reliable route through questions of this shape.
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