Discussion
Assertion (A): Iterative deepening is often preferred to breadth first search.
Reason (R): It offers the same completeness and optimality with linear rather than exponential memory.
Select the correct answer from the options below.
Answer: A
Both are true and the second is the reason. Because memory rather than time is usually the binding constraint, an algorithm that matches breadth first's guarantees while needing only the current path is preferable whenever the space is large. The cost is regenerating the upper levels, which the exponential structure of the tree makes cheap. Trading a small time penalty for a large memory saving is almost always the right bargain when the memory is what runs out first.
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