Question
Which one of the following algorithm design techniques is
used in finding all pairs of shortest distances in a graph?Solution
Bellman-Ford algorithm is used to find all pairs shortest distances in a graph and it is dynamic programming technique.
Find the wrong number in the given number series.
41, 51, 63, 80, 101, 126
Find the Wrong number in the given number series.
137, 148, 190, 261, 361, 490- Find the wrong number in the given number series.
91, 103, 125, 163, 211, 271 Find the wrong number in the given number series.
15, 38, 67, 98, 135, 181
850, 849, 841, 814, 750, 688
Direction: Find the wrong number in given number series.
1977, 1945, 1837, 1575, 1081, 217.
- Find the wrong number in the given number series.
3, 6, 10, 15, 21, 29 Find the wrong term in the following series:
2, 4, 8, 14, 24, 32, 44
Find the wrong number in the given number series.
- 342, - 218, - 96, 27, 150, 273
Find the wrong number in the given number series.
26, 38, 60, 110, 206, 398