Regulations:

2011

BANNARI AMMAN INSTITUTE OF TECHNOLOGY

(An Autonomous Institution Affiliated to Anna University)
SATHYAMANGALAM 638 401
Question Bank
Department : INFORMATION TECHNOLOGY
Branch & Semester : S6 IT - A&B
Subject Code & Title: 11I605-Information Coding Techniques
Faculty Name

: Dr.C.Palanisamy and Ms.Bessy M Kuriakose

Unit

: 4 (Image Compression)
PART A

Q.
No.

1.

2.

3.

4.

5.

Question

Types of entropy encoding------------------A. statistic

B. Run length
C. Variable length
D. Huffman
In digitized document to enable the receiver to regain synchronism each scan
line is terminated with known ----------------- code
A. start of line code
B. End of line code
C. end of document
D. Beginning of document
------------- is first applied to the source information prior to its transmission
A. compression
B. detection
C. information
D. transmission
The application of the compression algorithm in the main function is carried out
by --------A. source encoder
B. destination encoder
C. source decoder
D. destination decoder
Lossless compression is said to be-------------------

Marks
Thinking
Skill
(Blooms
Taxonomy)

6.

7.

8.

9.

10.

11.

12.

A. reversible
B. irreversible
C. constant
D. variable
The application of the decompression algorithm in the main function is carried
out by -------A. source encoder
B. destination encoder
C. source decoder
D. destination decoder
Entropy encoding is ---------------A. loseless
B. lossy
C. independent
D. proportional
The rate of change in magnitude as one traverses the matrix gives rise to
------------ frequency
A. horizontal
B. spatial
C. vertical
D. diagonal
The transformation of a 2D matrix of pixel values into an equivalent matix of
spatial frequency components can be carried out using a mathematical
technique ------------A. cosine transform
B. direct cosine transform
C. fourier transform
D. laplace transform
The branches of Huffman tree is assigned with the values --------------A. 0
B. 0 & 1
C. 011
D. 19
In the Huffman tree the termination point of a branch is --------A. root node
B. leaf node
C. left node
D. branch node
The table of colors can relate to the whole image is ------------A. local color table
B. global color table
C. color table
D. Image table

13.

14.

15.

16.

17.

18.

19.

20.

The table of colors can relate to the part of image is ------------A. local color table
B. global color table
C. color table
D. Image table
GIF reduces the number of possible colors that are present by choosing the
---------- colors from the original set of 224 colors.
A. 250
B. 128
C. 266
D. 65536
TIFF supports pixel resolution of up to ------------------ bits.
A. 8
B. 16
C. 32
D. 48
In digitized documents the resulting code words are fixed and grouped into
------------- table
A. termination code
B. make up
C. pre defined
D. User defined
To enable the receiver to regain synchronism, each scanned line is terminated
with ------------ code
A. Termination
B. End-of-line
C. make up
D. pre defined
The computation of the quantized coefficients involves -------------------- the
quotients to the
nearest integer value.
A. truncating
B. rounding
C. condensation
D. abruption
The DC coefficient in the transformed matrix is ---------------A. smallest
B. largest
C. zero
D. negative
frame consists of number of components each of which is known as -----------A. field
B. bit
C. scan

21.

22.

23.

24.

25.

D. track
------------ encoding is used when the source information contains long strings
of same symbol such as, character, bit or byte.
A. static Huffman
B. Arithmetic
C. Dynamic Huffman
D. run-length
In ------------ mode, the DC components, low frequency and high frequency
components are sent.
A. hierarchical
B. progressive
C. horizontal
D. vertical
Which header is in top level of JPEG encoder format?
A. scan
B. frame
C. block
D. segment
Each pair of run length coding is represented as-----------------A. (Value, skip)
B. (Skip, value)
C. (Sss, value)
D. (Value, sss)
In digitized documents, group 3 and group 4 compression ratios are------A. 1:10
B. 10:1
C. 1:1
D. 10:10
PART B

Q.
No.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
PART C

Question

Thinking
Skill
(Blooms
Taxonomy)

Q. No.

Question

1.

(i) Enumerate the different stages in JPEG standard and explain

the same.
(ii)Differentiate loss less and lossy compression technique and
give one
example for each
(iii)State the prefix property of Huffman code.
Sketch the schematic diagram of JPEG encoder and explain why AC and DC
coefficients are encoded separately in JPEG.
Assuming a quantization threshold value of 16, derive the
resulting
quantization error for each of the following DCT coefficients
127, 72, 64, 56,-56,-64,-72,-128.
Investigate on the block preparation and quantization phases
of JPEG
compression process with diagrams wherever necessary.
Elucidate on the GIFF and TIFF image compression formats.

2.
3.

4.
5.
6.

Assuming MMR coding scheme for digitized documents explain the following
terms with the help of pel patterns.
Pass mode, Vertical mode, Horizontal.

7.

List down the principles of compression and explain them with suitable
examples.
Compare and Contrast the compression of Text, Image, Audio and Video.
Justify which of these compression techniques are suitable.

8.
9.

List the types of image compression techniques and write the pros and cons of each
compression Techniques based on the performances applications.

10.
11.
12.

Elaborate the working of Group 3 and Group 4 in digitized documents. (R)

Illustrate the run-length encoding and explain how it achieves compression.

13.
14.
15.
16.
17.
18.
19.
20.

Thinking
Skill
(Blooms
Taxonomy)