ERROR DETECTION

1. Define the terms the types of errors. (1M)

-For Single-Bit Error, only 1 bit in the data unit has changed from 1 to 0 or from 0 while for
burst error, 2 or more bits in the data unit have changed from 1 to 0 o

2. Define the concept of CRC. (1M)

-An error detection technique using a polynomial to generate a series of two 8-bit block
check characters that represent the entire block of data. These block check characters are
incorporated into the transmission frame and then checked at the receiving end.

3. Explain how CRC checker works. (1M)

-A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital

networks and storage devices to detect accidental changes to digital data. Blocks of data
entering these systems get a short check value attached, based on the remainder of a
polynomial division of their contents.

4. List the steps followed in checksum generator (3M)

The sender follows these steps :

1) The units are divided into k sections each of n bits.
2) All sections are added together using 2’s complement to get the sum.
3) The sum is complemented and become the checksum.
4) The checksum is sent with the data.

5. Sort these Checksum steps into order (5M)

• The two checksum values are compared by the receiving computer
 • The receiving computer uses the data it receives to also calculate what it believes
should be the checksum, using the same mathematical algorithm
• The sending computer uses the block of data to be sent, and a predefined
mathematical algorithm, to calculate a checksum value
•If the checksum values don’t match, the receiving computer requests that the data is
transmitted again
• The sending computer sends the data, plus the checksum value

1) The sending computer uses the block of data to be sent, and a predefined mathematical
algorithm, to calculate a checksum value.
2) The sending computer sends the data, plus the checksum value.
3) The receiving computer uses the data it receives to also calculate what it believes should
be the checksum, using the same mathematical algorithm.
4) The two checksum values are compared by the receiving computer.
5) If the checksum values don’t match, the receiving computer requests that the data is
transmitted again.

6. The final number in a code of numbers. It is calculated from all the other numbers in the
code. Its purpose is to spot errors on data entry. From the explanation, what is the
detection method referring to? (1M)

-A check digit is referring to the final digit in a code of numbers. It is calculated from all the
other digits in the code. It’s purpose is to spot human errors on data entry.

7. The receiving computer sends a copy of the data immediately back to the sending
computer for comparison. From the explanation, what is the detection method referring
to? (1M)

-With an echo check, the receiving computer sends a copy of the data immediately back to
the sending computer for comparison. The sending computer compares the two sets of data
to check if any errors occurred during the transmission process.

8. Sort these Parity Check steps into order (5M)

•The sending computer adds the correct parity bit to the binary data (either an extra 1
or 0)
•The receiving computer checks to make sure the overall parity of the data received is
as agreed (an even or odd number of 1 bits)
•The sending and receiving computers agree the protocol to be used (even or odd)
•If the parity of the data is incorrect, the receiving computer will request that the data is
transmitted again
•The sending computer sends the binary data, including the parity bit
1)The sending and receiving computers agree the protocol to be used (even or odd).
2)The sending computer adds the correct parity bit to the binary data (either an extra 1 or 0).
3)The sending computer sends the binary data, including the parity bit.
4)The receiving computer checks to make sure the overall parity of the data received is as
agreed (an even or odd number of 1 bits).
5)If the parity of the data is incorrect, the receiving computer will request that the data is
transmitted again.

9. A block of data is sent alongside a calculated value. The receiving computer also
calculates what it believes should be the value. The values are then compared to see if
an error has occurred during transmission. From the explanation, what is the detection
method referring to? (1M)

-Checksum is referring to a block of data is sent alongside a calculated value. The receiving
computer also calculates what it believes should be the value. The values are then
compared to see if an error has occurred during transmission.

10. An extra bit added to a string of binary code to ensure the number of 1-bits are either
even or odd, depending upon the system used. From the explanation, what is the
detection method referring to? (1M)

-Parity check is referring to an extra bit added to a string of binary code to ensure the
number of 1-bits are either even or odd, depending upon the system used.

11 .How can the simple party bit detect a damaged data unit? (3M)

-A parity bit (extra bit)is added to every data unit so that the total number of 1's is even or
odd. Simple parity check can detect single bit errors. It can detect burst errors only if the
total number of errors in each data unit is odd.

12. What is the difference between even party and odd party? (4M)

13. Discuss the two-dimensional parity check and the types of errors it can and cannot
detect. (5M)

Two dimensional parity check organizes the data in the form of table. Parity check bits are
computed for each row. In this technique, a block of bits is divided into rows, and the
redundant row of bits is added to the whole block of data. While receiving, the parity bits are
compared with the parity bits computed from the received data.

Types of errors detected: Two dimensional parity checking increases the chances of
detecting burst errors. A 2-D parity check of n bits is capable of detecting a burst error of n
bits. A burst error of more than n bits can be detected with high probability.

Types of error cannot detected:- One pattern of error that remains elusive cannot be
detected by 2-D parity check. If 2 bits in one data unit are damaged and in another data unit,
2 bits in the same position are also damaged then the 2-D Parity checker will not detect an
error.

14. Discuss the concept of redundancy in error detection. (4M)

-The concept of detecting errors is known as redundancy. To detect errors, we need to

send some extra bits with the data. Redundant bits are added by the sender while sending
data. These redundant bits are removed by the receiver.

15. How is the check sum method of error detection take place? (4M)
-For error detection by checksums, data is divided into fixed sized frames or segments.
-ForSender’s End, the sender adds the segments using 1’s complement arithmetic to get
the sum. It then complements the sum to get the checksum and sends it along with the data
frames.
-For Receiver’s End the receiver adds the incoming segments along with the checksum
using 1’s complement arithmetic to get the sum and then complements it.
-If the result is zero, the received frames are accepted; otherwise they are discarded.