Beruflich Dokumente
Kultur Dokumente
pinoybix.org/2017/07/mcq-in-error-detection-and-correction-forouzan.html
July 18,
2017
This is the MCQ in Error Detection and Correction from book the Data Communications and
Networking 4th Edition by Behrouz A. Forouzan. If you are looking for a reviewer in
datacom, topic in Electronics Systems and Technologies (Communications Engineering) this
will definitely help you before taking the Board Exam.In this particular topic you have
learned that Data can be corrupted during transmission. To address this issue some
applications require that errors be detected and must be corrected. If you skip the summary
visit Error Detection and Correction.
1/13
Begin and Good luck!
Choose the letter of the best answer in each questions.
View Answer:
Answer: Option A
Solution:
A) 0000
B) 1111
C) 1110
D) 0111
View Answer:
Answer: Option A
Solution:
3. In modulo-11 arithmetic, we use only the integers in the range ______, inclusive.
A) 1 to 10
B) 0 to 10
C) 1 to 11
View Answer:
Answer: Option B
2/13
Solution:
View Answer:
Answer: Option B
Solution:
5. The ________ between two words is the number of differences between corresponding
bits.
A) Hamming rule
B) Hamming code
C) Hamming distance
View Answer:
Answer: Option C
Solution:
A) range
B) power
C) degree
View Answer:
Answer: Option C
Solution:
3/13
7. In modulo-2 arithmetic, __________ give the same results.
View Answer:
Answer: Option A
Solution:
A) The quotient
B) The dividend
C) The divisor
D) The remainder
View Answer:
Answer: Option D
Solution:
9. Which error detection method consists of just one redundant bit per data unit?
A) CRC
B) Checksum
View Answer:
Answer: Option C
Solution:
10. In _____ coding, we divide our message into blocks, each of k bits, called ___.
4/13
A) block; blockwords
B) block; datawords
C) linear; datawords
View Answer:
Answer: Option B
Solution:
11. A _____ error means that two or more bits in the data unit have changed.
A) burst
B) double-bit
C) single-bit
View Answer:
Answer: Option A
Solution:
A) 0
B) 1
C) 2
View Answer:
Answer: Option A
Solution:
13. In ________ error correction, the receiver corrects errors without requesting
retransmission.
A) onward
5/13
B) forward
C) backward
View Answer:
Answer: Option B
Solution:
14. If the Hamming distance between a dataword and the corresponding codeword is three,
there are _____ bits in error.
A) 5
B) 4
C) 3
View Answer:
Answer: Option C
Solution:
A) an odd-number of
B) an even-number of
C) two
D) no errors
View Answer:
Answer: Option A
Solution:
A) 0
B) 1
6/13
C) n
View Answer:
Answer: Option A
Solution:
17. In a linear block code, the _______ of any two valid codewords creates another valid
codeword.
A) ANDing
B) XORing
C) ORing
View Answer:
Answer: Option B
Solution:
18. In ________ error correction, the receiver asks the sender to send the data again.
A) forward
B) backward
C) retransmission
View Answer:
Answer: Option C
Solution:
19. We can divide coding schemes into two broad categories: ________ and ______coding.
A) linear; nonlinear
B) block; convolution
C) block; linear
7/13
D) none of the above
View Answer:
Answer: Option B
Solution:
A) 1 and 2
B) 0 and 1
C) 0 and 2
View Answer:
Answer: Option B
Solution:
21. To guarantee correction of up to 5 errors in all cases, the minimum Hamming distance in
a block code must be ________.
A) 11
B) 6
C) 5
View Answer:
Answer: Option A
Solution:
A) detection; correction
B) correction; detection
C) creation; correction
D) creation; detection
8/13
View Answer:
Answer: Option B
Solution:
A) 4
B) 8
C) 2
View Answer:
Answer: Option A
Solution:
A) 0000
B) 1111
C) 0111
D) 1110
View Answer:
Answer: Option B
Solution:
A) 1101
B) 1000
C) 1111
View Answer:
Answer: Option B
9/13
Solution:
26. In block coding, if n = 5, the maximum Hamming distance between two codewords is
________.
A) 5
B) 3
C) 2
View Answer:
Answer: Option A
Solution:
A) Checksum
B) CRC
View Answer:
Answer: Option A
Solution:
A) redundancy
B) degree
C) generator
View Answer:
Answer: Option C
Solution:
10/13
29. In modulo-2 arithmetic, we use the ______ operation for both addition and subtraction.
A) OR
B) XOR
C) AND
View Answer:
Answer: Option B
Solution:
30. We add r redundant bits to each block to make the length n = k + r. The resulting n-bit
blocks are called _________.
A) codewords
B) datawords
C) blockwords
View Answer:
Answer: Option A
Solution:
31. To guarantee the detection of up to 5 errors in all cases, the minimum Hamming
distance in a block code must be _______.
A) 11
B) 5
C) 6
View Answer:
Answer: Option C
Solution:
11/13
32. A generator that contains a factor of ____ can detect all odd-numbered errors.
A) x
B) 1
C) x + 1
View Answer:
Answer: Option C
Solution:
33. _______codes are special linear block codes with one extra property. If a codeword is
rotated, the result is another codeword.
A) Convolution
B) Cyclic
C) Non-linear
View Answer:
Answer: Option B
Solution:
A) 0
B) 1
C) 2
View Answer:
Answer: Option C
Solution:
13/13