Practice Paths With A Blocked Intersection (1.3) - Grid Paths - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
3 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
How many total paths exist in a 3 by 2 grid?
Show hintHide hint
Use the combination formula for paths.
Question 2.
What does $C(n,k)$ represent?
Show hintHide hint
Think about how you choose items.
3Question 3.
How many paths exist from (0,0) to (5,10)?
- 100
- 1500
- 3003
Show hintHide hint
Think of the total steps needed.
4Question 4.
Is it possible to move from (0,0) to (5,10) without encountering a blocked intersection?
- True
- False
Show hintHide hint
Consider valid pathways.
Question 5.
You have a 6 by 6 grid and a blocked intersection at (3,3). Calculate the valid paths from (0,0) to (6,6).
Show hintHide hint
Use the combination formula to solve.
Question 6.
In a 7 by 7 grid with blockages at (4,5) and (5,4), find how many valid paths still exist.
Show hintHide hint
Count paths through each block then adjust for overlaps.

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