Question: a. Construct a Huffman tree for the following data: Symbol Frequency b. Encode ABACABAD using the tree you generated for (e). c. Decode 100010111001010 using

a. Construct a Huffman tree for the following data: Symbol Frequency b. Encode ABACABAD using the tree you generated for (e). c. Decode 100010111001010 using the tree you generated for (a). d. What compression gain (percent of improvement) do we get by using Huffman encoding instead of a fixed-length encoding scheme (assume the fixed-length scheme would require 3 bits for each character)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
