The GATE Grind

GATE 2007 CS – Question 85

Engineering Mathematics · Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) · 2 marks · Multiple choice

A robot starts on the Cartesian plane. At each step (i, j) it moves either to(i+1, j) or(i, j+1). It may not traverse the segment(4, 4)→(5, 4). How many paths reach(10, 10) from(0, 0) now?

  1. $2^9$
  2. $2^{19}$
  3. $\binom84\binom{11}5$
  4. $\binom{20}{10}-\binom84\binom{11}5$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) $\binom{20}{10}-\binom84\binom{11}5$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions

All Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions →