1.

For some sparse graph an adjacency list is more space efficient against an adjacency matrix.(a) True(b) FalseEnquiry is from Adjacency List topic in portion Graph of Data Structures & Algorithms II got this question in my homework.

Answer»

Right OPTION is (a) True

Easiest explanation - SPACE COMPLEXITY for adjacency matrix is ALWAYS O(V*V) while space complexity for adjacency list in this case would be O(V).



Discussion

No Comment Found

Related InterviewSolutions