24.2.5. How Memoization Works

Try these first

1. 1.

   What is the purpose of memoization?

   Hint

   Think about reducing repeated work in calculations.

2. 2.

   Define the Fibonacci sequence.

   Hint

   Recall the initial terms of the sequence.

3. 3.

   What is the main benefit of using memoization?

   • A. To increase redundancy
   • B. To decrease computation time
   • C. To complicate the algorithm

   Hint

   Think about how it affects performance.

4. 4.

   True or False: Dynamic programming requires recursion.

   • True
   • False

   Hint

   Consider the nature of dynamic programming.

5. 5.

   Design an algorithm using memoization to compute the nth Fibonacci number. Explain the time and space complexity of your solution.

   Hint

   Focus on how you can minimize repeated work.

6. 6.

   Critically analyze a classic recursive problem, such as calculating combinations or permutations, and redesign it using memoization. What is the expected improvement in performance?

   Hint

   Think about the nature of the calculations involved and how storing results aids efficiency.