COMPUTER SCIENCE AND ENGINEERING
COMPUTER NETWORKING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Compression that removes the unnecessary parts of a file
|
|
|
Compression that allows the data to be perfectly reconstructed after it was compressed
|
|
|
Compression that removes the file altogether
|
|
|
Compression that removes the file tag to reduce the file’s size
|
Detailed explanation-1: -Lossless compression is a class of data compression algorithms that allows the original data to be perfectly reconstructed from the compressed data. Lossless compression methods are reversible.
Detailed explanation-2: -Lossless compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of information.
Detailed explanation-3: -3. Lossless data compression algorithms are Run Length Encoding, Huffman encoding, Shannon fano encoding, Arithmetic encoding, Lempel Ziv Welch encoding, etc. Lossy data compression algorithms are: Transform coding, Discrete Cosine Transform, Discrete Wavelet Transform, fractal compression, etc.
Detailed explanation-4: -Lossless compression “packs” data into a smaller file size by using a kind of internal shorthand to signify redundant data. If an original file is 1.5 MB, for example, lossless compression can reduce it to about half that size, depending on the type of file being compressed.
Detailed explanation-5: -Lossless data compression algorithms (such as PNG) are reversible (there is no loss in quality); you can reconstruct the original data. Lossless compression works by removing redundant data.