1
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
The number $$43$$ in $$2's$$ complement representation is
A
$$01010101$$
B
$$11010101$$
C
$$00101011$$
D
$$10101011$$
2
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
An $$n\,\, \times \,\,n$$ array v is defined as follows v[i, j] = i - j for all i, j, $$1\,\, \le \,\,i\,\, \le \,\,n,\,1\,\, \le \,\,j\,\, \le \,\,n$$ The sum of elements of the array v is
A
0
B
n - 1
C
$${n^2}\, - \,3n\, + \,2$$
D
$${n^2}\,(n\, + \,1)/2$$
3
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
4
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}}}$$