Question 51 : Bellmann ford algorithm provides solution for ____________ problems.
1. All pair shortest path
2. Sorting
3. Network flow
4. Single source shortest path
View Answer   Discuss with Members

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

Question 53 : Dijkstra's Algorithm is the prime example for ___________
1. Greedy algorithm
2. Branch and bound
3. Back tracking
4. Dynamic programming
View Answer   Discuss with Members

Question 54 : 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
View Answer   Discuss with Members

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

Question 56 : Dijkstra's Algorithm cannot be applied on ______________
1. Directed and weighted graphs
2. Graphs having negative weight function
3. Unweighted graphs
4. Undirected and unweighted graphs
View Answer   Discuss with Members

Question 57 : Who proposed the modern formulation of Floyd-Warshall Algorithm as three nested loops?
1. Robert Floyd
2. Stephen Warshall
3. Bernard Roy
4. Peter Ingerman
View Answer   Discuss with Members

Question 58 : Dijkstra's Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
1. True
2. False
3.
4.
View Answer   Discuss with Members

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

Question 60 : Which of the following is the most commonly used data structure for implementing Dijkstra's Algorithm?
1. Max priority queue
2. Stack
3. Circular queue
4. Min priority queue
View Answer   Discuss with Members