Graphs MCQ question and answer with solution | Data Structure MCQs

A. Complete Graph

B. Weighted Graph

C. Bipartite Graph

D. Directed Acyclic Graph (DAG)

A. To find the shortest path from a single source to all other vertices, even with negative weights.

B. To find the minimum spanning tree.

C. To detect cycles in a directed graph.

D. To sort vertices in topological order.

A. Dijkstra's Algorithm

B. Bellman-Ford Algorithm

C. Kruskal's Algorithm

D. Floyd-Warshall Algorithm

A. The graph contains no cycles.

B. The graph is bipartite.

C. There is a path from every vertex to every other vertex.

D. The graph is acyclic.

A. The total number of vertices in the graph.

B. The number of edges incoming to a vertex.

C. The number of cycles in the graph.

D. The total number of vertices in the graph.

A. Expanding the adjacency list of a vertex.

B. Removing edges that cause negative cycles.

C. Updating the shortest path estimate if a shorter path is found.

D. Adding a new vertex to the graph.

A. Dijkstra's Algorithm

B. Prim's Algorithm

C. Kruskal's Algorithm

D. Max-Flow Min-Cut Theorem

A. It is the total weight of all edges.

B. It represents the number of cycles in the graph.

C. It represents a partition of the vertices into two sets, where the minimum cut is the smallest set of edges that, if removed, would disconnect the source from the sink.

D. It represents the number of vertices in the graph.

A. Breadth-First Search (BFS)

B. Dijkstra's Algorithm

C. Bellman-Ford Algorithm

D. Depth-First Search (DFS)

A. O(V + E)

B. O(V²)

C. O(E)

D. O(V log V)