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

A. O(V)

B. O(V²)

C. O(ElogV)

D. O(VE)

A. Directed and weighted graphs

B. Graphs having negative weight function

C. Unweighted graphs

D. Undirected and unweighted graphs

A. True

B. False

A. Total number of vertices

B. Total number of edges

C. Number of vertices - 1

D. Number of edges - 1

A. tij(k) = tij(k-1) AND (tik(k-1) OR tkj(k-1))

B. tij(k) = tij(k-1) OR (tik(k-1) AND tkj(k-1))

C. tij(k) = tij(k-1) AND (tik(k-1) AND tkj(k-1))

D. tij(k) = tij(k-1) OR (tik(k-1) OR tkj(k-1))

A. The graph has 1 negative weighted edge

B. The graph has a cycle

C. The total weight of the graph is negative

D. The graph has 1 or more negative weighted edges

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. V times

B. V-1

C. E

D. E-1

A. 1

B. 3

C. 2

D. 4

A. A spanning tree

B. A minimum spanning tree

C. Bellman - Ford algorithm

D. DFS traversal