Discussion
What is the difference between tree search and graph search?
Answer: C
Both build a search tree; the difference is that graph search remembers which states it has already expanded and discards duplicates, which prevents loops and exponential blowup from repeated paths. The price is storing every expanded state. The underlying problem may be a graph in either case. Naming the algorithms by whether they remember, rather than by what they search, avoids the confusion the conventional names invite.
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