Which of the following standard algorithms is not a greedy algorithm?
The Bellman-Ford shortest path algorithm is not a greedy algorithm. Unlike greedy algorithms, it uses iterative relaxation and can handle graphs with negative weights. \[\] \[\] Correct Option: (d)
Reinforce your conceptual grasp with related questions from CUET-MCA 2021:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →