Graphs - Study Mode
[#36] What is the main characteristic of a complete graph?
Correct Answer
(C) Every pair of vertices is connected by a unique edge.
[#37] What is a spanning tree of a graph?
Correct Answer
(D) A subgraph that includes all vertices and is connected without any cycles.
[#38] How can you determine if a graph contains a cycle using DFS?
Correct Answer
(A) By checking if there is a back edge during traversal.
[#39] Every Directed Acyclic Graph has at least one sink vertex.
Correct Answer
(A) True
[#40] The topological sorting of any DAG can be done in . . . . . . . . time.
Correct Answer
(C) linear