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

A. True

B. False

A. O(V+E)

B. O(V)

C. O(E)

D. O(V*E)

A. Prim's algorithm can also be used for disconnected graphs

B. Kruskal's algorithm can also run on the disconnected graphs

C. Prim's algorithm is simpler than Kruskal's algorithm

D. In Kruskal's sort edges are added to MST in decreasing order of their weights

A. Network flow

B. Single source shortest path

C. All pair shortest path

D. Sorting

A. O(N)

B. O(N³)

C. O(N²)

D. O(logN)

A. Divide and conquer algorithm

B. Greedy algorithm

C. Dynamic Programming

D. Approximation algorithm

A. True

B. False

A. Judea Pearl

B. Max Bezzel

C. Franz Nauck

D. Alan Turing

A. Greedy algorithm

B. Branch and bound

C. Back tracking

D. Dynamic programming

A. True

B. False