The correct answer for each question is indicated by a

1INCORRECT Which error detection method uses one's comp ement arithmetic! A)"imp e parity chec# B Two$dimensiona parity chec# ) C)CRC D)Chec#sum

%INCORRECT Which error detection method consists of &ust one redundant bit per data unit! A)"imp e parity chec# B Two$dimensiona parity chec# ) C)CRC D)Chec#sum

'INCORRECT In cyc ic redundancy chec#in() what is the CRC! A)The di*isor B The quotient ) C)The di*idend D)The remainder

+INCORRECT In cyc ic redundancy chec#in() the di*isor is ,,,,,,, the CRC. A)The same si-e as B one bit ess than ) C)one bit more than D)none of the abo*e

.CORRECT

/ burst error means that two or more bits in the data unit ha*e chan(ed. A)doub e$bit B burs ) t

C)sin( e$bit D)none of the abo*e

0CORRECT

In ,,,,,,,, error correction) the recei*er corrects errors without requestin( retransmission. A)bac#ward B onward ) C)forward D)none of the abo*e

1CORRECT

In ,,,,,,,, error correction) the recei*er as#s the sender to send the data a(ain. A)bac#ward B retransmission ) C)forward D)none of the abo*e

2CORRECT

We can di*ide codin( schemes into two broad cate(ories3 ,,,,,,,, and ,,,,,,codin(. A)b oc#4 inear B inear4 non inear ) C)b oc#4 con*o ution D)none of the abo*e

5INCORRECT In modu o$% arithmetic) ,,,,,,,,,, (i*e the same resu ts. A)addition and mu tip ication B addition and di*ision ) C)addition and subtraction D)none of the abo*e

16CORRECT

In modu o$% arithmetic) we use the ,,,,,, operation for both addition and subtraction. A)7OR B OR ) C)/N8 D)none of the abo*e

11INCORRECT In ,,,,, codin() we di*ide our messa(e into b oc#s) each of k bits) ca ed ,,,. A)b oc#4 b oc#words B inear4 datawords ) C)b oc#4 datawords D)none of the abo*e

1%INCORRECT

We add r redundant bits to each b oc# to ma#e the en(th n 9 k : r. The resu tin( n$bit b oc#s are ca ed ,,,,,,,,,. A)datawords B b oc#words ) C)codewords D)none of the abo*e

1'CORRECT

The ,,,,,,,, between two words is the number of differences between correspondin( bits. A);ammin( code B ;ammin( distance ) C);ammin( ru e D)none of the abo*e

1+INCORRECT

To (uarantee the detection of up to . errors in a cases) the minimum ;ammin( distance in a b oc# code must be ,,,,,,,. A).

B0 ) C)1 1 D)none of the abo*e

1.INCORRECT

To (uarantee correction of up to . errors in a cases) the minimum ;ammin( distance in a b oc# code must be ,,,,,,,,. A). B0 ) C)1 1 D)none of the abo*e

10CORRECT

In a inear b oc# code) the ,,,,,,, of any two *a id codewords creates another *a id codeword. A)7ORin( B ORin( ) C)/N8in( D)none of the abo*e

11INCORRECT / simp e parity$chec# code can detect ,,,,,,,,,, errors. A)an e*en$number of B tw ) o C)no errors D)an odd$number of

12INCORRECT

,,,,,,,codes are specia inear b oc# codes with one e<tra property. If a codeword is rotated) the resu t is another codeword. A)Non$ inear B Con*o ution )

C)Cyc ic D)none of the abo*e

15INCORRECT The ,,,,,of errors is more difficu t than the ,,,,,,. A)correction4 detection B detection4 correction ) C)creation4 correction D)creation4 detection

%6INCORRECT

In modu o$11 arithmetic) we use on y the inte(ers in the ran(e ,,,,,,) inc usi*e. A)1 to 16 B 1 to 11 ) C)6 to 16 D)none of the abo*e

%1INCORRECT In modu o$% arithmetic) we use on y ,,,,,,. A)1 and % B 6 and % ) C)6 and 1 D)none of the abo*e

%%INCORRECT /ddin( 1 and 1 in modu o$% arithmetic resu ts in ,,,,,,,,,. A)1 B% ) C)6 D)none of the abo*e

%'INCORRECT In b oc# codin() if # 9% and n 9') we ha*e ,,,,,,, in*a id codewords.

A)2 B+ ) C)% D)none of the abo*e

%+INCORRECT The ;ammin( distance between equa codewords is ,,,,,,,,,. A)1 Bn ) C)6 D)none of the abo*e

%.INCORRECT The ;ammin( distance between 166 and 661 is ,,,,,,,,. A)% B6 ) C)1 D)none of the abo*e

%0INCORRECT

In b oc# codin() if n 9 .) the ma<imum ;ammin( distance between two codewords is ,,,,,,,,. A)% B' ) C). D)none of the abo*e

%1INCORRECT

If the ;ammin( distance between a dataword and the correspondin( codeword is three) there are ,,,,, bits in error. A)' B+ ) C). D)none of the abo*e

%2INCORRECT The ,,,,,,, of a po ynomia is the hi(hest power in the po ynomia . A)ran( e B de(ree ) C)power D)none of the abo*e

%5CORRECT

The di*isor in a cyc ic code is norma y ca ed the ,,,,,,,,,. A)de(ree B (enerator ) C)redundancy D)none of the abo*e

'6CORRECT

/ (enerator that contains a factor of ,,,, can detect a odd$numbered errors. A)< B <:1 ) C)1 D)none of the abo*e

'1INCORRECT Chec#sums use ,,,,,,,,, arithmetic. A)two's comp ement arithmetic B one's comp ement arithmetic ) C)either =a> or =b> D)none of the abo*e

'%INCORRECT

In one's comp ement arithmetic) if positi*e 1 is 6111) then ne(ati*e 1 is ,,,,,,,,. A)111 1

B 116 ) 1 C)166 6 D)none of the abo*e

''INCORRECT The chec#sum of 1111 and 1111 is ,,,,,,,,,. A)111 1 B 666 ) 6 C)111 6 D)611 1

'+CORRECT

The chec#sum of 6666 and 6666 is ,,,,,,,,,,. A)111 1 B 666 ) 6 C)111 6 D)611 1