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

A. True

B. False

A. O(|E||V|)

B. O(|E|)

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

D. O(|E|²|V|)

A. O(log V)

B. O(V²)

C. O(E²)

D. O(V log E)

A. A*

B. C*

C. D*

D. E*

A. Pre-order Traversal

B. Post-order Traversal

C. Level-order Traversal

D. In-order Traversal

A. Can be anything

B. 0

C. At most 1

D. Insufficient Information

A. Robert Floyd and Stephen Warshall

B. Stephen Floyd and Robert Warshall

C. Bernad Floyd and Robert Warshall

D. Robert Floyd and Bernad Warshall

A. Linked List

B. Tree

C. Graph with back edges

D. Array

A. O(log V)

B. O(E log V)

C. O(E²)

D. O(V log E)

A. It is tree that spans G

B. It is a subgraph of the G

C. It includes every vertex of the G

D. It can be either cyclic or acyclic