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.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

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

👁️

462

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate

Q. Prim’s algorithm is a

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics