Discussion
Why does breadth first search's time bound use the solution depth?
Answer: D
Because it completes each level before starting the next, breadth first never touches a node below the level containing the goal, so its work is bounded by the solution depth. Depth first has no such guarantee. Cost ordering belongs to uniform cost, memory is a consequence rather than a cause, and goal testing order is a detail. The parameter appearing in a complexity bound follows directly from the order in which the algorithm works, which is why the two bounds differ.
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