Data transmission is about getting bits from one device to another, and checking that they arrived unchanged. Examiners test it with short, calculable questions: find a parity bit, spot a corrupted byte, or explain what a router does with a packet.
This module sits between representing numbers and text and the later work on hardware and processing. You will use binary and character codes here, so a quick revision of those helps.
What should you know before you start?
You need to be comfortable writing a number or a letter as a binary pattern, and counting the 1s in a byte. If you can write 65 as 1000001, you are ready. Cambridge Computer Science is its own subject, separate from ICT, so check the current 0478 syllabus page for what is examined.
One example that shows the whole topic
A device wants to send the letter A. In ASCII, A is 65, which is the 7-bit pattern 1000001.
Even parity needs an even number of 1s in total. This pattern has two 1s, which is already even, so the parity bit is 0. The transmitted byte is 10000010.
Suppose noise flips the third bit, so the receiver gets 10100010. It counts 1,0,1,0,0,0,1,0 and finds three 1s.
Three is odd, so the receiver knows an error happened. It cannot tell which bit is wrong, so it asks for the byte again.
That small story contains detection, the limit of parity, and the idea of retransmission.
In what order should you study the lessons?
- Trace a packet through a simplified network: the route data takes, so the later checks have a context.
- Compare serial and parallel transfer conceptually: how many bits move at once, and why that matters over distance.
- Explain parity using a worked example: the simplest check, and the one most often calculated.
- Use a checksum example without overclaiming security: a stronger check, with an honest account of its limits.
- Distinguish error detection from correction: which methods only notice a problem and which can repair it.
Which traps catch students in this module?
- Saying parity “fixes” errors. It only detects some of them.
- Forgetting that two flipped bits can cancel out and pass a parity check.
- Describing a checksum as “secure”. It guards against accidents, not attackers.
- Mixing up the packet header (addressing and numbering) with the payload (the data being carried).
- Writing “faster” for parallel transfer without mentioning the problems over long distances.
How should you use the practice set?
Work through the data transmission and checking practice set after the lessons, with a pencil and paper. Write out every parity count and checksum sum rather than doing it in your head. The restricted pseudocode trace trainer and the safe Python reasoning sandbox let you step through small checking algorithms and see each variable change.
When a mistake repeats, log it and retest it later with the mistake log and retest queue. If the same slip keeps returning after a few attempts, that is a good moment to talk to a teacher about online one-to-one Computer Science tuition.