Data compression

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41

Question 8

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

Character	Binary code
E	1
N	01
D	001
S	000

Figure 2: Partial Huffman Tree

                   (15)
                  /    \
                 0      1
                /        \
              (7)        [ E ]
             /   \
            0     1
           /       \
         (3)       [ Leaf Z ]
        /   \
       0     1
      /       \
  [ Leaf X ]  [ Leaf Y ]

State the character for:

Leaf X

[1]

Leaf Y

[1]

Leaf Z

[1]

Data compression

Question 8

Figure 1: Character Codes

Figure 2: Partial Huffman Tree

Data compression Questions

Data compression

Question 8

Figure 1: Character Codes

Figure 2: Partial Huffman Tree

Data compression Questions