Huffman Coding 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. For symbol IDs 0,1,2 with weights 2,1,1, the first merge joins 1 and 2 at weight 2. Which root child goes left?

Select one answer.

Either child; this exercise does not constrain ties The merged node because internal nodes always go first Symbol 0, because it has smaller minimum symbol ID at equal weight Symbol 2 because it was last inserted

2. Canonical lengths are [1,3,3]. Give symbol 2's code as a three-bit string.

3. A decoder receives lengths [1,1,2]. Which result is required?

Select one answer.

Accept with codes 0,1,10 Reject only if all frequencies are equal Reject because the two one-bit words leave no prefix for the third Accept by assigning an empty code to the third

4. A Huffman merge trace has weights 3,5,9. What is the total weighted leaf-depth cost?

5. Tree codes and canonical codes have identical per-symbol lengths but different bits. Which is guaranteed?

Select one answer.

Their encoded byte streams match They have identical left/right tree edges They have the same weighted payload cost for the same frequencies Either decoder can read the other without a table

6. Only symbol 4 has positive frequency. How many bits does this pack assign to one occurrence?

Auto-advance on pass

Open access learning · Go · Python · C · SQL · No external dependencies

Transparency · Support this project

Join Discord