B.TechSemester 62021-22Data CompressionKCS064

Data Compression (KCS064) - AKTU Question Paper 2021-22

B.Tech · Semester 6 · Free PDF Download

This is the official AKTU Data Compression Previous Year Question Paper for B.Tech Semester 6, academic session 2021-22. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech

Semester:Semester 6

Session:2021-22

University:AKTU / UPTU

Rate this paper

Questions Asked in 2021-22

Data Compression (KCS064) — complete question paper

Section AAttempt all q u e s t i o n s i n b r i e f . 2*10 = 20

a
Differentiate between Fidelity and quality. 1
b
How to calculate kth order Markov model of compression 1
c
What are the limitations of Huffman Coding? Explain. 2
d
Explain the difference between Huffman and adaptive Huffman coding technique
f
Define the term PPM. 3
g
What are the various d istortion criteria? 4
h
What do you understand by Quantiza tion? Describe its types. 4 (i) Write advantages of Tree stru ctured vector quantization. 5 (j) Differentiate between sca lar and vector quantization 5

Section BAttempt any three o f t h e f o l l o w i n g : 10*3 = 30

a
Prove that the average codeword length I of an optimal code f o r a source S is greater than or equal to entropy H(s)
b
For an alphabet A={a1,a2,a 3,a4,a5} with probabilities P(a1) =0.15, P(a2) =0.04, P(a3)= 0.26,P(a4)=0.05 and P(a5)=0.50 (i) Calculat e the entropy of this source (ii) Find a Huffman Code for this source . (iii) Find the average length of the code
c
Explain various types of dict ionary-based coding techniques in detail
d
Describe Adaptive Quantization in detail and how it is diff erent from uniform Quantization technique
e
What is Vector Quantization? Explain procedure for vector Quantization

Section CAttempt any one p a r t o f t h e f o l l o w i n g : 10*1 = 10

a
What is data compression and why we need it? Describe vario us models of data compression

What do you mean by Uniquely Decodable code? Determine whet her

the following codes are uniquely decodable or not: (i) {0,01,11 ,111}
(ii) {0,01,110,111} (iii) {1,10,110,111} (iv) {0,01,10}

a
Draw the Huffman tree for the following symbols whose frequ ency occurrence in a message text is started along with their symbol below: A:15, B:6, C:7, D:12, E:25, F:4, G:6, H:10, I: 15 Decode the message
b
Design 3-bit Tunstall code for a memory less source with th e following alphabet: S= {A,B,C} with their P(A)=0.6, P(B)= 0.3 , P(C)= 0.1
a
A sequence is encoded using LZW algorithm and the initial d ictionary shown in the table. Index Entry The output of LZW encoder is the following sequence: Decode this sequence. Discuss relative advantages of LZ77, LZ78 and LZW Compression schemes
b
What is Facsimile Encoding? Explain Run-Length Coding techn ique used earlier for Facsimile. Describe BWT with the help of an example
a
Describe the steps involved in Basic Algorithm for Predicti on with Partial Match (PPM)
b
What do you mean by Quantiza tion? Describe Uniform quantiza tion with its types in detail
a
Explain the steps of Lindo-Buzo-Gray algorithm. 5
b
Write short notes on any two : (I) Structure vector quantiz ation (II) Pyramid vector quantization (III) Advantages of Vector quantization

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Repeated Questions — KCS064

Questions that appeared in more than one session, found by comparing 3 years of Data Compression papers (2021-22, 2022-23, 2023-24)

A sequence is encoded using LZW algorithm and the initial d ictionary shown in the table. Index Entry The output of LZW encoder is the following sequence: Decode this sequence. Discuss relative advantages of LZ77, LZ78 and LZW Compression schemes

Appeared in: 2021-22 · 2022-23 · 2023-24

What are the limitations of Huffman Coding? Explain. 2

Appeared in: 2021-22 · 2022-23

Define the term PPM. 3