1
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$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Let $${x_n}$$ denote the number of binary strings of length $$n$$ that contains no consecutive $$0s$$.

Which of the following recurrences does $${x_n}$$ satisfy?

A
$${x_n} = 2{x_{n - 1}}$$
B
$${x_n} = {x_{\left[ {n/2} \right]}} + 1$$
C
$${x_n} = {x_{\left[ {n/2} \right]}} + n$$
D
$${x_n} = {x_{n - 1}} + {x_{n - 2}}$$
3
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
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)$$

Suppose that the robot is not allowed to traverse the line segment from $$(4, 4)$$ to $$(5,4)$$. With this constraint, how many distinct path are there for the robot to reach $$(10, 10)$$ starting from $$(0,0)$$?

A
$${2^{9}}$$
B
$${2^{19}}$$
C
$$\left( {\matrix{ 8 \cr 4 \cr } } \right) \times \left( {\matrix{ {11} \cr 5 \cr } } \right)$$
D
$$\left( {\matrix{ {20} \cr {10} \cr } } \right) - \left( {\matrix{ 8 \cr 4 \cr } } \right) \times \left( {\matrix{ {11} \cr 5 \cr } } \right)$$

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies