1
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
The solution to the recurrence equation
$$T\left( {{2^k}} \right)$$ $$ = 3T\left( {{2^{k - 1}}} \right) + 1$$,
$$T\left( 1 \right) = 1$$ is:
A
$${{2^k}}$$
B
$$\left( {{3^{k + 1}} - 1} \right)/2$$
C
$${3^{\log {K \over 2}}}$$
D
$${2^{\log {K \over 3}}}$$
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of binary strings of $$n$$ zeros and $$k$$ ones such that no two ones are adjacent is:
A
$${}^{n + 1}{C_k}$$
B
$${}^n{C_k}$$
C
$${}^n{C_{k + 1}}$$
D
None of the above
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP