Discussion
Why can no uninformed strategy avoid exponential time in the worst case?
Answer: B
Lacking any information beyond the problem definition, the algorithm has no basis for preferring one branch over another and in the worst case must examine them all. A heuristic supplies exactly that basis, which is why informed search can do better. Data structures and goal testing contribute constant factors, and state spaces are not always exponential. Identifying the missing ingredient, rather than the inefficiency, is what points to the remedy. Most errors here come from carrying a result across from a neighbouring case where it does not hold.
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