PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2019 paper

Module 4: Graph and Tree Algorithms

20192m

Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

  • (i) In adjacency list representation, space is saved for sparse graphs.
  • (ii) DFS and BFS can be done in O(V+E)O(V+E) time for adjacency list representation. These operations take O(V2)O(V^2) time in adjacency matrix representation.
  • (iii) Adding a vertex in adjacency list representation is easier than adjacency matrix representation.
  • (iv) All of the above
Search GoogleAsk AI

Similar questions

Design and Analysis of Algorithms What is the time complexity of topological sorting of a directed acyclic graph (DAG) with V vertices and E edges using Depth-First Search (DFS)? (i) O(V^2) (ii) O(E^2) (iii) O(V+E) (iv) O(V.E)20232mDesign and Analysis of Algorithms BFS on a graph G = (V, E) has running time (i) O(|V| + |E|) (ii) O(|V|) (iii) O(|E|) (iv) None of these20222mDesign & Analysis of AlgorithmsBFS on a graph G=(V,E) has running time: - (i) O(|V|+|E|) - (ii) O(|V|) - (iii) O(|E|) - (iv) None of the above20232mDesign and Analysis of Algorithms An adjacency matrix representation of a graph cannot contain information of (i) nodes (ii) edges (iii) direction of edges (iv) parallel edges20222m
PreviousAn all-pairs shortest-paths problem is efficiently solved using: - (i) Dijkstra's algorithm - (ii) Bellman-Ford algorithm - (iii) Kruskal algorithm - (iv) Floyd-Warshall algorithmNextWhich of the following is true about Huffman Coding? - (i) Huffman coding may become lossy in some cases. - (ii) Huffman codes may not be optimal lossless codes in some cases. - (iii) In Huffman coding, no code is prefix of any other code. - (iv) All of the above
Budget AppAndroid App

Pocketly on Android

Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.

Install Pocketly