McqMate

Q. |
## What is the running time of the Floyd Warshall Algorithm? |

A. | big-oh(v) |

B. | theta(v2) |

C. | big-oh(ve) |

D. | theta(v3) |

Answer» D. theta(v3) | |

Explanation: the running time of the floyd warshall algorithm is determined by the triply nested for loops. since each execution of the for loop takes o(1) time, the algorithm runs in time theta(v3). |

625

0

Do you find this helpful?

3

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Floyd Warshall’s Algorithm is used for solving
- Floyd Warshall’s Algorithm can be applied on
- What approach is being followed in Floyd Warshall Algorithm?
- Floyd Warshall Algorithm can be used for finding
- What procedure is being followed in Floyd Warshall Algorithm?
- Floyd- Warshall algorithm was proposed by
- What happens when the value of k is 0 in the Floyd Warshall Algorithm?
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- What is the average running time of a quick sort algorithm?
- What is the running time of Chan’s algorithm?