Graphs - Practice Test | ExamPrepSheets

(A) Prim's Algorithm

(B) Floyd-Warshall Algorithm

(C) Bellman-Ford Algorithm

(D) Kruskal's Algorithm

(D) Kruskal's Algorithm

(A) The graph is bipartite.

(B) The graph contains multiple cycles.

(C) The shortest path cannot be computed reliably.

(D) The graph is a complete graph.

(C) The shortest path cannot be computed reliably.

(A) O(E)

(B) O(V + E)

(C) O(V log V)

(D) O(E)

(B) O(V + E)

(A) By applying dynamic programming only once.

(B) By performing DFS from each vertex.

(C) By considering all pairs of vertices and iteratively updating shortest paths.

(D) By using a priority queue for edge relaxation.

(C) By considering all pairs of vertices and iteratively updating shortest paths.

(A) To store all edges of the graph.

(B) To maintain the order of vertices during BFS.

(C) To perform depth-first search more efficiently.

(D) To efficiently extract the vertex with the minimum distance.

(D) To efficiently extract the vertex with the minimum distance.

Graphs - Study Mode