Information Theory
Bachelor of Science in Computer Science · University · Core Courses
In this unit you will: compute information content and entropy; apply prefix-free codes, Huffman coding, and redundancy; understand Hamming distance, parity, and error correction; compute channel capacity and conditional entropy; solve information theory problems reliably.
There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.
What's included
- Compute information content and entropy
- Apply prefix-free codes · Huffman coding · and redundancy
- Understand Hamming distance · parity · and error correction
- Compute channel capacity and conditional entropy
- Solve information theory problems reliably
Example questions
- What is the information content of an event with probability 1/8?
- True or false? “A certain event with p = 1 has an information content of 0 bits.”
- What is the entropy of a fair coin toss?