Question

Qu 2: [6 Marks) (a) Information to be transmitted over the internet contains the following characters with their associated frequencies as shown in the following table: Character abenos tu Frequency 11 6 14 12 3 132 Use Huffman Code Algorithm to answer the following questions: (i) Build the Huffman code tree for the message. (ii) Use the tree to find the codeword for each character. (iii)If the data consists of only these characters, what is the total number of bits to be transmitted? (iv) What is the percentage saving compared to sending the data using 8-bit ASCII encoding. (b): Using the Huffman tree constructed in (a) above, (i) Decode the following sequence of bits: 1111011110110110100000111110110 (ii) Write the bit sequences that encode each of the following: antenna, estate, obtuse, boneless.

Answer 1

NOTE: AS PER OUR CHEGG POLICY , WE CAN ONLY SOLVE 4 PARTS OF THE QUESTIONS

EXPLANATION:

• First of all , build a huffman tree step by step using huffman algorithm.
• Then find the codeword for the characters, from the tree.
• Then calculate the total bits to be transferred after encoding by multiplying each length with frequency.
• Calculate the total percentage saving by taking out percentage from actual bits of ASCII encoding.

Ques 2. (2.) (in) Building Huffman code tree: Steps: ab e nost u 11 6 14 12 3 13 2 4 and arrang Assange in descending order? e s in a b eo & 14 13 12 11 6 4 3 2 Step 2: Make tree by joining frequences low to high arranging arranging again an again in the descending order. © 14 13 12 11 64 14 13 12 6 4 => ☺ » 14 13 12 11 6 → 14 13 12 33 ©

Final Tree

(iv) Total percentage saving = X100 bett transferred after eneeding bits in 8-bit ASCO encoding Total bits ind-bit AICI zreading = (1176H4 + 12+3+13t2tu) = 520 Totoy peceutige souris 186 8100 = 35.76% 520