Practice Introduction To Grid Paths (1.1) - 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 are needed to reach (5, 10) from (0, 0)?
Show hintHide hint
Add the right and up moves together.
Question 2.
If you can only move right (R) and up (U), which sequences are valid?
Show hintHide hint
Think of different arrangements.
3Question 3.
How many steps are required to go from (0, 0) to (5, 10)?
- 10
- 15
- 20
Show hintHide hint
Add right and up moves.
4Question 4.
True or False: If an intersection is blocked, it can still be part of a valid path.
- True
- False
Show hintHide hint
Think about blocked paths.
Question 5.
Given a grid of size (n, m), derive the number of paths if points (i, j) and (k, l) are blocked.
Show hintHide hint
Break it down into sections and compute step by step.
Question 6.
Create a grid-based scenario illustrating how many paths are available if an entire column of intersections is blocked.
Show hintHide hint
Use combinatorial principles for disconnected components.

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