2.3. Illustration of Memoization vs Dynamic Programming

Try these first

1. 1.

   What is memoization?

   Hint

   Think about functions that call themselves.

2. 2.

   How do you handle a hole in a grid path count?

   Hint

   Remember the path continuity.

3. 3.

   What is the primary advantage of using dynamic programming?

   • A. It computes only needed values
   • B. It systematically solves all subproblems
   • C. It runs slower than recursion

   Hint

   Think about the difference in approach between both methods.

4. 4.

   True or False: Memoization will calculate every possible value in advance.

   • True
   • False

   Hint

   Remember how memoization works.

5. 5.

   Given a 6x6 grid with holes at (2,1), (2,3), and (4,5), calculate the number of paths from (0,0) to (5,5).

   Hint

   Visualize the grid and observe how holes restrict movement.

6. 6.

   Design a function in pseudo-code to implement grid path counting using dynamic programming with hole handling. Explain its efficiency.

   Hint

   Focus on looping through each cell and applying path calculations iteratively.