Discussion
What is the first change to try when breadth first search exhausts memory?
Answer: C
Iterative deepening retains completeness and optimality with unit costs while reducing the memory from exponential to linear, at a modest cost in repeated work. More memory buys only one extra level for each multiplication by the branching factor, a depth limit sacrifices completeness, and earlier goal testing saves a constant factor. Attacking the exponent rather than the constant is the only response that changes what is feasible.
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