Discussion
Which container implements the frontier of a depth first search?
Answer: B
Expanding the most recently generated node drives the search down one branch until it can go no further, which is depth first search, and it is often implemented by recursion rather than an explicit stack. A queue gives breadth first, and a priority queue on depth would simply reproduce breadth first. Hash tables are used for the explored set. The choice of container is the whole of the difference between the two fundamental strategies. A single measurement chosen to respond to the one asymmetry beats several that respond to shared behaviour.
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