problem 1: Find out the complement of 1110010001110011.

problem 2: Add 11100011 and 00011100 in one’s complement. Deduce the result.

problem 3: For each data unit of the given sizes, find out the minimum number of redundancy bits required to correct one single-bit error:

a) 12
b) 16
c) 24
d) 64

problem 4: Build the hamming code for the bit sequence 10011101.

problem 5: Compute the VRC and LRC for the given bit pattern by using even parity:

0011101 1100111 1111111 0000000

problem 6: A sender sends 01110001; the receiver receives 01000001. If only VRC is employed, can the receiver detect the error?

problem 7: If a divisor is 101101, how many bits long are CRC?

problem 8: Find out the binary equivalent of x⁸ + x³ + x + 1.

problem 9: Find out the polynomial equivalent of 100001110001.

problem 10: A receiver receives the code 11001100111. When it employs the hamming encoding algorithm, the outcome is 0101. Which bit is in error? What is the right code?