GATE CS 2016 Set 2 — Question 24
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyFloyd-WarshallDynamic ProgrammingAlgorithms
Algorithms → Dynamic Programming → Floyd-Warshall
Last updated
Question
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
Correct answer
(C) Dynamic Programming paradigm.
Solution
The Floyd–Warshall algorithm computes all-pairs shortest paths by building solutions from overlapping subproblems.Let be the length of the shortest path from to that uses only vertices as intermediates. ThenEach table is computed from the stored table , so the same subproblems are reused many times — this is the defining feature of Dynamic Programming (optimal substructure + overlapping subproblems), giving time.
- (A) Greedy: wrong — it never commits to a locally best choice; every can be revised in later iterations.
- (B) Divide-and-Conquer: wrong — the subproblems are not independent halves; they overlap and are tabulated.
- (C) Dynamic Programming: correct, as shown by the recurrence above.
- (D): wrong, since (C) holds.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Dynamic Programming
2026 Set 1 Q17Consider the following recurrence relations: For all ,…2026 Set 2 Q24Consider the following functions, where is a positive integer.…2026 Set 2 Q25Which of the following can be recurrence relation(s) corresponding to an algorithm with time…2026 Set 2 Q32Consider an array . Suppose the merge sort algorithm is…2026 Set 2 Q37Let be a weighted directed acyclic graph with edges and vertices. Given and a…