Medium-EasyUnderstandGraphsMultiple Choice
What is the space complexity of storing a graph as an adjacency matrix vs adjacency list?
Understand — Tests comprehension and ability to explain concepts.
Answer Options
AMatrix O(V+E), List O(V²)
BMatrix O(V²), List O(V+E)
CBoth O(V²)
DBoth O(V+E)
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 33+ more Graphs questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Graphs topic (Algorithms).
More Graphs Questions
What is the time complexity of BFS on a graph with V vertices and E edges?
EasyWhat is the difference between a directed and undirected graph?
EasyWhat property of a graph must hold for topological sort to be possible?
EasyWhat is the in-degree of a node in a directed graph?
EasyWhat does an empty result from Kahn's topological sort indicate?
Medium-Easy