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

A. It becomes O(V²)

B. It becomes O(V log V)

C. It becomes O(E log V)

D. It becomes O(E + V log V)

A. Dijkstra's Algorithm

B. Breadth-First Search (BFS)

C. Bellman-Ford Algorithm

D. Depth-First Search (DFS)

A. To find the minimum spanning tree.

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

C. To find a path between two nodes.

D. To check the connectivity of a graph.

A. Dijkstra's Algorithm

B. Floyd-Warshall Algorithm

C. Bellman-Ford Algorithm

D. A* Algorithm

A. A path that visits each node exactly once.

B. A path that revisits the starting node.

C. A path with exactly two nodes.

D. A path that visits each node exactly once.

A. Neither BFS nor DFS

B. Depth-First Search (DFS)

C. Both BFS and DFS

D. Breadth-First Search (BFS)

A. To store the order of node visits.

B. To track the number of edges.

C. To store the parent nodes for each node.

D. To store the shortest distance from the source to each node.

A. When finding shortest paths between all pairs of nodes.

B. When finding the shortest path from a single source.

C. When the graph is sparse.

D. When edge weights are all positive.

A. To detect cycles in undirected graphs.

B. To find the minimum spanning tree.

C. To find the shortest path in graphs with positive weights only.

D. To find the shortest path in graphs with negative weights.

A. By exploring nodes as deeply as possible.

B. By randomly visiting nodes.

C. By exploring all nodes at the current level before moving to the next level.

D. By following the shortest edge.