ExamLookup
Menu mobile
Home
Current Affairs
General Knowledge
Computer
Python
HTML
GATE
: Computer Science and IT
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on , The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
A.
Greedy paradigm
Greedy paradigm
B.
Divide-and-Conquer paradigm.
Divide-and-Conquer paradigm.
C.
Dynamic Programming paradigm.
Dynamic Programming paradigm.
D.
Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm
Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm
Solution
C. Dynamic Programming paradigm.
Explanation
Floyd - warshall algorithm follows dynamic programming paradigm.
CCC Online Test 2021
CCC Practice Test Hindi
Python Programming Tutorials
Best Computer Training Institute in Prayagraj (Allahabad)
O Level NIELIT Study material and Quiz
Bank SSC Railway TET UPTET Question Bank
career counselling in allahabad
Sarkari Exam Quiz
Website development Company in Allahabad