Huffman and Shannon–Fano Codes

0/66 solved

1 / 66

Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.

Huffman's algorithm merges nodes until one remains. For an alphabet of 4 symbols, how many merge steps does it perform?

Read the section this question comes from

Your answer

info-huffman-9All Information Theory chapters

About these 66 questions

Building an optimal prefix code symbol by symbol, proving it optimal, and seeing where the older Shannon–Fano construction falls short. This set covers the chapter Huffman and Shannon–Fano Codes in Information Theory: 19 easy, 31 medium and 16 hard questions, each graded instantly with a hint and a full step-by-step solution. Progress is saved in this browser only.

Huffman's Algorithm — 11 questions
Optimality of Huffman Codes — 11 questions
Huffman Coding in Practice — 11 questions
The Splitting Construction — 11 questions
Where Fano's Heuristic Loses to Huffman — 11 questions
Why the History Matters — 11 questions