Consider the two statements:
\[ S_1:\ \exists \text{ random variables } X \text{ and } Y \text{ such that } \big( \mathbb{E}[(X-\mathbb{E}(X))(Y-\mathbb{E}(Y))] \big)^2 > \mathrm{Var}[X]\mathrm{Var}[Y] \] \[ S_2:\ \text{For all random variables } X \text{ and } Y,\ \mathrm{Cov}[X,Y] = \mathbb{E}\big[\,|X-\mathbb{E}[X]|\,|Y-\mathbb{E}[Y]|\,\big] \] Which one of the following choices is correct?
Step 1: Analysis of Statement \( S_1 \).
By the Cauchy–Schwarz inequality,
\[
\big( \mathbb{E}[(X-\mathbb{E}X)(Y-\mathbb{E}Y)] \big)^2
\le \mathrm{Var}[X]\mathrm{Var}[Y].
\]
Hence, the inequality in \( S_1 \) can never hold. Therefore, \( S_1 \) is false.
Step 2: Analysis of Statement \( S_2 \).
In general,
\[
\mathrm{Cov}[X,Y] = \mathbb{E}[(X-\mathbb{E}X)(Y-\mathbb{E}Y)],
\]
which is not equal to the expectation of the product of absolute deviations. Thus, \( S_2 \) is also false.
Step 3: Conclusion.
Since both statements are false, the correct option is (D).
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).