Chapter 24

Question 1

What happens inside Huffman encoding

Answer 1

It determines the frequency of occurrence of each character in the text message (not for image). Then build a binary tree (leaf) node for each character. Then set the weight of each node according to frequency of that character.

Question 2

Does graph have more than one path to go from root to leaf and does tree have only one path to go from root to leaf.

Answer 2

Yes

Question 3

Does huffman encoding creates optimum prefix code

Answer 3

Yes

Question 4

Does smallest frequency characters goes deepest in tree in huffman

Answer 4

Yes