A networking company uses a compression technique to encode the message before transmitting over the network. Suppose the message contains the following characters with their frequency:
{a: 5, b: 9, c: 12, d: 13, e: 16, f: 45}
If the compression technique used is Huffman Coding, how many bits will be saved in the message?
Can you please explain this ques
First see how the form huffman tree here https://www.geeksforgeeks.org/huffman-coding-greedy-algo-3/
Now check the 4th question here https://www.geeksforgeeks.org/practice-questions-on-huffman-encoding/
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.