24.1. Module – 02

Try these first

1. 1.

   What is memoization?

   Hint

   Think about storing results to reuse later.

2. 2.

   Why is it beneficial to use memoization for recursive functions?

   Hint

   Consider how recursive functions might repeat calculations.

3. 3.

   What does memoization help to improve?

   • Speed of computation
   • Quality of code
   • Simplicity of recursion

   Hint

   Think about redundant calculations and how they affect speed.

4. 4.

   True or False: Dynamic programming eliminates all recursive calls.

   • True
   • False

   Hint

   Consider the approach used in dynamic programming compared to memoization.

5. 5.

   Implement a function to compute Fibonacci numbers using memoization. Explain how the operation time improves from naive recursive implementation to the memoized version.

   Hint

   Think about the number of function calls saved in your memoized version.

6. 6.

   Develop a dynamic programming approach to calculate Fibonacci numbers. Compare its time complexity with that of the memoization approach.

   Hint

   Use loops instead of recursion and track the state of computed values.