Data compression question bank

Define Following.

1. Compression Ratio.
2. Entropy.
3. Data Retrieval.
4. Distortion.
5. Self-Information.
6. Compare Lossless and Lossy Data Compression.
7. Run Length Coding.
.
Unit 1: Compression Techniques
1. Compare Lossless Compression with Lossy Compression.
2. Explain types of data compression. List out applications of data retrieval.
3. How to measure the performance of multiple Data Compression algorithms? Explain
parameters to select one algorithm out of many.
4. Differentiate following :(i). Lossy Compression vs. Lossless Compression
5. Explain modeling and coding. Explain how this will help to reduce entropy for following data.
9,11,11,11,14,13,15,17,16,17,20,21.

Mathematical Preliminaries for Lossless Compression Models

1. Explain Different types of models in data compression.
2. Write a short note on uniquely decodable codes.
3. Define following terms:
(i)Uniquely Decodable Code
(ii) Prefix Code
(iii)Write a short note on Prefix Code.
5. Define: - Compression Ratio, Entropy, Distortion, Data Retrieval, Query Optimization and
Run Length Coding.
6. Explain Markov model with example.

Unit 2: Huffman coding

1.An alphabet S ={ a1, a2, a3 ,a4 ,a5} symbols with probabilities as P(a1) = 0.4, P(a2) =0.3,
P(a3)=0.2, P(a4)=0.09, and P(a5)=0.01, Find out Huffman code, source entropy, average length
and compression ratio.
2. Explain Huffman Coding with respect to minimum variance Huffman codes with separate
trees.
3. Explain the Encoding process of Adaptive Huffman Algorithm
4. How Extended Huffman reduces code average length Code? Prove using alphabet A={a1, a2,
a3} with probability 0.95, 0.03 and 0.02 respectively.
5. Consider a source containing 26 distinct symbols [A-Z]. Encode given sequence of symbols
using Adaptive Huffman algorithm. Symbol Sequence: MUMMY.
6.Design a minimum variance Huffman code for a source that put out letter from analphabet A={
a1, a2, a3, a4, a5, a6} with P(a1)=P(a2)=0.2, P(a3)=0.25, P(a4)=0.05,P(a5)=0.15,P(a6)=0.15