M

Mr. Dubey • 100.69K Points
Coach

Q. Prim’s algorithm is a

  • (A) divide and conquer algorithm
  • (B) greedy algorithm
  • (C) dynamic programming
  • (D) approximation algorithm
Share
Explanation by: Mr. Dubey
prim’s algorithm uses a greedy algorithm approach to find the mst of the connected weighted graph. in 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. ______________requires Linear Space but uses backtracking

Q. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify

Q. The financial function of the temporal database includes

Q. Which one of the following is a transport layer protocol used in internet?

Q. When a function returns a value, the entire function call can appear on the right side of the equal sign and be assigned to another variable.

Q. Which of the following is not a multitasking operating system?

Q. It was found that in first year of computer science of 80 students 50 know Cobol, 55 know C, 46 know pascal. It was also known that 37 know C and cobo

Q. If the Computer is purchased on 11th May, 2018 then at what rate depreciation will be provided on it?

Q. The ____ language allows more than one method in a single class.

Q. Which command is used to remove the read permission of the file 'note' from both the group and others?

Question analytics