THEORY EXAMINATION (SEM–VIII) 2016-17 DATA COMPRESSION

Section A 
 

Section A contains short questions that test basic concepts of data compression techniques. Students need to write definitions and short explanations related to coding methods, entropy, compression ratio, and distortion. These questions check fundamental theoretical knowledge.

Example Questions from Section A:

What is entropy?

Define data compression.

What is lossless compression?

Define compression ratio.

Differentiate between fidelity and quality.

Explain binary code.

What is Huffman coding?

Define distortion.

What is PPM (Prediction by Partial Matching)?

Explain Golomb coding.

Section B
 

Section B contains medium-length questions that require detailed explanations of coding algorithms and compression techniques. Students must describe working of compression methods and modeling techniques.

Example Questions from Section B:

Explain Rice coding and its implementation.

Explain minimum variance Huffman code.

Describe LZW encoding and decoding.

Explain adaptive quantization.

Explain prediction with partial match.

Explain scalar and vector quantization.

Explain prefix codes with example.

Discuss applications of Huffman coding.

Explain modeling and coding techniques.

Section C 
 

Section C contains long and advanced questions that require detailed explanations and analysis of quantization and encoding techniques. Students must explain algorithms and compare compression methods.

Example Questions from Section C:

Explain adaptive quantization methods.

Describe facsimile encoding and run-length coding.

Explain uniform quantizer and its working.

Compare quantization techniques.

Discuss advanced compression methods.