Discussion
What does completeness mean for a search algorithm?
Answer: C
Completeness is a guarantee about existence: if there is a solution the algorithm will find it, though possibly slowly. Exploring everything is one way to be complete but not the definition, returning the cheapest is optimality, and bounded time is a complexity claim. Keeping the four criteria separate matters because an algorithm may satisfy any subset of them, and a comparison table is only useful if each column means one thing.
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