CSCI 3110

Dynamic Programming Algorithms Exercises

< Previous  Next >

1. Discuss with your neighbor(s) the main technique employed by dynamic programming algorithms.
2. Name some problems where a dynamic programming algorithm is appropriate.
3. Write a dynamic programming implementation for calculating a Fibonacci number: F_n = F_{n - 1} + F_{n - 2} and F₁ = 1 and F₂ = 1.

Last Modified: