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

A. All pair shortest path

B. Sorting

C. Network flow

D. Single source shortest path

A. All pair shortest path problems

B. Single Source shortest path problems

C. Network flow problems

D. Sorting problems

A. A* BFS

B. C* BFS

C. D* BFS

D. B* BFS

A. When the graph is a Binary Tree

B. When the graph is a Linked List

C. When the graph is a n-ary Tree

D. When the graph is a Ternary Tree

A. stack

B. queue

C. array

D. linked list

A. Richard Bellmann

B. Alfonso Shimbe

C. Lester Ford Jr

D. Edward F. Moore

A. Pre-order Traversal

B. Post-order Traversal

C. Level-order Traversal

D. In-order Traversal

A. Prim's algorithm initialises with a vertex

B. Prim's algorithm initialises with a edge

C. Prim's algorithm initialises with a vertex which has smallest edge

D. Prim's algorithm initialises with a forest

A. BFS is equivalent to level order traversal in trees

B. DFS is equivalent to post order traversal in trees

C. DFS and BFS code has the same time complexity

D. BFS is implemented using queue

A. branch and bound

B. dynamic programming

C. greedy algorithm

D. backtracking