The Floyd-Warshall algorithm for all-pair shortest paths computation i – McqOptions

MCQOPTIONS

1.	The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
A.	Greedy paradigm.
B.	Divide-and-Conquer paradigm.
C.	Dynamic Programming paradigm.
D.	neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
Answer» D. neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.

Discussion

No Comment Found

Related MCQs

Which one of the following became a part of China in 1997 following the principle of ‘one country, two systems’?
Which one of the following bearings are forgiving in that they can tolerate loads and movements exceeding the design values?
Which one of the following battle is called: 'The Marathon of the history of Mewar' by colonel James Tod?
Which one of the following automobile exhaust gas pollutants is a major cause of photochemical smog?
Which one of the following Authors / Thinkers of India has opposed the Idea of world government and proposed a system of twenty to twenty five regional federations on a global level?
Which one of the following authors does not belong to the Elizabethan Age?
Which one of the following aspects stand the test of time?
Which one of the following authorities makes a recommendation to the Governo of a State as to the principles for determining the taxes and duties which may be appropriated by the Panchayats in that particular state?
Which one of the following authorities has recently launched the mobile apps ‘MyFASTag’ and ‘FASTag Partner?
Which one of the following authorities CANNOT organize 'Lok Adalats'?