M

Mr. Dubey • 52.26K Points
Coach 

Q. Kruskal’s algorithm is a

(A) divide and conquer algorithm
(B) dynamic programming algorithm
(C) greedy algorithm
(D) approximation algorithm
Correct : Option (C)

Explanation: 
 kruskal’s algorithm uses a greedy algorithm approach to find the mst of the connected weighted graph. in the greedy method, we attempt to find an optimal solution in stages.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs

Q. Each request requires that the system consider the to decide whether the current request can be satisfied or must wait to a

Q. Which of the following is a transport layer protocol?

Q. The best kind of models helps to choose ________

Q. If we want that a character be interpreted by the client instead of server _________

Q. How power supply is done to RPi?

Q. …….is the disconnection of an activity before the completion of activities in a project network diagram.

Q. G is strongly connected implies _________.

Q. Which of the following stores several gigabytes of data but usually lost when power failure?

Q. Which of the following is true about Manhattan distance?

Q. When a new testing tool is purchased, it should be used first by: