Consider a graph with V vertices and E edges. The graph is represented using…
RSSB Computer Instructor · 2026 recruitment · Basic Computer Instructor · Paper II
Consider a graph with V vertices and E edges. The graph is represented using an adjacency matrix, where a matrix entry is maintained for every pair of vertices regardless of whether an edge exists between them.
What is the asymptotic space complexity of this representation ?
- A.
O(V)
- B.
O(E)
- C.
O(V + E)
- D.
O(V²)
- E.
Question not attempted
Attempted by 60 students.
Sign up free to check your answer
Sign up freeLoading lesson…