Get App

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

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

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

  1. There is no practical difference in behavior, performance, or API design when Depth-First Search is involved.
  2. The oldest option related to Depth-First Search is always the right production choice regardless of context.
  3. DFS is natural for connectivity, cycle detection, and recursive decomposition, while BFS is natural for level distance.
  4. Differences around Depth-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: C. DFS is natural for connectivity, cycle detection, and recursive decomposition, while BFS is natural for level distance.

DFS is natural for connectivity, cycle detection, and recursive decomposition, while BFS is natural for level distance. This is the comparison that usually separates memorization from understanding.

Track: Java