OCR H446 ยท Component 01
1.3.1 Compression, encryption and hashing
Lossy and lossless compression, run-length encoding, dictionary coding, encryption, symmetric and asymmetric keys, hashing, collisions, rainbow tables, salts, and checksums.
Topic overview
Build accurate recall, then apply it.
RecallStride combines active flashcards, quick checks, exam practice and scheduled review. Progress is based on learning evidence rather than passive completion.
- Encode AAAACCCBB using (count,character) run-length pairs. If each count and character occupies one byte, compare sizes.Apply
- What is compression?Compression
- Why do we compress files?Compression
- What is lossy compression?Compression
- What is lossless compression?Compression
- How does run-length encoding work?Compression
Published with owner authorisation; awaiting independent academic review. RecallStride is independently produced and is not endorsed by OCR. OCR is a registered trademark of OCR.