MULTIMEDIA AND QUALITY OF SERVICE
COMPRESSION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Frequency
|
|
|
Order in ASCII
|
|
|
Number value
|
|
|
None of the above
|
Detailed explanation-1: -Huffman coding first creates a tree using the frequencies of the character and then generates code for each character. Once the data is encoded, it has to be decoded.
Detailed explanation-2: -Leaf node of a character shows the frequency occurrence of that unique character.
Detailed explanation-3: -Huffman code is a = 000, b = 001, c = 010, d = 011, e = 1. This is the optimum (minimum-cost) prefix code for this distribution. Given an alphabet A with frequency distribution f(a) : a ∈ A. The binary Huffman tree is constructed using a priority queue, Q, of nodes, with labels (frequencies) as keys.
Detailed explanation-4: -Huffman coding is a form of lossless compression which makes files smaller using the frequency with which characters appear in a message. This works particularly well when characters appear multiple times in a string as these can then be represented using fewer bits . This reduces the overall size of a file.