Get App

Java: In Java, which comparison about Adjacency List vs Adjacency Matrix is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about Adjacency List vs Adjacency Matrix is accurate?

  1. Adjacency lists save space for sparse graphs, while adjacency matrices give constant-time edge existence checks.
  2. There is no practical difference in behavior, performance, or API design when Adjacency List vs Adjacency Matrix is involved.
  3. The oldest option related to Adjacency List vs Adjacency Matrix is always the right production choice regardless of context.
  4. Differences around Adjacency List vs Adjacency Matrix 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: A. Adjacency lists save space for sparse graphs, while adjacency matrices give constant-time edge existence checks.

Adjacency lists save space for sparse graphs, while adjacency matrices give constant-time edge existence checks. This is the comparison that usually separates memorization from understanding.

Track: Java