Question
Which practice avoids a common mistake with Adjacency List vs Adjacency Matrix?
- Ignore the Adjacency List vs Adjacency Matrix issue and rely on team discipline instead of APIs or contracts.
- Silence the Adjacency List vs Adjacency Matrix problem by using raw types, broad catches, or shared mutable state.
- Do not call a matrix representation efficient by default when the graph is sparse and memory matters.
- Prefer the version of Adjacency List vs Adjacency Matrix that makes behavior less predictable as long as the code compiles.
Hint
Look for the option that protects correctness instead of hiding the problem.
Answer and rationale
Correct answer: C. Do not call a matrix representation efficient by default when the graph is sparse and memory matters.
Do not call a matrix representation efficient by default when the graph is sparse and memory matters. This is a common failure mode in real Java code and a frequent interview follow-up.
Track: Java