Virtual Labs

Q1. Bellman-Ford is better as compared to dijkstra's algorithm because:

a: It has a lower time complexity Explanation

Explanation

b: It can handle negative edges Explanation

Explanation

c: It can handle negative cycles Explanation

Explanation

d: It can handle negative edges and negative cycles Explanation

Explanation

Q2. The best and worst case time complexity of Bellman-Ford algorithm is: (n represents the number of vertices and E represents the number of edges)

a: O(n) and O(n^2) Explanation

Explanation

b: O(n^2) and O(n^3) Explanation

Explanation

c: O(n^3) and O(n^2) Explanation

Explanation

d: O(E) and O(n^3) Explanation

Explanation

Q3. Select the most appropriate statement about Bellman-Ford algorithm:

a: Bellman-Ford is a greedy algorithm Explanation

Explanation

b: Bellman-Ford is a dynamic programming-based algorithm Explanation

Explanation

c: Bellman-Ford is a backtracking algorithm Explanation

Explanation

d: Bellman-Ford is a divide and conquer algorithm Explanation

Explanation

Q4. In the given graph :

a: There is negative cycle 4->0->2->4 Explanation

Explanation

b: There is negative cycle 4->0->5->1->4 Explanation

Explanation

c: There is negative cycle 4->5->1->4 Explanation

Explanation

d: There are no negative cycles Explanation

Explanation

Q5. The space complexity of dijkstra's algorithm and Bellman-Ford algorithm is: (n represents the number of vertices and E represents the number of edges)

a: O(n) and O(E + n) Explanation

Explanation

b: O(n) and O((E+n)logn) Explanation

Explanation

c: O(E + n) and O(n) Explanation

Explanation

d: O((E+n)logn) and O(n) Explanation

Explanation

Q6. Bellman-Ford algorithm is used for determining

a: Shortest path from all vertices to all other vertices Explanation

Explanation

b: Shortest path from a single source to all other vertices Explanation

Explanation

c: Shortest path from a single source to a single destination Explanation

Explanation

d: Shortest path from all vertices to a single destination Explanation

Explanation

Bellman-Ford Algorithm