Q.

Bellmann Ford Algorithm is an example for                          

A. dynamic programming
B. greedy algorithms
C. linear programming
D. branch and bound
Answer» A. dynamic programming
Explanation: in bellmann ford algorithm the shortest paths are calculated in bottom up manner which is similar to other dynamic programming problems.
1.9k
0
Do you find this helpful?
1

View all MCQs in

Design and Analysis of Algorithms

Discussion

No comments yet

Related MCQs