## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Bellman-Ford Algorithm Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

Question 1 |

The Bellmann Ford algorithm returns ..... value.

Boolean | |

Integer | |

String | |

Double |

**Data interpretation (DI) Questions answers**

Question 1 Explanation:

The Bellmann Ford algorithm returns Boolean value whether there is a negative weight cycle that is reachable from the source.

Question 2 |

Bellmann ford algorithm provides solution for ..... problems.

All pair shortest path | |

Sorting | |

Network flow | |

Single source shortest path |

**NTA NET Questions answers**

Question 2 Explanation:

Bellmann ford algorithm is used for finding solutions for single source shortest path problems. If the graph has no negative cycles that are reachable from the source then the algorithm produces the shortest paths and their weights.

Question 3 |

Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.

True | |

False |

**Aptitude test Questions answers**

Question 3 Explanation:

Bellmann Ford algorithm returns true if the graph does not have any negative weight cycles and returns false when the graph has negative weight cycles.

Question 4 |

How many solution/solutions are available for a graph having negative weight cycle?

One solution | |

Two solutions | |

No solution | |

Infinite solutions |

**Arab culture Questions answers**

Question 4 Explanation:

If the graph has any negative weight cycle then the algorithm indicates that no solution exists for that graph.

Question 5 |

What is the running time of Bellmann Ford Algorithm?

O(V) | |

O(V ^{2}) | |

O(ElogV) | |

O(VE) |

**Current affairs Questions answers**

Question 5 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).

There are 5 questions to complete.