Lesson Plan

• Describe why error detection is essential for reliable data communication.
• Identify and differentiate common error‑detection techniques (parity, 2‑D parity, checksum, CRC, Hamming code).
• Apply parity, checksum and CRC calculations to sample data blocks.
• Compare the detection capability, overhead and typical use of each technique.
• Evaluate which method is most suitable for a given networking scenario.

• Projector and screen
• Whiteboard and markers
• Worksheets with error‑detection examples
• Computers with a simple binary‑calculator app or IDE
• Printed handouts of parity tables and CRC generator polynomial
• Calculators (or spreadsheet) for checksum/CRC

Begin with a short video clip showing a garbled text message caused by transmission errors. Ask students to recall how binary data is stored and transmitted, linking to previous lessons on binary representation. Explain that today they will learn how computers detect and correct such errors, and they will be able to demonstrate at least three detection methods by the end of the lesson.

1. Do‑now (5'): Quick quiz on causes of transmission errors and why they matter.
2. Mini‑lecture (10'): Overview of error types and the need for detection.
3. Demonstration (15'): Parity check and two‑dimensional parity using the whiteboard.
4. Group activity (15'): Students calculate a checksum and perform a CRC‑8 calculation on a given data block.
5. Guided practice (10'): Introduction to Hamming code – students encode a 4‑bit word and locate a single‑bit error.
6. Exit ticket (5'): Write one advantage of CRC over simple parity and submit on a sticky note.

Summarise the key take‑aways: error detection protects data integrity, each technique has trade‑offs, and CRC provides strong burst‑error detection. Collect exit tickets, then assign a homework task to research a real‑world protocol (e.g., Ethernet or TCP) and explain which error‑detection method it uses.