GATE | CS | 2007 | Discrete maths | Combinatorics | Question 84 (original) (raw)

• Courses

• Tutorials

• Interview Prep

• DSA

• Practice Problems

• C

• C++

• Java

• Python

• JavaScript

• Data Science

• Machine Learning

• Courses

• Linux

• DevOps

Last Updated :

Discuss

Comments

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 can move to either (i+1,j) or (i,j+1).
How many distinct paths are there for the robot to reach the point (10,10) starting from the initial position (0, 0)

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

GeeksforGeeks