Discussion
A search program solves small instances quickly but exhausts memory on slightly larger ones.
What is the most likely explanation?
Answer: B
Exponential growth means a small increase in depth multiplies the frontier size by the branching factor, so a program that fits comfortably at one size fails abruptly at the next. Switching to iterative deepening usually resolves it. A leak would show on small instances too, branching factor is usually constant, and goal testing is cheap. Abrupt failure at a slightly larger size is the characteristic signature of an exponential, and it points at the algorithm rather than at the code.
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