M

Mr. Dubey • 100.69K Points
Coach

Q. Kruskal’s algorithm is a

  • (A) divide and conquer algorithm
  • (B) dynamic programming algorithm
  • (C) greedy algorithm
  • (D) approximation algorithm
Share
Explanation by: Mr. Dubey
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The instruction used in a program for executing them is stored in the

Q. A Pointer to a block of memory is considered same as an array.

Q. In which of the following gates the output is 1 if and only if at least one input is 1?

Q. What is true in context to extensions?

Q. systems used to track and identify the location of objects in real time

Q. The main difference between the VLIW and the other approaches to improve performance is

Q. Reducing the number of attributes to solve the high dimensionality problem is called as ________.

Q. Which organisation is responsible for issuing UID?

Q. Flying a bird is an example of

Q. The prefix on IC's indicates a broader operating temperature range, and the devices are generally used by the military.

Question analytics