Question
Which algorithm returns a minimum spanning tree (MST)
and uses a priority queue to select the next edge connected to the growing tree?Solution
Prim grows an MST from a start vertex, repeatedly adding the minimum-weight edge connecting tree to outside vertices (priority queue used for efficiency).
306, 272, 240, ?, 182, 156
What should come in place of (?) question mark in the following number series.
256, 128, 64, 32, 16, ?
37, 49, 63, ?, 97, 117
What will come in place of the question mark (?) in the following series?
4, 2605, 5309, 8118, ?
98, 134, 198, ?, 442, 638
16, 16, 32, 96, ?, 1920
What will come in place of the question mark (?) in the following series?
22, 25, 30, 37, 48, ?
What will come in place of the question mark (?) in the following series?
225, 227, 233, 245, 265, ?
What will come in place of the question mark (?) in the following series?
16, 16, ?, 96, 384, 1920
4, 4, 8, 32, 256, ?
