Seat No______________

KADI SARVA VISHWAVIDYALAYA

B.E. SEMESTER – VI REGULAR EXAMINATION APRIL -2022
SUBJECT CODE: - IT603-N SUBJECT NAME:- DATA COMPRESSION
DATE: - 16/04/2022 TIME: - 12:30 PM to 03:30 PM MARKS:-70 Marks
Instructions:
1. Answer each section in separate Answer Sheet.
2. Use of scientific calculator is permitted.
3. All questions are compulsory.
4. Indicate clearly, the options you attempted along with its respective question number.
5. Use the last page of main supplementary for rough work.

SECTION – I
Q-1 A Define Data Compression. Mention advantages and disadvantages of data [5]
compression.
B Define the following Terms: - (i) Codeword (ii) Self Information (iii) First Order [5]
Entropy (iv) Markov Model (v) Unary Code
C Differentiate between Huffman Coding and Arithmetic Coding. [5]
OR
C What is the concept behind the Run Length Coding? Encode the following [5]
sequence using Run Length Coding:
DDEEDFFFAAABBCCCCDDDDDFFFFEEECCCCCBBBBBAAAAAEEAAA

Q-2 A Write down the algorithm of the Shannon Fano coding and explain with example. [5]
B What is Uniquely decodable code? Check whether following code are uniquely [5]
decodable or not?
(i) {0,01,11,111} (ii) {1,01,110,111} (iii) {0,10,110,111} (iv) {1,10,110,111}
OR
Q-2 A Consider source alphabet of A = {a1,a2,a3,a4,a5} with having probabilities [5]
P(a1)=1/2, P(a2)=1/4, P(a3)=1/8, P(a4)=1/16, P(a5)=1/16
(i) Calculate the entropy of this source (ii) Design the Huffman code (iii) Find the
average length of the code (iv) redundancy.
B Explain Prefix code. Check whether following code is prefix code or not? [5]
(i) {0,10,110,111} (ii) {0,10,11,111} (iii) {0,1,10,11} (iv) {0,01,001,0001}

Q-3 A Given an alphabet A = {a1, a2, a3, a4}, find the first-order entropy in the following [5]
cases: i) P(a1) = P(a2) = P(a3) = P(a4) = 1/4
ii) P(a1) = 0.5, P(a2) = 0.25, P(a3) = 0.125, and P(a4) = 0.125
B Define the Tunstall Code and Generate the Tunstall Code for P(A)=0.6, P(B)=0.3, [5]
P(C)=0.1 and n = 3 bit.
OR
Q-3 A Generate update procedure tree and encode the given sequence “a a r d v” using [5]
Adaptive Huffman Coding.
B What is the concept behind the Minimum Variance Huffman Codes? List out and [5]
explain different applications of Huffman coding.

1 of 2
 SECTION - II
Q-4 A What is Static Dictionary. Explain Digram Coder technique with example. [5]
B Write down the difference between following terms [5]
i) Lossless Compression and Lossy Compression
ii) Scalar Quantization and Vector Quantization
C Find the tag value using Arithmetic coding for the given alphabetic sequence “went.” [5]
with the probability model p(e) = 0.3, p(n) = 0.3, p(t) = 0.2, p(w) = 0.1, p(.) = 0.1
OR
C Decode the given tag value = 0.63725 using Arithmetic coding for the alphabetic [5]
sequence with the given probabilities P(A) = 0.5, P(B) = 0.3, P(C) = 0.2

Q-5 A Given an initial dictionary consisting of the letters {A, B, C, D, R}. Encode the following [5]
message using the LZ77 algorithm: {C A B R A C A D A B R A R R A R R A D}
Assume you have a window size of 13 with a look-ahead buffer of size 6.
B Write down the comparison among LZ77, LZ78 and LZW dictionary algorithms. [5]
OR
Q-5 A Encode the following sequence using the LZ78 algorithm: {S A T A T A S A C I T A S [5]
A}
Initial Dictionary is given as
Index Entry
1 S
2 A
3 T
B List out and explain different applications and case studies of various Dictionary [5]
Algorithms.

Q-6 A Write down the steps to perform Burrows Wheeler Transform algorithm. Encode the [5]
given sequence “APPELLEE” using BWT algorithm.
B Given an initial dictionary Index 1=$, 2=a, 3=b, 4=o, 5=w, encode the following [5]
message using the LZW algorithm.
{wabba$wabba$wabba$wabba$woo$woo$woo}
OR
Q-6 A What is Quantization? Explain Various Quantization techniques briefly. [5]
B Using Move to front algorithm, decode the given value “4 0 3 5 0 1 3 5 0 1 5” using the [5]
source sequence S= {@, e, h, i, s, t}

************************

2 of 2