LosslessMCQ

What is lossless image compression?

• A method that reduces file size without loss of data
• A method that removes unnecessary pixels
• A method that reduces color depth
• A method that converts images to grayscale

Which of the following is a lossless compression technique?

• JPEG
• Huffman Coding
• Wavelet Compression
• Transform Coding

Which of the following is NOT a lossless compression technique?

• Run-length coding
• Huffman coding
• Arithmetic coding
• JPEG

Entropy in information theory measures

• Data redundancy
• Data compression ratio
• Information content
• Storage capacity

Which of the following is a property of lossless compression?

• Irreversible data loss
• Higher compression ratio than lossy compression
• Data is perfectly reconstructed
• Requires more storage space than original

Run-length encoding is most effective for

• Text files
• Random data
• Images with large homogeneous areas
• Audio files

In Huffman coding, shorter codes are assigned to

• Less frequent symbols
• More frequent symbols
• Symbols with higher ASCII values
• Symbols with lower ASCII values

Which coding technique assigns the shortest code to the most frequent symbols?

• Arithmetic coding
• Run-length encoding
• Huffman coding
• Dictionary-based coding

Shannon-Fano coding is a type of

• Run-length coding
• Huffman coding
• Variable-length coding
• Lossy compression

What is the key difference between Huffman and Shannon-Fano coding?

• Shannon-Fano is optimal, Huffman is not
• Huffman coding ensures prefix property
• Shannon-Fano requires prior knowledge of probabilities
• Huffman does not use binary trees