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

Question 22 : How many solution/solutions are available for a graph having negative weight cycle?
1. One solution
2. Two solutions
3. No solution
4. Infinite solutions
5.
View Answer   Discuss with Members

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

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

Question 25 : The Bellmann Ford algorithm returns _______ value.
1. Boolean
2. Integer
3. String
4. Double
5.
View Answer   Discuss with Members

Question 26 : In the given graph:Identify the shortest path having minimum cost to reach vertex E if A is the source vertex
1. a-b-e
2. a-c-e
3. a-c-d-e
4. a-c-d-b-e
5.
View Answer   Discuss with Members

Question 27 : Consider the following graph. If b is the source vertex, what is the minimum cost to reach f vertex?
1. 8
2. 9
3. 4
4. 6
View Answer   Discuss with Members

Question 28 : How many times the insert and extract min operations are invoked per vertex?
1. 1
2. 2
3. 3
4. 0
5.
View Answer   Discuss with Members

Question 29 : How many priority queue operations are involved in Dijkstra's Algorithm?
1. 1
2. 3
3. 2
4. 4
View Answer   Discuss with Members

Question 30 : What is the time complexity of Dijikstra's algorithm?
1. O(N)
2. O(N³)
3. O(N²)
4. O(logN)
View Answer   Discuss with Members