Download AKTU B-Tech 8th Sem 2018-19 NCS 085 Data Compression Question Paper

Firstranker's choice

FirstRanker.com

Printed Pages: 02

--- Content provided by‌ FirstRanker.com ---

Paper Id: 110241

Sub Code: NCS 085

Roll No.

B TECH

(SEM-VIII) THEORY EXAMINATION 2018-19

--- Content provided by‌ FirstRanker.com ---

DATACOMPRESSION

Time: 3 Hours

Total Marks: 100

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

--- Content provided by‍ FirstRanker.com ---

1. Is Huffman coding is a lossless or lossy compression? Write applications of Huffman coding.
2. What is a composite source model?
3. What are prefix codes?
4. Explain JBIG standard.
5. Explain entropy.

--- Content provided by‍ FirstRanker.com ---

6. Define compression ratio.
7. Determine whether the code {0, 10,110,111} is uniquely decodable or not.
8. Which compression technique is used in “compress” command of Unix operating systems?
9. Explain uniform quantizer.
10. What is entropy coded quantization?

--- Content provided by‍ FirstRanker.com ---

SECTION B

2. Attempt any three of the following: 10 x 3 = 30

1. What is Data Compression? Why we need it? Explain Compression and Reconstruction with the help of block diagram.
2. Explain various types of dictionary based coding techniques. Explain with the help of an example.
3. Write short note on Golomb codes & Tunstall codes.
4. What do you mean by Quantization? Describe the quantization problem with the help of an example in detail.

--- Content provided by FirstRanker.com ---

5. What are the advantages of vector quantization over scalar quantization?

SECTION C

3. Attempt any one part of the following: 10 x 1 = 10

1. What do you mean by lossless compression and lossy compression? Compare lossless compression with lossy compression.
2. What do you understand by information? Give an alphabet A={a₁,a₂,a₃,a₄},find the first order entropy of the following: P(a₁)=1/2, P(a₂)=1/4, P(a₃)=P(a₄)=1/8.

4. Attempt any one part of the following: 10 x 1 = 10

--- Content provided by​ FirstRanker.com ---

1. Given the eight symbols A, B, C, D, E, F, G, and H with probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30, and 12/30:
   1. Draw the Huffman tree for these symbols.
   2. Compute the average no. of bits/symbol.
2. Differentiate between adaptive Huffman coding and Huffman coding?

5. Attempt any one part of the following: 10 x 1 = 10

--- Content provided by⁠ FirstRanker.com ---

1. Compare and contrast LZ77 and LZ78 with examples.
2. Discuss the steps involved in Basic Algorithm for Prediction with Partial Match. (PPM).

6. Attempt any one part of the following: 10 x 1 = 10

1. Explain the various distortion criteria used in lossless schemes.
2. Differentiate between uniform and non uniform quantization.

--- Content provided by FirstRanker.com ---

7. Attempt any one part of the following: 10 x 1 = 10

1. Differentiate between scalar quantization and vector quantization.
2. Explain the steps of Lindo-Buzo-Gray algorithm.

FirstRanker.com

--- Content provided by‍ FirstRanker.com ---