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}}\).
Consider a Boolean function \( f(w,x,y,z) \) such that $f(w,0,0,z) = 1 $$f(1,x,1,z) = x + z $$f(w,1,y,z) = wz + y $
The number of literals in the minimal sum-of-products expression of \( f \) is \(\underline{\hspace{2cm}}\).
Consider a 3-bit counter, designed using T flip-flops, as shown below. Assuming the initial state of the counter given by $PQR$ as $000$, what are the next three states?
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$?