Question
When should a Python developer choose Queues and Breadth-First Search deliberately?
- Use BFS for level-order traversal, shortest path in unweighted graphs, and minimal-step state-space problems.
- Choose Queues and Breadth-First Search mainly when you want to postpone validation and fix issues manually later.
- Choose Queues and Breadth-First Search whenever you want the code to look more advanced, even if the design gets less clear.
- Choose Queues and Breadth-First Search only to avoid modeling the real data shape or domain contract explicitly.
Hint
Think about the production scenario where the choice genuinely improves the code.
Answer and rationale
Correct answer: A. Use BFS for level-order traversal, shortest path in unweighted graphs, and minimal-step state-space problems.
Use BFS for level-order traversal, shortest path in unweighted graphs, and minimal-step state-space problems. Interviewers often ask this to see whether you can connect the concept to real design decisions.
Track: Python