Question

From the following algorithm design techniques which one is used to find all the pairs of shortest distances in a graph?

A Backtracking Correct Answer Incorrect Answer
B Greedy Correct Answer Incorrect Answer
C Dynamic programming Correct Answer Incorrect Answer
D Divide Correct Answer Incorrect Answer
E Any of the above Correct Answer Incorrect Answer

Solution

The correct answer is C

Practice Next
×
×