Home » MCQs » Algorithms MCQs

In Prim's algorithm, what data structure is commonly used to efficiently select the minimum weight edge?

43. In Prim's algorithm, what data structure is commonly used to efficiently select the minimum weight edge?

1. Stack
2. Queue
3. Priority Queue
4. Linked List

Answer

The correct answer is: C) Priority Queue

Explanation

A priority queue helps in efficiently selecting the edge with the minimum weight at each step.