Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
If G = (V,E) is a directed graph, then length of adjacency list is ______ and it requires ______ amount of memory.
1
2|E|, θ(V)
2
|E|, θ(V+E)
3
|E|, θ(E)
4
2|E|, θ(V+E)
5
Question Not Attempted