GATE | CS | 2007 | Discrete maths | Combinatorics |Question 85

Last Updated :
Discuss
Comments

Consider the data given in above question.
Suppose that the robot is not allowed to traverse the line segment from (4,4) to (5,4). With this constraint, how many distinct paths are there for the robot to reach (10,10) starting from (0,0)? 

 

GATECS200785


 

C
 

D
 

B
 

A
 

This question is part of this quiz :

Combinatorics,GATE-CS-2007,Discrete mathematics PYQ GATE QUIZ
Tags:
Engineering Mathematics Questions
GATE
GATE CS
Discrete Mathematics
Share your thoughts in the comments