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

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

Question 43 : Dijkstra's Algorithm is used to solve _____________ problems.
1. All pair shortest path
2. Single source shortest path
3. Network flow
4. Sorting
View Answer   Discuss with Members

Question 44 : What procedure is being followed in Floyd Warshall Algorithm?
1. Top down
2. Bottom up
3. Big bang
4. Sandwich
View Answer   Discuss with Members

Question 45 : Using logical operator's instead arithmetic operators saves time and space.
1. True
2. False
3.
4.
View Answer   Discuss with Members

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

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

Question 48 : What is the formula to compute the transitive closure of a graph?
1. tij(k) = tij(k-1) AND (tik(k-1) OR tkj(k-1))
2. tij(k) = tij(k-1) OR (tik(k-1) AND tkj(k-1))
3. tij(k) = tij(k-1) AND (tik(k-1) AND tkj(k-1))
4. tij(k) = tij(k-1) OR (tik(k-1) OR tkj(k-1))
View Answer   Discuss with Members

Question 49 : Floyd Warshall's Algorithm is used for solving ____________
1. All pair shortest path problems
2. Single Source shortest path problems
3. Network flow problems
4. Sorting problems
View Answer   Discuss with Members

Question 50 : Dijikstra's Algorithm is more efficient than Bellmann Ford Algorithm.
1. True
2. False
3.
4.
View Answer   Discuss with Members