Graphs MCQ question and answer with solution | Data Structure MCQs

A. O(V log V)

B. O(E)

C. O(V + E)

D. O(V²)

A. O(V)

B. O(E)

C. O(1)

D. O(V²)

A. The vertex's degree.

B. The cost or distance between two vertices.

C. The number of vertices in the graph.

D. The vertex's degree.

A. Dijkstra's Algorithm

B. Kruskal's Algorithm

C. Kosaraju's Algorithm

D. Prim's Algorithm

A. O(V²)

B. O(E)

C. O(V log V)

D. O(V + E)

A. It is a connected acyclic graph.

B. It is a directed graph with cycles.

C. It contains at least one cycle.

D. It has no edges.

A. Depth-First Search (DFS)

B. Bellman-Ford Algorithm

C. Kruskal's Algorithm

D. Floyd-Warshall Algorithm

A. It ignores them.

B. It converts them into positive weights.

C. It can handle them but not negative weight cycles.

D. It requires all edges to be non-negative.

A. To represent the graph in matrix form.

B. To store a list of adjacent vertices for each vertex.

C. To list all possible edges.

D. To represent the graph in matrix form.

A. Twice the number of edges.

B. The number of vertices.

C. The number of cycles.

D. The number of edges plus vertices.