Lecture 1

Question 1

Memoization?

Answer 1

to find fib(n), as we compute fib(n-1 and fib(n-2) we store their value so we can avoid multiple calculation of fib(i) for some i

Question 2

Bottom Up DP algo, in general points:

Answer 2

• Exactly same computation of memoized version.
• Topological sort of subproblem dependency dag.
• storage space saved..

Question 3

making a graph acyclic:

Answer 3

make its V’s k copies.
time axis.
…