Answer the following questions:
1. Explain how the error card trick from the Error Detection lesson uses a parity scheme. Was it an even or odd parity scheme?
Answer
The card trick uses a parity scheme because for each row and column, if there is an odd number of face up cards, then that is the equivalent of an “error” because it is an even parity. This is because no errors would be present if no cards were flipped, leaving an even number of flipped cards per row and column.
2. What are some of the limitations of using parity bits for error detection?
Answer
Some of the limitations of using parity bits for error detection include that it is tedious to do manually because for each byte a person mst review all of the bits. In addition, longer strings of 1s and 0s require more parity bits, so more storage.
3. Another type of error detection is a check sum. Research what a check sum is and then describe it in your own words. Can a check sum identify where an error occurs?
Answer
A check sum is a piece of data that is taken from a block of data. The purpose of this is to check for errors when the data was stored or transmitted. It represents the sum of the digits in the original data which can then be compared after transmission. This does not pinpoint error location, though.
4. (Optional) Explain in your own words the difference between error detection and error correction. Describe how the error correction process used in the video above allows the computer to fix errors.
Answer
Error detection only detects of there in an error in the code- it does not show where that error was in the code or what it is. The error correction method uses parity bits to check the original data bits, which can be represented by three overlapping circles each with a parity bit and a data bit where they overlap. They can then check where the error was made and what it is.