A CRC code uses y $+$ x$+1$ as the generator polynomial. This CRC

code will not detect the following error pattern:

$($a$)100001$

$13\mathrm{.}2($a$)$

$($b$)110001($c$)1000010011($d$)0000100000$

$($b$)$

$($C$)$

$($d$)$

$14)$ If a Hamming code is used to protect the character of $8$ bits, the

number of redundant bits needed will be:

$($a$)1$ bit

$($b$)2$ bits

$($c$)3$ bits

$($d$)4$ bit

$14$

$($a$)$

$($b$)$

$($c$)$

$($d$)$

$15)$ A transmitter uses a cyclic redundancy check $($CRC$)$ code to

protect the data transmitted. The remainder calculated is found to be

equal to x$+1.$ If the generator polynomial is not known, the CRC bits

must be:

$($a$)11$

$15\mathrm{.}1$

$($b$)011$

$($a$)$

$($c$)0011$

$($b$)$

$($d$)$ neither a$,$ b or c

$($c$)$

$($d$)$

The transmitted polynomial is found to be equal to y$+$x$5+1.$ In this

case the transmitted information bits are:

$($a$)1100001($b$)00011000000($c$)000011000001($d$)$ neither a$,$ b or c

$15\mathrm{.}2$

$($a$)$

$($b$)$

$($C$)$

$($d$)$