MULTIMEDIA AND QUALITY OF SERVICE
COMPRESSION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
A Binary tree is an algorithm based on what compression type
|
|
Lossy
|
|
|
Lossless
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -Lossless compression is a compression technique that does not lose any data in the compression process. Lossless compression “packs” data into a smaller file size by using a kind of internal shorthand to signify redundant data.
Detailed explanation-2: -In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression.
There is 1 question to complete.