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

A.

for i=1 to V[g]-1
	do for each edge (u,v) in E[g]
		do Relax(u,v,w)
   for each edge (u,v) in E[g]
	do if d[v]>d[u]+w(u,v)
		then return False
   return True

B.

for i=1 to V[g]-1
       for each edge (u,v) in E[g]
	do if d[v]>d[u]+w(u,v)
		then return False
    return True

C.

for i=1 to V[g]-1
	do for each edge (u,v) in E[g]
		do Relax(u,v,w)
   for each edge (u,v) in E[g]
	do if d[v]<d[u]+w(u,v)
		then return true
   return True

D.

for i=1 to V[g]-1
	do for each edge (u,v) in E[g]
		do Relax(u,v,w)
   return True

A. A*

B. B*

C. C*

D. Both A* and B*

A. Dijkstra-Scholten algorithm

B. Boruvka's algorithm

C. Floyd-Warshall algorithm

D. DJP Algorithm

A. (4-3)(5-3)(2-3)(1-2)

B. (4-3)(3-5)(5-1)(1-2)

C. (4-3)(3-5)(5-2)(1-5)

D. (4-3)(3-2)(2-1)(1-5)

A. S1 is true but S2 is false

B. Both S1 and S2 are false

C. Both S1 and S2 are true

D. S2 is true but S1 is false

A. Dynamic Programming

B. Greedy Algorithms

C. Linear Programming

D. Branch and Bound

A. Heuristic Search

B. Pure Heuristic Search

C. Combinatorial Search

D. Divide and Conquer Search

A. O(V + E)

B. O(V)

C. O(E)

D. O(V*E)

A. level order

B. post order

C. pre order

D. in order

A. divide and conquer algorithm

B. dynamic programming algorithm

C. greedy algorithm

D. approximation algorithm