Discussion
For which problems is local search appropriate?
Answer: B
In scheduling, layout and configuration problems the answer is the final arrangement rather than the sequence of edits that produced it, so nothing is lost by forgetting the path. Small spaces admit anything, provable optimality is exactly what local search sacrifices, and irreversibility is unrelated. Asking whether the path is part of the answer is the first test of whether local search applies, and it is a question about the problem rather than about the algorithm.
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