Get App

Java: In Java, which comparison about Breadth-First Search is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about Breadth-First Search is accurate?

  1. There is no practical difference in behavior, performance, or API design when Breadth-First Search is involved.
  2. BFS finds shortest path lengths in unweighted graphs, while DFS explores depth before breadth.
  3. The oldest option related to Breadth-First Search is always the right production choice regardless of context.
  4. Differences around Breadth-First Search are mostly cosmetic, so correctness and maintainability do not change.

Hint

Focus on the behavior or tradeoff, not just the keyword.

Answer and rationale

Correct answer: B. BFS finds shortest path lengths in unweighted graphs, while DFS explores depth before breadth.

BFS finds shortest path lengths in unweighted graphs, while DFS explores depth before breadth. This is the comparison that usually separates memorization from understanding.

Track: Java