Data Compression
Overzicht
Write out the word BANANA in ordinary character codes and it takes 42 bits. Write it out cleverly and it takes 9. Nothing has been thrown away, nothing has been approximated, and the original word can be reconstructed exactly. The saving comes from noticing something the plain encoding ignores: the letter A turns up three times as often as the letter B, and a code that gives A a shorter pattern than B will win.
This lesson covers what data compression is, why it is worth doing, and the two methods this specification examines. You will learn to write data as run length encoding pairs, to build a Huffman tree from a string and read the codes off it, to interpret a tree somebody else has given you, and to calculate exactly how many bits each method saves against plain 7-bit ASCII. You will also learn the situation in which compression makes a file larger, which is a real result and a favourite of examiners.
Doelstellingen
- Explain what data compression is.
- Understand why data may be compressed and that there are different ways to compress data. Explain how data can be compressed using Huffman coding. Be able to build a Huffman tree.
- Be able to interpret a Huffman tree.
- Calculate the number of bits required to store a piece of data compressed using Huffman coding.
- Calculate the number of bits required to store a piece of uncompressed data in ASCII.
- Explain how data can be compressed using run length encoding (RLE).
- Represent data in RLE frequency/data pairs.
Mindmap
Dit onderwerp is in kaart gebracht zodat je ziet hoe de ideeen samenhangen.
Open de mindmap in de app
Lesnotitie
Volledige lesnotitie beschikbaar in de Green Bridge-app
Installeer de Green Bridge CBT-app op je telefoon of computer voor de volledige IGCSE-bibliotheek: examens uit voorgaande jaren, correctiemodellen, mindmaps, flashcards en audiolessen.
Lesevaluatie
Gefeliciteerd met het voltooien van de les op Data Compression. Nu je de sleutelconcepten en ideeën, het is tijd om uw kennis op de proef te stellen. Deze sectie biedt een verscheidenheid aan oefeningen vragen die bedoeld zijn om uw begrip te vergroten en u te helpen uw begrip van de stof te peilen.
Je zult een mix van vraagtypen tegenkomen, waaronder meerkeuzevragen, korte antwoordvragen en essayvragen. Elke vraag is zorgvuldig samengesteld om verschillende aspecten van je kennis en kritisch denkvermogen te beoordelen.
Gebruik dit evaluatiegedeelte als een kans om je begrip van het onderwerp te versterken en om gebieden te identificeren waar je mogelijk extra studie nodig hebt. Laat je niet ontmoedigen door eventuele uitdagingen die je tegenkomt; beschouw ze in plaats daarvan als kansen voor groei en verbetering.
- What is data compression? A. Encoding data so it uses fewer bits while representing the same information B. Deleting parts of a file that are not needed C. Converting a file from binary into hexadecimal D. Copying a file to a second storage device Answer: A
- Using run length encoding with frequency first, how is the binary data 00011000 represented? A. 3 0 2 1 3 0 B. 0 3 1 2 0 3 C. 3 2 3 D. 8 0 Answer: A
- Why does run length encoding work poorly on a file of English text? A. Text files are always too large to compress B. Consecutive characters are usually different, so runs are very short C. Text is stored in Unicode rather than in binary D. Run length encoding can only be used on numbers Answer: B
- In a Huffman tree, which characters end up with the shortest codes? A. The ones that occur least often B. The ones that occur most often C. The ones that come first alphabetically D. All characters get codes of equal length Answer: B
- A message of 20 characters is stored in 7-bit ASCII. How many bits does it need uncompressed? A. 27 B. 60 C. 140 D. 160 Answer: C
Maak deze vragen in de app
Maak deze vragen in de app
Aanbevolen Boeken
Oefen Proefexamenvragen
Wilt u proefexamenvragen over Data Compression oefenen? Download de Green Bridge CBT-app voor toegang tot proefexamenvragen en volledige oefentoetsen over dit onderwerp.
Download de app in de Google Playstore
Alles wat je nodig hebt om uit te blinken in JAMB, WAEC en NECO.
