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 2000
MCQ (Single Correct Answer)
+2
-0.6
A relation R is defined on the set of integers as zRy if f (x + y) is even. Which of the following statements is true?
A
R is not an equivalence relation
B
R is an equivalence relation having 1 equivalence class
C
R is an equivalence relation having 2 equivalence classes
D
R is an equivalence relation having 3 equivalence classes
3
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Let $$a, b, c, d$$ be propositions. Assume that the equivalences $$a \leftrightarrow \left( {b \vee \neg b} \right)$$ and $$b \leftrightarrow c$$ hold. Then the truth value of the formulae $$\left( {a\, \wedge \,b} \right) \to \left( {\left( {a \wedge c} \right) \vee d} \right)$$ is always
A
True
B
False
C
Same as truth value of $$b$$
D
Same as truth value of $$d$$
4
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Let P(S) denote the power set of a set S. Which of the following is always true?
A
$$P\,(P(S))\, = P\,(S)$$
B
$$P\,(S)\, \cap \,P\,(P\,(S)) = \{ \emptyset \} $$
C
$$P\,(S)\,\, \cap \,\,S = P\,(S)$$
D
$$S\,\, \notin \,P(S)$$