The total number of possible ways in which a person can go from $A(0,0)$ to $B(3,3)$ if he can travel only to the right or upward along the grid lines is:

  • A
    $10$
  • B
    $20$
  • C
    $18$
  • D
    $16$

Explore More

Similar Questions

Three parallel straight lines $L_1, L_2$ and $L_3$ lie on the same plane. Consider $5$ points on $L_1, 7$ points on $L_2$ and $9$ points on $L_3$. Then the maximum possible number of triangles formed with vertices at these points is:

Let $S = \{(a, b) : a, b \in \mathbb{Z}, 0 \leq a, b \leq 18\}$. The number of lines in $\mathbb{R}^2$ passing through $(0,0)$ and exactly one other point in $S$ is:

Six boys and six girls sit in a row randomly. What is the probability that the six girls sit together?

There are $n$ distinct points on a circle. If the number of pentagons that can be formed using these points as vertices is equal to the number of triangles that can be formed,then the value of $n$ is:

There are $10$ points in a plane,out of which $6$ are collinear. If $N$ is the number of triangles formed by joining these points,then . . . .

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo