huffman encoding technique
Hi. No matter how hard i try i cant get this technique in my head. please instruct or make tree for me. Thats the most difficult part. I can do others they are in our book. Line to encode is below.
MY NETWORK APPLICATION IS WORKING PROPERLY
1. Construct the frequency table for all the letters given in the sentence excluding new line character.
2. Construct Huffman tree for the given sentence.
3. Construct Huffman code table for each letter.
4. Prove mathematically that how much percentage of bandwidth is saved by Huffman technique as compared to ASCII encoding scheme (ASCII is encoding scheme that represent each character as 8 bits).
Note: ignore the NL character. Don't count it in frequency table.
MY NETWORK APPLICATION IS WORKING PROPERLY
1. Construct the frequency table for all the letters given in the sentence excluding new line character.
2. Construct Huffman tree for the given sentence.
3. Construct Huffman code table for each letter.
4. Prove mathematically that how much percentage of bandwidth is saved by Huffman technique as compared to ASCII encoding scheme (ASCII is encoding scheme that represent each character as 8 bits).
Note: ignore the NL character. Don't count it in frequency table.
Topic archived. No new replies allowed.