Practice Counting Paths Without Blocks (1.2) - Grid Paths - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
How many total moves do you need to reach (3,4)?
Show hintHide hint
Add up the right and up moves.
Question 2.
What is the binomial coefficient for (5,3)?
Show hintHide hint
Count total moves needed.
3Question 3.
How many distinct paths from (0,0) to (5,10)?
- 100
- 3003
- 5000
Show hintHide hint
Think about how many total moves you need.
4Question 4.
True or False: A blocked intersection increases the number of valid paths.
- True
- False
Show hintHide hint
Consider how blocked paths affect counts.
Question 5.
How many paths are there from (0,0) to (6,4) with blocked points at (2,2) and (4,3)?
Show hintHide hint
Break this down into segments, computing each segment's paths separately.
Question 6.
Describe a complex grid scenario involving three blocked points and outline the process to compute valid paths.
Show hintHide hint
Use clear steps for each block, ensuring you count each way to navigate between them.

5 more questions in this section. Enroll free to practise them all.