Which of the following is an example of dynamic programming approach?

Which of the following is an example of dynamic programming approach?

a) Fibonacci Series
b) Tower of Hanoi
c) Dijkstra Shortest Path
d) None of the above

From the NPCBL Executive Trainee (CSE) 2023 – Preliminary exam, question 24 of 39.

More from this paper

Previous: A B* tree can contain a maximum of 7 pointers in a node. What is the minimum number keys in leaves?
Next: Which of the following is true regarding a constructor in Object Oriented Programming?
All questions in NPCBL Executive Trainee (CSE) 2023 – Preliminary