Which of the following statements about graph representations and algorithms…
GSET 2025
Which of the following statements about graph representations and algorithms is incorrect ?
- A.
In a graphs, adjacency list representation is generally more memory-efficient than an adjacency matrix.
- B.
For a directed acyclic graph with 5 nodes, the maximum and minimum number of arcs is 10 and 0 respectively.
- C.
Kruskal’s algorithm is one of the algorithms to construct a minimal spanning trees having time complexity of O(E log E), where E is the number of edges.
- D.
A spanning tree remains minimal even after adding an edge that creates a cycle, as long as the new edge’s weight is less than or equal to all other edges in that cycle.
Attempted by 10 students.
Sign up free to check your answer
Sign up freeLoading lesson…

