Data compression

EasyMedium
1234567891011121314151617181920212223242526272829303132333435363738394041
Question 34
Easy

Using the Huffman codes shown in Figure 1, complete the partial Huffman tree shown in Figure 2 by identifying which character belongs in each of the empty leaves: Leaf X, Leaf Y, and Leaf Z.

Figure 1: Character Codes

CharacterBinary code
M1
K00
L010
J011

Figure 2: Partial Huffman Tree

Partial Huffman Tree

State the character for:

a.

Leaf X

[1]
b.

Leaf Y

[1]
c.

Leaf Z

[1]

Data compression Questions

  1. GCSE
  2. /Computer Science
  3. /Data compression