M

Mr. Dubey • 52.33K Points
Coach 

Q. Kruskal’s algorithm is used to

(A) find minimum spanning tree
(B) find single source shortest path
(C) find all pair shortest path algorithm
(D) traverse the graph

Explanation: 
 the kruskal’s algorithm is used to find the minimum spanning tree of the connected graph. it construct the mst by finding the edge having the least possible weight that connects two trees in the forest.

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. C is a ____________________ language

Q. PLA refers to

Q. When compiling an OpenMP program with gcc, what flag must be included?

Q. Algorithmic cost modeling is

Q. Objects of the string class

Q. The simplification of the Boolean expression (A'BC')'+ (AB'C)' is

Q. Which of the items below are considered removable storage media?

Q. EPROM can be used for

Q. To increase the speed of memory access in pipelining, we make use of _______

Q. Which of the following to keep track of the individual units of data (called packets) that a message is divided into for efficient routing through the

Question analytics