Gate CS-2007 Question Paper With Solutions

Q. 62 Solve the problems and choose the correct answers.

Suppose that a robot is placed on the Cartesian plane. At each step it is allowed

to move either one unit up or one unit right, i.e., if it is at (i, j) then it an move

to either (i + 1), j) or (i, j + 1).

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)?

Gate CS-2007 Question Paper With Solutions

Answer: (D)

Explanation:

Gate CS-2007 Question Paper With Solutions

Learn More:   Gate CS-2019 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here