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

A. Breadth-First Search (BFS)

B. Depth-First Search (DFS)

C. Bellman-Ford Algorithm

D. Dijkstra's Algorithm

A. O(V + E)

B. O(V²)

C. O(E log V)

D. O(V log V)

A. Level order

B. Inorder

C. Postorder

D. Preorder

A. Dijkstra's Algorithm

B. Prim's Algorithm

C. Bellman-Ford Algorithm

D. Kruskal's Algorithm

A. BFS is used for weighted graphs; DFS is not.

B. BFS explores nodes level by level; DFS explores nodes deeply first.

C. BFS uses recursion, DFS does not.

D. BFS is used for weighted graphs; DFS is not.

A. Linked List

B. Priority Queue

C. Queue

D. Stack

A. It finds the shortest path from a single source.

B. It works efficiently with a priority queue.

C. It requires a graph to be connected.

D. It can handle negative weight edges.

A. Recursive

B. Iterative

C. Level-by-level

D. Random

A. When all edge weights are positive.

B. When the graph is a complete graph.

C. When the graph is dense.

D. When there are negative weight edges in the graph.

A. O(V²)

B. O(V log E)

C. O((V + E) log V)

D. O(E log V)