VCE Algorithmics (HESS) Practice Questions - VCE Algorithmics (HESS) Units 3 & 4 Exam

Access More Questions

Consider a sparse connected graph G with V = 10,000 vertices and E = 20,000 edges. Which storage representation uses less memory space, and what is the time complexity to check whether an edge exists between vertex u and vertex v in an unsorted adjacency list?

Adjacency list uses less space; edge lookup takes O(deg(u)) time Adjacency matrix uses less space; edge lookup takes O(1) time Adjacency list uses less space; edge lookup takes O(1) time Adjacency matrix uses less space; edge lookup takes O(V) time

Correct Answer:

Adjacency list uses less space; edge lookup takes O(deg(u)) time

Access more questions from this quiz

Continue to VCE Algorithmics (HESS) Practice Questions - VCE Algorithmics (HESS) Units 3 & 4 Exam for more practice questions and the full quiz experience.

Access More Questions