Discussion
Match each strategy with the frontier discipline it uses.
List I
A. Breadth first
B. Depth first
C. Uniform cost
D. Iterative deepening
List II
P. first in first out queue
Q. last in first out stack
R. priority queue on path cost
S. repeated depth limited stack
Select the correct match.
Answer: B
The entire family differs only in how the frontier is ordered, and every property follows from that one choice. An implementation can switch between them by changing the container, which makes the comparison concrete rather than abstract. Iterative deepening is the exception in being a wrapper around repeated depth limited searches rather than a single discipline, which is why it appears as a strategy rather than a data structure.
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