Data compression — AQA GCSE Computer Science

Data compression is the process of reducing the physical size of a data file by re-encoding its contents using fewer bits than the original representation. In AQA GCSE Computer Science, compression is divided into two fundamental methodologies: lossy compression, which permanently deletes redundant data, and lossless compression, which reduces file size without losing any original information.

Understanding compression is vital because modern computing relies heavily on transferring and storing vast volumes of digital media over bandwidth-constrained networks. By mastering algorithms like Run Length Encoding (RLE) and Huffman coding, students learn how mathematical representations optimize secondary storage limits, reduce web transmission latency, and maintain software integrity.

• →Lossy compression permanently discards imperceptible or redundant data to achieve significant file size reduction, ideal for audio (MP3), images (JPEG), and streaming video (MP4).
• →Lossless compression reconstructs the original file byte-for-byte with zero quality loss, essential for program executables, text files, and source code (ZIP, PNG, FLAC).
• →Run Length Encoding (RLE) compresses data by replacing consecutive repeated data values with a single frequency count and value pair.
• →Huffman coding builds a binary tree based on character frequencies to assign shorter bit patterns to frequently occurring characters and longer patterns to rarer ones.
• →Network advantages of compression include reduced transmission times, less bandwidth consumption, and lower network congestion.

• Compression reduces the number of bits required to store or transmit data, so file size falls.
• Compression works by identifying and encoding redundancy such as repeated patterns or predictable values.
• The compressed data can be decompressed to recover the original information, exactly or approximately.
• Compression is not the same as deleting data or discarding information the user still needs.
• A correct MCQ choice describes encoding data more efficiently so fewer bits represent the same content.

• 💡Read every option and ask which one describes reducing the bits needed to represent the data.
• 💡Eliminate options that describe deleting data or increasing file size.
• 💡Link your chosen answer to the idea of redundancy being encoded more efficiently.
• 💡When explaining the advantages of compression in exam questions, always mention both the reduction in secondary storage space and the reduction in network transmission time.
• 💡In Huffman coding calculation questions, write down your character frequency counts clearly before multiplying by the bit lengths to ensure you pick up method marks even if an arithmetic error occurs.
• 💡Read the question carefully regarding ASCII bit lengths; AQA questions frequently specify either 7-bit or 8-bit ASCII, which directly impacts your uncompressed size calculations.

• Thinking compression means deleting parts of a file permanently; correction: compression re-encodes the same information using fewer bits, and lossless methods recover it exactly.
• Confusing compression with changing file format; correction: converting a file type does not necessarily reduce the bits stored, whereas compression specifically reduces the number of bits.
• Assuming compression always loses quality; correction: lossless compression preserves the original data exactly, while only lossy compression discards some detail.
• Thinking lossy compression is always superior because it achieves smaller file sizes; lossy permanently destroys data, making it unsuitable when exact precision is required.
• Confusing data compression with data encryption; compression aims to make files smaller for storage/transmission, whereas encryption aims to make data unreadable without a decryption key.
• Assuming every file can be compressed indefinitely; files with high entropy (randomness) or files that are already compressed may actually increase in size if re-compressed with lossless methods.

1. 1Day 1: Learn the definitions, trade-offs, and file extensions associated with lossy and lossless compression.
2. 2Day 2: Practice Run Length Encoding (RLE) by encoding and decoding text strings and monochrome 2D pixel grids.
3. 3Day 3: Learn how to interpret and traverse Huffman trees to derive variable-length binary prefix codes.
4. 4Day 4: Work through exam-style calculation questions comparing uncompressed ASCII bit counts with compressed Huffman representations.
5. 5Day 5: Complete timed past paper exam questions focused on scenario-based recommendations (e.g. streaming vs document archival).

• 📋Scenario-based justification: Choosing lossy or lossless compression for a specific user scenario (e.g. medical imaging vs music streaming) and explaining why.
• 📋Huffman tree decoding and encoding: Traversing a provided tree from root to leaf to decipher binary strings or generate codes for given letters.
• 📋Size comparison calculations: Calculating the exact number of bits or bytes saved by applying RLE or Huffman coding compared to standard representations.
• 📋Definition and trade-off short answers: Defining lossy and lossless compression and outlining the impact on download speeds and visual/auditory quality.