| 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. | |
Login to Continue
It will take less than 2 minutes