Prim’s algorithm is a

Mr. Dubey

🎓 Coach ⭐ 103.71K Points

📊 Design and Analysis of Algorithms

Q. Prim’s algorithm is a

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

💬 Discuss

✅ Correct Answer: (B) greedy algorithm

Explanation: 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.

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.

💬 Discussion

📊 Question Analytics

👁️

429

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

89%

Success Rate

Mr. Dubey

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics