Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

a) Dynamic programming
b) Backtracking
c) Greedy
d) Divide and Conquer

From the BB Assistant Programmer February 2023 – Written (BIBM) exam, question 22 of 37.

More from this paper

Previous: Access time of the symbol table will be logarithmic if it is implemented by-
Next: Assume that the size of an integer is 4 bytes, predict the output of the following program. #include <stdio.h> int main() { int i = 12…
All questions in BB Assistant Programmer February 2023 – Written (BIBM)