|
1 | | Which of the following best describes a single-bit error? |
| | A) | A single bit is inverted |
| | B) | A single bit per transmission is inverted |
| | C) | A single bit per data unit is inverted |
| | D) | All of the choices are correct |
|
|
|
2 | | Which error detection method uses one's complement arithmetic? |
| | A) | Simple parity check |
| | B) | Checksum |
| | C) | Two-dimensional parity check |
| | D) | CRC |
|
|
|
3 | | Which error detection method consists of just one redundant bit per data unit? |
| | A) | Two-dimensional parity check |
| | B) | CRC |
| | C) | Simple parity check |
| | D) | Checksum |
|
|
|
4 | | Which error detection method involves polynomials? |
| | A) | CRC |
| | B) | Simple parity check |
| | C) | Two-dimensional parity check |
| | D) | Checksum |
|
|
|
5 | | If the ASCII character G is sent and the character D is received, what type of error is this? |
| | A) | Single-bit |
| | B) | Multiple-bit |
| | C) | Burst |
| | D) | Recoverable |
|
|
|
6 | | If the ASCII character H is sent and the character L is received, what type of error is this? |
| | A) | Burst |
| | B) | Recoverable |
| | C) | Single-bit |
| | D) | Multiple-bit |
|
|
|
7 | | In cyclic redundancy checking, what forms the check bits? |
| | A) | The remainder |
| | B) | The divisor |
| | C) | The quotient |
| | D) | The dividend |
|
|
|
8 | | In CRC, if the dataword is 111111, the divisor 1010, and the remainder 110, what is the codeword at the receiver? |
| | A) | 111111011 |
| | B) | 1010110 |
| | C) | 111111110 |
| | D) | 110111111 |
|
|
|
9 | | In CRC, if the dataword is 111111 and the divisor 1010, what is the dividend at the sender? |
| | A) | 1111110000 |
| | B) | 111111000 |
| | C) | 111111 |
| | D) | 1111111010 |
|
|
|
10 | | At the CRC generator, _______ is (are) added to the dataword after the division process to create the codeword. |
| | A) | 0s |
| | B) | 1s |
| | C) | the remainder |
| | D) | the divisor |
|
|
|
11 | | The sum of the checksum and data at the receiver is _______ if no error is detected. |
| | A) | − 0 |
| | B) | + 0 |
| | C) | the complement of the checksum |
| | D) | the complement of the dataword |
|
|
|
12 | | In CRC, the quotient at the sender _______. |
| | A) | becomes the dividend at the receiver |
| | B) | becomes the divisor at the receiver |
| | C) | is the remainder |
| | D) | is discarded |
|
|
|
13 | | At the CRC checker, _______ means that the dataword is damaged. |
| | A) | a string of alternating 1s and 0s |
| | B) | a nonzero remainder |
| | C) | a string of 0s |
| | D) | None of the choices are correct |
|
|
|
14 | | A codeword of 10 bits has only four 0s, how many terms are in the polynomial representation of this code? |
| | A) | 4 |
| | B) | 6 |
| | C) | 8 |
| | D) | None of the choices are correct |
|
|
|
15 | | In CRC, if the remainder is only three bits, the divisor should be __________ bits. |
| | A) | 3 |
| | B) | 2 |
| | C) | 4 |
| | D) | None of the choices are correct |
|
|
|
16 | | How many bits are in the divisor if we use CRC-8? |
| | A) | 9 |
| | B) | 8 |
| | C) | 10 |
| | D) | None of the choices are correct |
|
|
|
17 | | Checksum uses ____________ addition. |
| | A) | ones complement |
| | B) | twos complement |
| | C) | threes complement |
| | D) | None of the choices are correct |
|
|
|
18 | | To detect five errors, the Hamming distance between each pair of codewords should be at least_________. |
| | A) | 5 |
| | B) | 6 |
| | C) | 11 |
| | D) | None of the choices are correct |
|
|
|
19 | | To correct five errors, the Hamming distance between each pair of codewords should be at least_________. |
| | A) | 5 |
| | B) | 6 |
| | C) | 11 |
| | D) | None of the choices are correct |
|
|
|
20 | | A checksum can _________ errors. |
| | A) | only detect |
| | B) | only correct |
| | C) | both detect and correct |
| | D) | None of the choices are correct |
|
|