Join WhatsApp ChannelDaily MCQs & Exam Updates
Computer Science Medium CSS PMS FPSC PPSC NTS Uploaded: 01 Jul 2026

Which search algorithm explores all nodes one level at a time before moving to the next level?

  • A A* Search
  • B Depth-First Search (DFS)
  • C Breadth-First Search (BFS)
  • D Greedy Search
Correct Answer: Option C — Breadth-First Search (BFS)
Explanation:
Breadth-First Search (BFS) explores a graph or tree level by level, visiting all nodes at the current depth before moving to the next level....
Submitted by: Chandi
Related MCQs