GATE CS 2016 Set 1 – Question 12

Multiple choice 1 mark Question 12 2016

Question 12

MCQ 1 marks · −0.33 Algorithms

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

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2016 Algorithms

Source: GATE 2016 Computer Science and Information Technology, Set 1, Q12 (question number approximate)

GATE CS 2021 Set 1 – Question 36
GATE CS 2019 – Question 37
GATE CS 2018 – Question 14
GATE CS 2017 Set 1 – Question 39
GATE CS 2016 Set 2 – Question 36
GATE CS 2015 Set 2 – Question 14
GATE CS 2015 Set 1 – Question 34
GATE CS 2014 Set 2 – Question 38

All Algorithms questions

The answer and the full explanation are one sign-in away

Where this question comes from

More questions from Algorithms