Data compression

EasyMedium
1234567891011121314151617181920212223242526272829303132333435363738394041
Question 40
Easy

Complete the code table below for characters P, T, and R for the Huffman tree shown in Figure 1. The code for character E has already been completed.

CharacterBinary code
E0
P
T
R

A binary Huffman tree with a root node labelled with frequency 13. The left branch is labelled '0' and leads directly to leaf node 'E' with frequency (5). The right branch is labelled '1' and leads to an intermediate node with frequency (8). From node (8), the left branch is labelled '0' and leads to leaf node 'P' with frequency (3); the right branch is labelled '1' and leads to an intermediate node with frequency (5). From node (5), the left branch is labelled '0' and leads to leaf node 'T' with frequency (2); the right branch is labelled '1' and leads to leaf node 'R' with frequency (3).

[3]

Data compression Questions

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