Proofs of Algorithm Correctness and Runtime Estimates · Application: Data Compression (Optional)
Lesson 8
Problem. An alphabet has \(5\) symbols with the following frequencies: \(A \colon 0.35, B \colon 0.2, C \colon 0.2, D \colon 0.15, E \colon 0.1\). Construct an optimal prefix code (Huffman code) for it. What is the average codeword length?
1 point