- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the running time of Bellmann For...

Q. |
## What is the running time of Bellmann Ford Algorithm? |

A. | o(v) |

B. | o(v2) |

C. | o(elogv) |

D. | o(ve) |

Answer» D. o(ve) | |

Explanation: bellmann ford algorithm runs in time o(ve), since the initialization takes o(v) for each of v-1 passes and the for loop in the algorithm takes o(e) time. hence the total time taken by the algorithm is o(ve). |

View all MCQs in:
Design and Analysis of Algorithms

- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.
- Bellmann ford algorithm provides solution for problems.
- Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.
- How many times the for loop in the Bellmann Ford Algorithm gets executed?
- What is the basic principle behind Bellmann Ford Algorithm?
- Bellmann Ford Algorithm can be applied for
- Bellmann Ford algorithm was first proposed by
- Bellmann Ford Algorithm is an example for
- Dinic’s algorithm runs faster than the Ford-Fulkerson algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ