Question 31 : Floyd Warshall Algorithm can be used for finding _____________
1. Single source shortest path
2. Topological sort
3. Minimum spanning tree
4. Transitive closure
View Answer   Discuss with Members

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

Question 33 : What is the running time of Bellmann Ford Algorithm?
1. O(V)
2. O(V²)
3. O(ElogV)
4. O(VE)
View Answer   Discuss with Members

Question 34 : The running time of Bellmann Ford algorithm is lower than that of Dijkstra's Algorithm.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 35 : Floyd Warshall's Algorithm can be applied on __________
1. Undirected and unweighted graphs
2. Undirected graphs
3. Directed graphs
4. Acyclic graphs
View Answer   Discuss with Members

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

Question 37 : Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 38 : What happens when the value of k is 0 in the Floyd Warshall Algorithm?
1. 1 intermediate vertex
2. 0 intermediate vertex
3. N intermediate vertices
4. N-1 intermediate vertices
View Answer   Discuss with Members

Question 39 : The maximum number of times the decrease key operation performed in Dijkstra's algorithm will be equal to ___________
1. Total number of vertices
2. Total number of edges
3. Number of vertices - 1
4. Number of edges - 1
View Answer   Discuss with Members

Question 40 : Floyd- Warshall algorithm was proposed by ____________
1. Robert Floyd and Stephen Warshall
2. Stephen Floyd and Robert Warshall
3. Bernad Floyd and Robert Warshall
4. Robert Floyd and Bernad Warshall
View Answer   Discuss with Members