Topic: Algorithms
Huffman coding algorithm works on the principle of
- A. Randomization of symbols
- B. Key based portioning of symbols
- C. Hashing of symbols
- D. Frequencies of input symbols
Answer: D. Frequencies of input symbols
Explanation: Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, with lengths based on the frequencies of the corresponding characters. The most frequent character gets the smallest code and the least frequent character gets the largest code.