Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is $d_8 d_7 d_6 d_5 c_8 d_4 d_3 d_2 c_4 d_1 c_2 c_1$, where the data bits and the check bits are given in the following tables. Which one of the following choices gives the correct values of $x$ and $y$? 
Step 1: Understand the Hamming code structure.
In a $(12,8)$ Hamming code, parity (check) bits are placed at positions that are powers of two: $1$, $2$, $4$, and $8$. Each check bit ensures even parity over a specific set of bit positions.
Step 2: Determine the value of $x$.
Using the parity equations for the relevant check bits that include $d_5$, and enforcing even parity, the value of $x$ is obtained as $0$.
Step 3: Determine the value of $y$.
Similarly, applying the parity condition for check bit $c_8$, which covers positions including $d_8$, $d_7$, $d_6$, and $d_5$, and substituting known values, the parity requirement gives $y = 0$.
Step 4: Conclusion.
Both unknowns satisfy the parity conditions when $x = 0$ and $y = 0$.
The format of the single-precision floating-point representation of a real number as per the IEEE 754 standard is as follows:
\[ \begin{array}{|c|c|c|} \hline \text{sign} & \text{exponent} & \text{mantissa} \\ \hline \end{array}\] Which one of the following choices is correct with respect to the smallest normalized positive number represented using the standard?
If \( x \) and \( y \) are two decimal digits and \( (0.1101)_2 = (0.8xy5)_{10} \), the decimal value of \( x + y \) is \(\underline{\hspace{2cm}}\).
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).