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

A. 8

B. 9

C. 4

D. 6

A. Peter Hart

B. Nils Nilsson

C. Bertram Raphael

D. Hans Berliner

A. Pure Heuristic Search

B. A*

C. B*

D. Both A* and B*

A. Boolean

B. Integer

C. String

D. Double

A. 1

B. 2

C. 3

D. 0

A. It is a greedy algorithm

B. It constructs MST by selecting edges in increasing order of their weights

C. It never accepts cycles in the MST

D. It can be implemented using the Fibonacci heap

A.

if(T[w].Known)
 	if(T[v].Dist + C(v,w) < T[w].Dist)  {
                 Increase (T[w].Dist to T[v].Dist +C(v,w));
                T[w].path=v; }

B.

if(!T[w].Known)
 	if(T[v].Dist + C(v,w) > T[w].Dist)  {
                 Decrease(T[w].Dist to T[v].Dist +C(v,w);
                  T[w].path=v; }

C.

if(!T[w].Known)
 	if(T[v].Dist + C(v,w) < T[w].Dist)  {
                 Decrease(T[w].Dist to T[v].Dist +C(v,w));
                T[w].path=v; }

D.

if(T[w].Known)
 	if(T[v].Dist + C(v,w) < T[w].Dist)  {
                 Increase(T[w].Dist to T[v].Dist);
                T[w].path=v; }

A. Top down

B. Bottom up

C. Big bang

D. Sandwich

A. Peter Hart

B. Nils Nilsson

C. Bertram Raphael

D. Hans Berliner

A. 5

B. 2

C. 1

D. 3