Compression Foundations Checkpoint

Worked scenarios: trace state, diagnose mistakes, and apply the module contract.


Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. A source has counts [4,2,1,1]. A code assigns lengths [1,2,3,3]. What is its expected payload length?

Select one answer.

2. Lengths [2,2,2] reserve what fraction of binary prefix space? Answer as a decimal.
3. A table header costs 24 bits. It saves one payload bit for each of 16 symbols. Ignoring padding, what happens to total length?

Select one answer.

4. A byte histogram gives the same probabilities for AABB and ABAB. Which claim follows?

Select one answer.

5. A source always emits one known symbol. What is its Shannon entropy in bits per symbol?
6. A three-byte match costs 19 bits; its three literal codes cost 6 bits each. How many bits does choosing the match add?
Join Discord