Bellman-Ford Algorithm Multiple choice Questions and Answers (MCQs)

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Bellman-Ford Algorithm Multiple choice Questions and Answers (MCQs)

Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Bellmann Ford algorithm was first proposed by .....
A
Richard Bellmann
B
Alfonso Shimbe
C
Lester Ford Jr
D
Edward F. Moore
Question 11 Explanation: 
Alfonso Shimbe proposed Bellmann Ford algorithm in the year 1955. Later it was published by Richard Bellmann in 1957 and Lester Ford Jr in the year 1956. Hence it is called Bellmann Ford Algorithm.

Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Consider the following graph:

What is the minimum cost to travel from node A to node C

A
5
B
2
C
1
D
3
Question 12 Explanation: 
The minimum cost to travel from node A to node C is 2.

A-D, cost=1

D-B, cost=-2

B-C, cost=3

Hence the total cost is 2.

Question 13 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
In the given graph:

Identify the path that has minimum cost to travel from node a to node f

A
a-b-c-f
B
a-d-e-f
C
a-d-b-c-f
D
a-d-b-c-e-f
Question 13 Explanation: 
The minimum cost taken by the path a-d-b-c-e-f is 4.

a-d, cost=2

d-b, cost=-2

b-c, cost=1

c-e, cost= 2

e-f, cost=1

Hence the total cost is 4.

Question 14 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Bellmann Ford Algorithm is an example for .....
A
Dynamic Programming
B
Greedy Algorithms
C
Linear Programming
D
Branch and Bound
Question 14 Explanation: 
In Bellmann Ford Algorithm the shortest paths are calculated in bottom up manner which is similar to other dynamic programming problems.

Question 15 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A graph is said to have a negative weight cycle when?
A
The graph has 1 negative weighted edge
B
The graph has a cycle
C
The total weight of the graph is negative
D
The graph has 1 or more negative weighted edges
Question 15 Explanation: 
When the total weight of the graph sums up to a negative number then the graph is said to have a negative weight cycle. Bellmann Ford Algorithm provides no solution for such graphs.

There are 15 questions to complete.