1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
In how many ways can $$b$$ blue balls and $$r$$ red balls be distributed in $$n$$ distinct boxes?
A
$${{\left( {n + b - 1} \right)!\left( {n + r - 1} \right)!} \over {\left( {n - 1} \right)!b!\left( {n - 1} \right)!r!}}$$
B
$${{\left( {n + \left( {b + r} \right) - 1} \right)!} \over {\left( {n - 1} \right)!\left( {n - 1} \right)!\left( {b + r} \right)!}}$$
C
$${{n!} \over {b!r!}}$$
D
$${{\left( {n + \left( {b + r} \right) - 1} \right)!} \over {n!\left( {b + r - 1} \right)!}}$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
The exponent of $$11$$ in the prime factorization of $$300!$$ is
A
$$27$$
B
$$28$$
C
$$29$$
D
$$30$$
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Let $${x_n}$$ denote the number of binary strings of length $$n$$ that contain no consecutive $$0s$$.

The value of $${x_5}$$ is

A
$$5$$
B
$$7$$
C
$$8$$
D
$$13$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
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 path are there for the robot to reach the point $$(10, 10)$$ starting from the initial position $$(0, 0)$$?

A
$$\left( {\matrix{ {20} \cr {10} \cr } } \right)$$
B
$${2^{20}}$$
C
$${2^{10}}$$
D
None of the above
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12