GATE Computer Science (CS) 2016 Shift 2 Solved Paper

© examsiri.com

Question : 24 of 65

Marks: +1, -0

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

Greedy paradigm.
Divide-and-Conquer paradigm.
Dynamic Programming paradigm.
neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.

Go to Question:

Prev Question

Next Question