Networking Chapter 10 Flashcards

1
Q

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

A

C) A single bit per data unit is inverted

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Which error detection method uses one’s complement arithmetic?

A) Simple parity check
B) Checksum
C) Two-dimensional parity check
D) CRC

A

B) Checksum

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

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

A

C) Simple parity check

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which error detection method involves polynomials?

A) CRC
B) Simple parity check
C) Two-dimensional parity check
D) Checksum

A

A) CRC

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

In cyclic redundancy checking, what forms the check bits?
A) The remainder
B) The divisor
C) The quotient
D) The dividend

A

A) The remainder

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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

A

C) 111111110

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

At the CRC generator, _______ is (are) added to the dataword after the division process to create the codeword.
A) 0’s
B) 1’s
C) the remainder
D) the divisor

A

C) the remainder

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

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

A

A) − 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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

A

D) is discarded

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

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

A

B) a nonzero remainder

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

B) 6

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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

A

C) 4

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

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

A

A) 9

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Checksum uses ____________ addition.
A) one’s complement
B) two’s complement
C) three’s complement
D) None of the choices are correct

A

A) one’s complement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

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

A

B) 6

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

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

A

C) 11

17
Q

A checksum can _________ errors.
A) only detect
B) only correct
C) both detect and correct
D) None of the choices are correct

A

C) both detect and correct