1. Why computing Fibonacci number is a dynamic programming problem?

Its definition is:

Fn = Fn-1 + Fn-2,

F0 = F1 = 1

2. Please write a pseudo code for it using dynamic programming algorithm.

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

1.

Computing Fibonacci numbers belongs to DP class of problems because it exhibits the two characteristics of DP:

• Overlapping sub-problems – so the sub-problems are not independent, because, for instance Fib[5] depends on the results of previous sub-problems (Fib[3] and Fib[4]);...

This is only a preview of the solution. Please use the purchase button to see the entire solution