Question 11 : What approach is being followed in Floyd Warshall Algorithm?
1. Greedy technique
2. Dynamic Programming
3. Linear Programming
4. Backtracking
5.
View Answer   Discuss with Members

Question 12 : What is the running time of the Floyd Warshall Algorithm?
1. Big-oh(V)
2. Theta(V²)
3. Big-Oh(VE)
4. Theta(V³)
5.
View Answer   Discuss with Members

Question 13 : A graph is said to have a negative weight cycle when?
1. The graph has 1 negative weighted edge
2. The graph has a cycle
3. The total weight of the graph is negative
4. The graph has 1 or more negative weighted edges
5.
View Answer   Discuss with Members

Question 14 : Bellmann Ford Algorithm is an example for ____________
1. Dynamic Programming
2. Greedy Algorithms
3. Linear Programming
4. Branch and Bound
5.
View Answer   Discuss with Members

Question 15 : In the given graph: Identify the path that has minimum cost to travel from node a to node f
1. a-b-c-f
2. a-d-e-f
3. a-d-b-c-f
4. a-d-b-c-e-f
5.
View Answer   Discuss with Members

Question 16 : Consider the following graph: What is the minimum cost to travel from node A to node C
1. 5
2. 2
3. 1
4. 3
5.
View Answer   Discuss with Members

Question 17 : Bellmann Ford algorithm was first proposed by ________
1. Richard Bellmann
2. Alfonso Shimbe
3. Lester Ford Jr
4. Edward F. Moore
5.
View Answer   Discuss with Members

Question 18 : Bellmann Ford Algorithm can be applied for _____________
1. Undirected and weighted graphs
2. Undirected and unweighted graphs
3. Directed and weighted graphs
4. All directed graphs
5.
View Answer   Discuss with Members

Question 19 : What is the basic principle behind Bellmann Ford Algorithm?
1. Interpolation
2. Extrapolation
3. Regression
4. Relaxation
5.
View Answer   Discuss with Members

Question 20 : How many times the for loop in the Bellmann Ford Algorithm gets executed?
1. V times
2. V-1
3. E
4. E-1
5.
View Answer   Discuss with Members