2.1.3 - Initial Conditions
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Practice Questions
Test your understanding with targeted questions
How many paths are there to the point (0,0)?
💡 Hint: Consider your starting point.
What happens to the path count if there’s a hole at (2,3)?
💡 Hint: Think about the implications of obstacles.
4 more questions available
Interactive Quizzes
Quick quizzes to reinforce your learning
What is the path count from (0,0) to (0,0)?
💡 Hint: Think about movement options.
Paths to a point with a hole are counted as?
💡 Hint: Remember the role of obstacles.
2 more questions available
Challenge Problems
Push your limits with advanced challenges
In a 6x6 grid with holes at (2,2) and (3,3), compute the number of paths to (5,5) through dynamic programming and illustrate your table.
💡 Hint: Start with your base cases and fill each cell considering blockage from holes.
Construct a comprehensive table showing both memoized and dynamically programmed solutions for a 5x5 grid with four holes randomly distributed.
💡 Hint: Use both methods to fill the same grid and compare the resulting path counts, especially noting differences in efficiency.
Get performance evaluation
Reference links
Supplementary resources to enhance your learning experience.