edited by
12,426 views
48 votes
48 votes

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

  1. $^{20}\mathrm{C}_{10}$
  2. $2^{20}$
  3. $2^{10}$
  4. None of the above
edited by

8 Answers

4 votes
4 votes

problems like these should be solved using movements ( UP , RIGHT )

see this 

3 votes
3 votes
The answer for 84 is A. It is same as selecting 10 out of 20 elements.
1 votes
1 votes
To reach from $(0,0)$ to $(10,10)$ we have to take 20 steps.

Lets assume these 20 steps to be 20 places.

( _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ )

Out of these 20 places to have to choose 10 places for upper steps, the rest of the 10 places have to be for right steps.)

like one example is  ( _ u u _ _ u _ _ u _ _uuu_ _u_u_ _ _ _ u), the $‘– ‘$ places should be for right steps.

so, Option $A$  $2nCn$​ is the answer.
0 votes
0 votes
In order to move from (0,0) to (10,10)there will be total 20 movement out of which there will be 10 right,10 upward movement combination

so 20!/10!.10!= c(20,10)
Answer:

Related questions

34 votes
34 votes
4 answers
2
Kathleen asked Sep 21, 2014
10,004 views
What is the maximum number of different Boolean functions involving $n$ Boolean variables?$n^2$$2^n$$2^{2^n}$$2^{n^2}$
64 votes
64 votes
15 answers
3
Arjun asked Jul 6, 2016
36,697 views
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...
30 votes
30 votes
2 answers
4
go_editor asked Apr 23, 2016
9,840 views
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ are the general purpose registers.$$\begin{array}{|l|l|l|c|} \hline & \text {Instruction} & \...