Question: Huffman Tree Part 1 Build a Huffman from this data: E-0.50 G-0.30 H-0.10 M-0.05 N-0.05 Part 2 Using your tree from Part 1: 1) Show
Huffman Tree Part 1 Build a Huffman from this data: E-0.50 G-0.30 H-0.10 M-0.05 N-0.05 Part 2 Using your tree from Part 1: 1) Show your comprssed data 2) Determine the nunhber of bits saved over using bytes for the original string LZV Part 1 Compress this string given below and show both your dictionary and the final com data: ABABABCBCBCBCABC 20 Part 2 Compress this string given below and show both your dictionary and the final com data: AAAAAABBBBBBCCCCCCBBBBBAAAAACCCCC
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
