Step 1: Expected marks if QuesA is attempted first.
- Probability QuesA correct = \(0.8\). If wrong, marks \(=0\).
- If QuesA is correct: marks \(=10\), and then attempt QuesB.
- Expected additional marks from QuesB \(= 0.5 \times 20 = 10\).
So, expected marks:
\[
0.8 \times (10 + 10) = 0.8 \times 20 = 16
\]
Step 2: Expected marks if QuesB is attempted first.
- Probability QuesB correct = \(0.5\). If wrong, marks \(=0\).
- If QuesB is correct: marks \(=20\), then attempt QuesA.
- Expected additional marks from QuesA \(= 0.8 \times 10 = 8\).
So, expected marks:
\[
0.5 \times (20 + 8) = 0.5 \times 28 = 14
\]
Step 3: Comparison.
\[
\text{Expected marks (A first)} = 16 > \text{Expected marks (B first)} = 14
\]
Step 4: Conclusion.
To maximize expected marks, the student should attempt QuesA first and then QuesB.
Final Answer: (D)
Let the mean and variance of 7 observations 2, 4, 10, x, 12, 14, y, where x>y, be 8 and 16 respectively. Two numbers are chosen from \(\{1, 2, 3, x-4, y, 5\}\) one after another without replacement, then the probability, that the smaller number among the two chosen numbers is less than 4, is:
If the mean and the variance of the data 
are $\mu$ and 19 respectively, then the value of $\lambda + \mu$ is
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).