1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The minimum number of colors required to color the vertices of a cycle with $$n$$ nodes in such a way that no two adjacent nodes have the same colour is:
A
$$2$$
B
$$3$$
C
$$4$$
D
$$n - 2\left[ {n/2} \right] + 2$$
2
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from same suit is
A
3
B
8
C
9
D
12
3
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}}}$$
4
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
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12