24.2.8. Comparison of Memoization and Dynamic Programming

Try these first

1. 1.

   What is memoization?

   Hint

   Think about how we save information for later use.

2. 2.

   Why is the Fibonacci sequence a good example for these techniques?

   Hint

   Recall how Fibonacci numbers are defined.

3. 3.

   What is memoization primarily used for?

   • Redundant calculations
   • Data storage
   • Resource allocation

   Hint

   Think about its purpose in optimizing algorithms.

4. 4.

   Dynamic programming iteratively fills a table, true or false?

   • True
   • False

   Hint

   Consider how this differs from recursion.

5. 5.

   Explain how dynamic programming could be adapted for solving the Traveling Salesman Problem.

   Hint

   Think about how you could record already computed paths to save time.

6. 6.

   Implement and explain a memoization strategy for calculating factorials, and compare its efficiency with iterative methods.

   Hint

   Consider the relationship of factorial numbers to their inputs.