|
1
|
Differentiate
between lossy n lossless compressions.
|
|
2
|
Define search
buffer and look ahead buffer’s use in LZ77 algorithm.
|
|
3
|
What is
dictionary technique of compression? Explain its types.
|
|
4
|
Explain DCT
with the help of an example.
|
|
5
|
Compare and
contrast LZ77 and LZSS techniques.
|
|
6
|
Compare and
contrast speech compression and text compression.
|
|
7
|
Write a note
on silence compression.
|
|
8
|
Write a note
on JPEG compression.
|
|
9
|
Explain LZSS
algorithm.
|
|
10
|
How can we do
lossless compression of sound? Explain various techniques.
|
|
11
|
Explain
Adaptive coding.
|
|
12
|
What is
Quantization? Why do we do quantization in JPEG compression?
|
|
13
|
Explain LZ77
algorithm and problems with it.
|
|
14
|
Explain LZ78
algorithm.
|
|
15
|
Explain
balancing act with the help of example.
|
|
16
|
What is
Arithmetic coding? How does it work explain with an example
|
|
17
|
What is
Hoffman coding? explain with suitable example
|
|
18
|
Explain
overflow problem with an suitable example
|
|
19
|
Explain the
Practical matters and also List out the complication found in arithmetic
coding
|
|
20
|
Define Data
Compression. Mention advantages and disadvantages of data
compression
|
|
21
|
Give difference
between Huffman Coding and Shannon-Fano Coding
|
|
22
|
Check whether
following code are uniquely decodable?
a) {
0,11,01,111 } b) { 1,10,110,111 } c) { 0,01,110,111 }
|
|
23
|
Why Adaptive
Huffman coding is preferred over Huffman coding? List out the enhancements
|
|
24
|
Generate Arithmetic Code for the
following:
p(y)=0.1,
p(e)=0.2, p(r)=0.1, p(g)=0.1, p(n)=0.1 , p(m)=0.1 , p(a)=0.1 ,
p(f)=0.1,
p(c)=0.1 and string is german
|
|
25
|
What is the
underflow problem in arithmetic coding? How it is taken care of ?
|
|
26
|
What
is the difference between lossless and lossy compression? How can be a
compression algorithm is evaluated
|
|
27
|
What are the
various applications of Huffman coding
|
|
|
|
|
28
|
Explain
Adaptive Huffman Coding. How it is different from conventional Huffman Coding?
|
|
29
|
Write Short
notes on the following:
A)The
Escape Symbol B)Entropy
|
|
30
|
Consider
source alphabet of A, B, C,………G,H having probabilities P(xi)=1/2, 1/4, 1/16,
1/16, 1/32, 1/32, 1/32, 1/32. Design the Huffman code. Calculate average
length of code word and code efficiency?
|
