Question
Which algorithm uses a priority queue to repeatedly pick
the next closest vertex?Solution
Dijkstra’s algorithm uses a min-priority queue to efficiently select the next vertex with the smallest distance.
Find the wrong number in the given number series.
4, 7, 12, 19, 30, 43, 61
4Â Â Â Â Â 6Â Â Â Â Â Â 12Â Â Â Â Â 30 Â Â Â Â Â Â 90 Â Â Â Â Â Â Â 310
...Find the wrong number in the given series.
46, 104, 184, 404, 760, 1586
- Find the wrong number in the given number series.
118, 150, 178, 206, 238, 266 21, 44, 78, 121, 179, 246
Find the wrong number in the given number series.
30, 26, 24, 18, 14, 10
Find the odd one out in the following series:
159, 240, 256, 292, 373, 420
4, 8, 24, 96, 485, 2880, 20160
Find the wrong number in the given number series.
45,  54, 79, 128, 189,  330,  499
75, 450, 225, 1330, 675, 4050