YOUR REVISION ROUTE
Read a summary, then close your notes and explain it aloud. Use the Flashcards tab to test recall and select uncertain cards. Your revision list links back to the relevant lessons.
2.1 | TYPES AND METHODS OF DATA TRANSMISSION
Separate three questions: how is data organised, how do bits travel, and which directions are allowed? A packet is a unit of data; serial describes a bit sequence; full-duplex describes simultaneous two-way communication.
2.1.1 | PACKETS AND PACKET SWITCHING
| Component | Remember |
|---|---|
| Header | Destination address, originator’s address and packet number |
| Payload | Part of the actual message data |
| Trailer | End / error-checking information in the syllabus model |
The sender divides data into packets. Routers forward them towards the destination. Packets may follow different routes and arrive out of order. Once all required packets arrive, the receiver reorders them using packet numbers and reassembles their payloads.
Packets 3, 1, 2 arriving with payloads CAFE, COMPUTER [space], SCIENCE [space] reconstruct COMPUTER SCIENCE CAFE when reordered 1, 2, 3.
Different routes are possible, not compulsory. Packet numbers help ordering; they are not routing instructions. Packetisation is not compression, and packet switching alone does not guarantee delivery.
2.1.2 | SERIAL AND PARALLEL
| Method | How bits travel | Suitability / trade-off |
|---|---|---|
| Serial | One bit at a time along a channel | Fewer data lines; useful for many longer external connections |
| Parallel | Several bits simultaneously on separate lines | More bits per transfer step; multiple lines, skew and crosstalk concerns |
At the same step rate, a one-bit serial channel needs eight steps for a byte; an eight-line parallel link needs one. Actual transfer speeds depend on the implementation, so parallel is not always faster.
Skew: bits intended to arrive together reach the receiver at different times. Crosstalk: interference between nearby signal lines.
| Mode | Allowed direction | Example |
|---|---|---|
| Simplex | One direction only | Conventional radio broadcast |
| Half-duplex | Both directions, taking turns | Walkie-talkies on a shared channel |
| Full-duplex | Both directions simultaneously | A telephone conversation |
A serial connection can be full-duplex. Do not use “serial” as another word for one-way.
2.1.3 | UNIVERSAL SERIAL BUS
USB is a standard interface connecting devices and transferring data serially. A typical computer host detects the peripheral, obtains device information and configures communication with suitable software.
Benefits: wide support, plug and play for compatible devices, hot plugging, data and power together, and extra connections through hubs.
Drawbacks: limited practical cable reach, shared hub bandwidth, power limits, and different connector / cable / device capabilities. USB-C is a reversible connector shape, not a guarantee of one speed or power rating.
Hot plugging does not make interrupted storage writes harmless. Finish transfers and use the appropriate safe-removal procedure. Charging alone does not establish a working data connection.
2.2 | METHODS OF ERROR DETECTION
Interference can cause data change, gain or loss. Detection identifies evidence of an error; recovery deals with the result. A successful check means no error was detected by that method, not that every possible error is excluded.
PARITY | COUNT ONES, NOT THE NUMBER’S VALUE
Add a parity bit so the total count of 1s is even for even parity or odd for odd parity. Count the data bits and the parity bit together.
| Data | 1s | Even parity bit | Odd parity bit |
|---|---|---|---|
| 1011001 | 4 | 0 | 1 |
| 1011000 | 3 | 1 | 0 |
| 0000000 | 0 | 0 | 1 |
A single flip breaks the rule. Two flips may preserve it, so simple parity cannot guarantee detection of every error or identify the damaged bit.
A parity byte supplies column parity for eight data columns. A block check uses row and column parity. For a single flipped bit, the failed row and column intersect at its position. Multiple errors can be ambiguous; four flips at rectangle corners can pass all row and column checks.
CHECKSUM AND ECHO CHECK
Checksum: the sender calculates a value for a data block and sends it. The receiver recalculates from received data using the same algorithm and compares. A mismatch detects an error.
For the teaching algorithm sum mod 256: bytes 200, 100, 50 total 350, so the checksum is 94. Algorithms differ; use the rule given.
Bytes 10, 20, 30 and 11, 19, 30 both sum to 60. A matching checksum can miss a change. The simple sum also misses reordering.
Echo check: the receiver returns received data. The sender compares it with the original. This adds return traffic and time; return-path errors can affect the result.
CHECK DIGIT | ENTRY AND SCANNING
A check digit is calculated from a code’s other digits. It helps detect some entry or scanning mistakes. ISBNs and many product barcodes use check digits.
For a classroom rule requiring the digit sum to be a multiple of ten, 4271 needs check digit 6. The full code 42716 totals 20. This simple rule misses digit swaps.
ISBN-13 instead weights the first twelve digits alternately by 1 and 3. For 978030640615, the weighted sum is 93, so the check digit is 7. A sum already ending in 0 needs check digit 0.
A valid check digit does not prove the code refers to the intended item. Follow the algorithm given, rather than assuming all systems use the same rule.
ARQ | CHECK, ACKNOWLEDGE, REPEAT
- Send data and start a timer.
- The receiver checks it.
- A positive acknowledgement, ACK, confirms the accepted data.
- A negative acknowledgement, NAK, can request retransmission.
- If an expected acknowledgement does not arrive before timeout, retransmit.
A timeout can mean the data or its acknowledgement was lost or delayed. It does not prove corruption. Sequence identification lets a reliable protocol recognise repeats and avoid delivering duplicate data.
ARQ uses an error check; it is not the check calculation itself. Some designs use timeout without explicit NAKs. Retries may fail if communication remains disrupted.
2.3 | ENCRYPTION
Encryption transforms plaintext into ciphertext using an algorithm and key to protect confidentiality. Decryption recovers the data with the appropriate key. Encryption does not stop interception or guarantee delivery.
SYMMETRIC AND ASYMMETRIC KEYS
| Feature | Symmetric | Asymmetric |
|---|---|---|
| Keys | Same shared secret key | Related public/private key pair |
| Encrypt for Bob | The shared secret key | Bob’s verified public key |
| Bob decrypts | The same shared secret key | Bob’s private key |
| Keep secret | Shared key | Private key |
| Main practical point | Share the secret securely; efficient for bulk data | Public key may be shared; verify ownership |
If Bob replies confidentially to Alice using asymmetric encryption, he encrypts with Alice’s verified public key and she decrypts with her private key.
Secure systems may combine asymmetric techniques for key establishment with symmetric encryption for bulk data. Encryption alone does not necessarily authenticate the sender or detect alterations.
A classroom shift cipher illustrates keys but is easily broken. Do not treat it as secure modern encryption.
COMMON MISTAKES
- Putting addresses in the payload instead of the header.
- Assuming packets must all follow different routes.
- Confusing serial with simplex.
- Claiming parallel is always faster or USB-C always means one performance level.
- Counting the binary value rather than the number of 1s for parity.
- Claiming parity or checksums detect every error.
- Describing ARQ without acknowledgements or a timeout.
- Using the sender’s public key for a confidential message to someone else.
- Saying encryption prevents interception rather than protecting the contents.
READY TO TEST YOURSELF?
Explain a packet journey, set a parity bit, describe an ARQ retry and choose the keys for a confidential reply. Then check your recall.