24.2.1. Inductive Definitions

Try these first

1. 1.

   What are the first two numbers in the Fibonacci sequence?

   Hint

   Think of the starting point of the sequence.

2. 2.

   Define memoization in your own words.

   Hint

   Consider what happens when you call a function multiple times.

3. 3.

   What is the first number in the Fibonacci sequence?

   Hint

   Remember the sequence of Fibonacci numbers.

4. 4.

   True or False: Memoization eliminates the need for recursion.

   • True
   • False

   Hint

   Consider what memoization does.

5. 5.

   Develop a hybrid solution using both memoization and dynamic programming for computing a non-Fibonacci inductive sequence.

   Hint

   Think of how you can create a structured table based on stored values.

6. 6.

   Create a real-life example that highlights the use of memoization and construct the recursive function that would apply to it.

   Hint

   What are some tasks that can often repeat, and how can storing responses speed them up?