Question

Advanced Programming Logic:
1. Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
Option 1 : Dynamic programming
Option 2 : Backtracking
Option 3 : Greedy
Option 4 : Divide & Conquer​

Answer 1

Answer:

The correct answer is option 1 Dynamic Programming

Explanation:

Dynamic programming algorithm design techniques is used in finding all pairs of shortest distances in a graph.

For example:  Floyd Warshall Algorithm is the All Pairs Shortest Path problem which uses Dynamic Programming method to find shortest distances in weighted directed Graph.

Answer 2

Answer:

The first option -  dynamic programming is used in finding all the pairs of shortest distances in a graph. The optimization over a plain script is called dynamic programming.

The result of subproblems of a specific topic is used for implementing dynamic programming. The repeated calls for a specific thing helps in finding the exact solution of dynamic programming. We should focus on learning dynamic programming and nor other concepts such as backtracking, divide & conquer.

Explanation: