Graph Algorithms (DFS, BFS, Dijkstras, etc) MCQ question and answer with solution | Data Structure MCQs

A. To detect cycles in the graph.

B. To connect all nodes with minimum total edge weight.

C. To find the shortest path in a weighted graph.

D. To detect cycles in the graph.

A. Bellman-Ford Algorithm

B. Dijkstra's Algorithm

C. Depth-First Search (DFS)

D. Breadth-First Search (BFS)

A. Using a stack

B. Using a priority queue

C. Using a set

D. Using a queue

A. To store the previous node for each node.

B. To store the current distance from the source.

C. To mark visited nodes.

D. To track the minimum distance.

A. Finding the maximum flow in a network.

B. Checking if a graph is connected.

C. Finding the shortest path in a weighted graph.

D. Finding the shortest path in an unweighted graph.

A. To explore all reachable vertices from a given source node.

B. To find the shortest path in a weighted graph.

C. To detect cycles in a graph.

D. To perform level-order traversal.

A. Bellman-Ford Algorithm

B. Breadth-First Search (BFS)

C. Floyd-Warshall Algorithm

D. Bellman-Ford Algorithm

A. O(E)

B. O(V log V)

C. O(V²)

D. O(V + E)

A. Dijkstra's Algorithm

B. Depth-First Search (DFS)

C. Bellman-Ford Algorithm

D. Prim's Algorithm and Kruskal's Algorithm

A. It detects cycles in a graph.

B. It finds the minimum spanning tree.

C. It visits all nodes in a specific order.

D. It calculates the shortest path.