Open In App
Related Articles

Algorithms | Greedy Algorithms | Question 6

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

Which of the following is true about Huffman Coding?

(A)

Huffman coding may become lossy in some cases

(B)

Huffman Codes may not be optimal lossless codes in some cases

(C)

In Huffman coding, no code is prefix of any other code.

(D)

All of the above



Answer: (C)

Explanation:

Huffman coding is a lossless data compression algorithm. The codes assigned to input characters are Prefix Codes, means the codes are assigned in such a way that the code assigned to one character is not prefix of code assigned to any other character. This is how Huffman Coding makes sure that there is no ambiguity when decoding.



Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads