Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Data Structures
/
Exercises
/
Exercise 4
Data Structures
medium
0/15 answered
Q1
What is the space complexity of storing a graph with V vertices and E edges using adjacency list?
A
O(V)
B
O(E)
C
O(V + E)
D
O(V x E)
← Prev
1 / 15
Next →
← Exercise 3
Exercise 4 of 7
Exercise 5 →