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) — extracted question text
Section AAttempt all q u e s t i o n s i n b r i e f . 2*10 = 20
- aDifferentiate between Fidelity and quality. 1
- bHow to calculate kth order Markov model of compression 1
- cWhat are the limitations of Huffman Coding? Explain. 2
- dExplain the difference between Huffman and adaptive Huffman coding technique
- fDefine the term PPM. 3
- gWhat are the various d istortion criteria? 4
- hWhat 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
- aProve 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)
- bFor 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
- cExplain various types of dict ionary-based coding techniques in detail
- dDescribe Adaptive Quantization in detail and how it is diff erent from uniform Quantization technique
- eWhat 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
- aWhat is data compression and why we need it? Describe vario us models of data compression
- bWhat 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} - aDraw 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
- bDesign 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
- aA 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
- bWhat is Facsimile Encoding? Explain Run-Length Coding techn ique used earlier for Facsimile. Describe BWT with the help of an example
- aDescribe the steps involved in Basic Algorithm for Predicti on with Partial Match (PPM)
- bWhat do you mean by Quantiza tion? Describe Uniform quantiza tion with its types in detail
- aExplain the steps of Lindo-Buzo-Gray algorithm. 5
- bWrite 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. Check the original PDF for equations, diagrams and complete wording. Extracted: 2026-08-23.
Data Compression — Other Year Papers
AKTU Data Compression PYQs from other sessions
More B.Tech Semester 6 (2021-22) Papers
Other subjects from same semester and session
Machine Design2021-22Repair And Rehabilitation Of Structures2021-22Idea To Business Model2021-22Control System2021-22Control System2021-22Microcontroller Embedded System Design2021-22Software Engineering2021-22Automotive Electrical And Electronics2021-22
View all B.Tech Semester 6 2021-22 papers →Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo