Data Compression: Multiple Choice Questions On

Multiple Choice Questions on Data Compression
Multiple Choice Questions

On
DATA COMPRESSION
By
Mr. Sandeep Vishwakarma
Assistant Professor
Dr. A.P.J. Abdul Kalam
Technical University,Lucknow
YouTube: www.youtube.com/c/UniversityAcademy
1|Page University Academy www.universityacademy.in , info@universityacademy.in

1. Data compression means to ______ the file size.

(A) Increase
(B) Decrease
(C) Can't say
(D) None of the above
Answer
Correct option is B
2. Data compression and encryption both work on binary code.

(A) False
(B) True
Answer
Correct option is B
3. What is compression?
(A) To compress something by pressing it very hardly
(B) To minimize the time taken for a file to be downloaded
(C) To reduce the size of data to save space
(D) To convert one file to another
Answer
Correct option is C
4. Data compression usually works by _______.

(A) Deleting random bits data
(B) Finding repeating patterns
Answer
Correct option is B
5. Why data compressed?

(A) To optimise the data
(B) To reduce secondary storage space
(C) To reduce packet congestion on networks
(D) Both (B) and (C)
Answer
Correct option is D
6. Which is a type of data compression?

(A) Resolution
(B) Zipping
(C) Inputting
(D) Caching
Answer
Correct option is B
7. Data compression involves

(A) Compression only
(B) Reconstruction only
(C) Both compression and reconstruction
Answer
Correct option is C
8. Based on the requirements of reconstruction, data compression schemes can be divided into ____
broad classes.

(A) 3
(B) 4
(C) 2
(D) 5
Answer
Correct option is C
9. _______ compression is the method which eliminate the data which is not noticeable and _______
compression does not eliminate the data which is not noticeable.
(A) Lossless, lossy
(B) Lossy, lossless
(C) None of these
Answer
Correct option is B
10. ______ compression is generally used for applications that cannot tolerate any difference between
the original and reconstructed data.
(A) Lossy
(B) Lossless
(C) Both
(D) None of these
Answer
Correct option is B
11. What is compression ratio?

(A) The ratio of the number of bits required to represent the data before compression to the number of
bits required to represent the data after compression.
(B) The ratio of the number of bits required to represent the data after compression to the number of
bits required to represent the data before compression.
(C) The ratio of the number of bits required to represent the data after reconstruction to the number of
bits required to represent the data before compression.
(D) The ratio of the number of bits required to represent the data before reconstruction to the number
of bits required to represent the data after reconstruction.
Answer
Correct option is A
12. Suppose storing an image made up of a square array of 256×256 pixels requires 65,536 bytes. The
image is compressed and the compressed version requires 16,384 bytes. Then compression ratio is
_______.
(A) 1:4
(B) 4:1
(C) 1:2
(D) 2:1
Answer
Correct option is B
13. Lossy techniques are generally used for the compression of data that originate as analog signals,
such as
(A) Speech
(B) Video
(C) Both
(D) None of these
Answer
Correct option is C
14. If fidelity or quality of a reconstruction is _____, then the difference between the reconstruction
and the original is ______.

(A) High, small

(B) Small, small
(C) High, high
Answer
Correct option is D
15. The development of data compression algorithms for a variety of data can be divided into ____
phases.
(A) 2
(B) 3
(C) 4
(D) 5
Answer
Correct option is A
16. Which of the following is true of lossy and lossless compression techniques?
(A) Lossless compression is only used in situations where lossy compression techniques can't be used
(B) Lossy compression is best suited for situations where some loss of detail is tolerable, especially if
it will not be detectable by a human
(C) Both lossy and lossless compression techniques will result in some information being lost from
the original file
(D) Neither lossy nor lossless compression can actually reduce the number of bits needed to represent
a file
Answer
Correct option is B
17. Which of the following would not be suitable for Lossy Compression?
(A) Speech
(B) Video
(C) Text
(D) Image
Answer
Correct option is C
18. Which of the following are not in a compressed format?

(A) MP3
(B) Bitmap
(C) MPEG
(D) JPEG
Answer
Correct option is B
19. Information theory was given by

(A) Claude von Regan
(B) Claude Elwood Shannon
(C) Claude Monet
(D) Claude Debussy
Answer
Correct option is B
20. The unit of information depends on the base of the log. If we use log base 2, the unit is ____; if we
use log base e, the unit is ____; and if we use log base 10, the unit is _____.
(A) Hartleys, nats, bits
(B) Hartleys, bits, nats
(C) Bits, nats, hartleys
(D) Bits, hartleys, nats

Answer
Correct option is C
21. According to Claude Elwood Shannon's second theorem, it is not feasible to transmit information
over the channel with ______ error probability, although by using any coding technique.
(A) Large
(B) May be large or small
(C) Unpredictable
(D) Small
Answer
Correct option is D
22. The essential condition/s for a good error control coding technique?
(A) Better error correcting capability
(B) Maximum transfer of information in bits/sec
(C) Faster coding & decoding methods
(D) All of the above
Answer
Correct option is D
23. The prefix code is also called as

(A) Block code
(B) Convolutional code
(C) Parity code
(D) Instantaneous code
Answer
Correct option is D
24. Self information should be _____.

(A) Negative
(B) Positive
(C) Both
(D) None of these
Answer
Correct option is B
25. A code in which no codeword is a prefix to another codeword is called as

(A) Prefix cod
(B) Parity code
(C) Convolutional code
(D) Block code
Answer
Correct option is A
26. The set of binary sequences is called a _____, and the individual members of the set are called
_______.
(A) Codewords, code
(B) Code, codewords
(C) None of these
Answer
Correct option is B
27. Full form of ASCII.

(A) American Standard Code for Information Intercaste
(B) American Standard Codewords for Information Interchange

(C) American Standard Code for Information Interchange

(D) American System Code for Information Interchange
Answer
Correct option is C
28. Composite source models is a combination or composition of several sources. In which how many
source being active at any given time?
(A) All
(B) Only one
(C) Only first three
(D) None of these
Answer
Correct option is B
29. For models used in lossless compression, we use a specific type of Markov process called a
(A) Continous time Markov chain
(B) Discrete time Markov chain
(C) Constant time Markov chain
Answer
Correct option is B
30. Markov model is often used when developing coding algorithms for
(A) Speech
(B) Image
(C) Both
(D) None of these
Answer
Correct option is C
31.Which of the following compression type is supported by SQL Server 2014?

(A) Row
(B) Column
(C) Both row and column
(D) None of the mentioned
Answer
Correct option is C
32.Point out the correct statement.
(A) The details of data compression are subject to change without notice in service packs or
subsequent releases
(B) Compression is not available for system tables
(C) If you specify a list of partitions or a partition that is out of range, an error will be generated
(D) All of the mentioned
Answer
Correct option is D
33. In which type of Data Compression, the integrity of the data is preserved?
(A) Lossy Compression
(B) Lossless Compression
(C) Both of the above


Answer
Correct option is B
34. Which of the following are Lossless methods?

(A) Run- length
(B) Huffman
(C) Lempel Ziv
Answer
Correct option is D
35. Which of the following are lossy methods?
(A) JPEG
(B) MPEG
(C) MP3
Answer
Correct option is D
36. In how many parts we can divide audio and video services into broad categories?
(A) Two
(B) Three
(C) Four
Answer
Correct option is B
37. Sequence of code assigned is called

(A) code word
(B) word
(C) byte
(D) nibble
Answer
Correct option is A

Unit-II
1. Huffman codes are ______ codes and are optimum for a given model (set of probabilities).
(A) Parity
(B) Prefix
(C) Convolutional code
(D) Block code
Answer
Correct option is B
2. The Huffman procedure is based on observations regarding optimum prefix codes, which is/are
(A) In an optimum code, symbols that occur more frequently (have a higher probability of
occurrence) will have shorter codewords than symbols that occur less frequently.
(B) In an optimum code,thetwo symbolsthat occurleast frequently will havethe samelength
(C) Both (A) and (B)
(D) None of these
Answer
Correct option is C
3. The best algorithms for solving Huffman codes

(A) Brute force algorithm
(B) Divide and conquer algorithm
(C) Greedy algorithm
(D) Exhaustive search
Answer
Correct option is C
4. How many printable characters does the ASCII character set consists of?
(A) 128
(B) 100
(C) 98
(D) 90
Answer
Correct option is B
5. The difference between the entropy and the average length of the Huffman code is called
(A) Rate
(B) Redundancy
(C) Power
(D) None of these
Answer
Correct option is B
6. Unit of redundancy is
(A) bits/second
(B) symbol/bits
(C) bits/symbol
(D) none of these
Answer
Correct option is C

7. The redundancy is zero when

(A) The probabilities are positive powers of two
(B) The probabilities are negative powers of two
(C) Both
Answer
Correct option is B
8. Which bit is reserved as a parity bit in an ASCII set?

(A) Sixth
(B) Seventh
(C) Eighth
(D) Ninth
Answer
Correct option is C
9. Bits are needed for standard encoding if the size of the character set is X
(A) X+1
(B) log(X)
(C) X2
(D) 2X
Answer
Correct option is B
10. In Huffman coding, data in a tree always occur in

(A) Leaves
(B) Roots
(C) Left sub trees
(D) None of these
Answer
Correct option is A
11. An optimal code will always be present in a full tree.

(A) True
(B) False
Answer
Correct option is A
12. Running time of the Huffman encoding algorithm is

(A) O(Nlog(C))
(B) O(Clog(C))
(C) O(C)
(D) O(log(C))
Answer
Correct option is B
13. Running time of the Huffman algorithm, if its implementation of the priority queue is done using
linked lists
(A) O(log(C))
(B) O(Clog(C))
(C) O(C2)
(D) O(C)

Answer
Correct option is C
14. The unary code for a positive integer n is simply n ___ followed by a ___.
(A) zero, ones
(B) ones, zero
(C) None of these
Answer
Correct option is B
15. The unary code for 4 is ______.

(A) 11100
(B) 11110
(C) 00001
(D) 00011
Answer
Correct option is B
16. In the Tunstall code, all codewords are of _____ length. However, each codeword represents a
_________ number of letters.
(A) different, equal
(B) equal, different
(C) none of these
Answer
Correct option is B
17. Tunstall coding is a form of entropy coding used for

(A) Lossless data compression
(B) Lossy data compression
(C) Both
(D) None of these
Answer
Correct option is A
18. The main advantage of a Tunstall code is that

(A) Errors in codewords do not propagate
(B) Errors in codewords propagate
(C) The disparity between frequencies
(D) None of these
Answer
Correct option is A
19. Applications of Huffman Coding

(A) Text compression
(B) Audio compression
(C) Lossless image compression
Answer
Correct option is D
20. An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.4, P(B)
= 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is
10 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

(A) A = 0
B = 111
C = 110
D = 10
(B) A = 0
B = 11
C = 10
D = 111
(C) A = 0
B = 111
C = 11
D = 101
(D) A = 01
B = 111
C = 110
D = 10
Answer
Correct option is A
21. The basic idea behind Huffman coding is to

(A) compress data by using fewer bits to encode fewer frequently occuring characters
(B) compress data by using fewer bits to encode more frequently occuring characters
(C) compress data by using more bits to encode more frequently occuring characters
(D) expand data by using fewer bits to encode more frequently occuring characters
Answer
Correct option is B
22. Huffman coding is an encoding algorithm used for

(A) lossless data compression
(B) broadband systems
(C) files greater than 1 Mbit
(D) lossy data compression
Answer
Correct option is A
23. A Huffman encoder takes a set of characters with fixed length and produces a set of characters of
(A) random length
(B) fixed length
(C) variable length
(D) constant length
Answer
Correct option is C
24. A Huffman code: A = 1, B = 000, C = 001, D = 01 , P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3
The average number of bits per letter is
(A) 8.0 bit
(B) 2.1 bit
(C) 2.0 bit
(D) 1.9 bit
Answer
Correct option is C

25. Which of the following is not a part of the channel coding?

(A) rectangular code
(B) Checksum checking
(C) Hamming code
(D) Huffman code
Answer
Correct option is D
26. Which of the following is the first phase of JPEG?
(A) DCT Transformation
(B) Quantization
(C) Data Compression
Answer
Correct option is D
27. Which type of method is used is used to compress data made up of combination of symbols?
(A) Run- length encoding
(B) Huffman encoding
(C) Lempel Ziv encoding
(D) JPEG encoding
Answer
Correct option is A
28. How many passes does lossy compression makes frequently?
(A) One pass
(B) Two pass
(C) Three pass
(D) Four pass
Answer
Correct option is B
29. Information is the
(A) data
(B) meaningful data
(C) raw data
(D) Both A and B
Answer
Correct option is B

Unit-III
1. In dictionary techniques for data compaction, which approach of building dictionary is used for the
prior knowledge of probability of the frequently occurring patterns?
(A) Adaptive dictionary
(B) Static dictionary
(C) Both
Answer
Correct option is B
2. If the probability of encountering a pattern from the dictionary is p, then the average number of bits
per pattern R is given by
(A) R=21-12p
(B) R=9-p
(C) R=21-p
(D) R=12-p
Answer
Correct option is A
3. Static dictionary –
(A) permanent
(B) sometimes allowing the addition of strings but no deletions
(C) allowing for additions and deletions of strings as new input symbols are being read
(D) Both (A) and (B)
(E) Both (A) and (C)
Answer
Correct option is D
4. Adaptive dictionary –
(A) holding strings previously found in the input stream
(B) sometimes allowing the addition of strings but no deletions
(C) allowing for additions and deletions of strings as new input symbols are being read
(D) Both (A) and (B)
(E) Both (A) and (C)
Answer
Correct option is E
5. LZ77 and LZ78 are the two __________ algorithms published in papers by Abraham Lempel and
Jacob Ziv in 1977 and 1978
(A) Lossy data compression
(B) Lossless data compression
(C) Both
Answer
Correct option is B
6. Deflate = ________
(A) LZ78 + Huffman
(B) LZ77 + Huffman
(C) LZW + Huffman
(D) None of these
Answer
Correct option is B

7. Full form of GIF.

(A) Graphics Interchange Form
(B) Graphics Inter Format
(C) Graphics Interchange Format
(D) Graphics Interact Format
Answer
Correct option is C
8. LZ78 has _____ compression but very _____ decompression than LZ77.
(A) fast, slow
(B) slow, fast
(C) None of these
Answer
Correct option is B
9. Compression packages which use an LZ77-based algorithm followed by a variable-length coder.

(A) PKZip
(B) Zip
(C) PNG
Answer
Correct option is D
10. Application of LZW

(A) GIF
(B) Zip
(C) PNG
Answer
Correct option is A
11. Algorithm used for solving temporal probabilistic reasoning

(A) Depth-first search
(B) Hidden markov model
(C) Hidden markov model
(D) Breadth-first search
Answer
Correct option is C
12. Where does the Hidden Markov Model is used?

(A) Understanding of real world
(B) Speech recognition
(C) Both
Answer
Correct option is B
13. A coding scheme that takes advantage of long runs of identical symbols is called as
(A) Move-to-front coding
(B) Binary coding
(C) Huffman coding
(D) Move-to-back coding

Answer
Correct option is A
14. The idea with wavelets is to represent a complicated function by

(A) simple basic functions
(B) sinus functions
(C) lines
(D) square functions
Answer
Correct option is A
15.In a typical picture, most pixels will be

(A) equal
(B) very different to their neighbors
(C) bright
(D) very similar to their neighbors
Answer
Correct option is C
16. Without losing quality, JPEG-2000 can achieve compression ratios of

(A) 2:1
(B) 200:1
(C) 2000:1
(D) 20:1
Answer
Correct option is B
17. The best visual compression quality is achieved using

(A) Fourier transform
(B) Wavelets
(C) DCT
(D) Dolby
Answer
Correct option is B
18. Which is the image processing technique used to improve the quality of image for human
viewing?
(A) compression
(B) enhancement
(C) restoration
(D) analysis
Answer
Correct option is B
19. To remove archival compression and restore the data to column store compression
(A) Use ALTER TABLE
(B) Use ALTER COLUMN
(C) Use ALTER DATABASE
Answer

Correct option is A
20. Point out the wrong statement.
(A) You can enable or disable ROW or PAGE compression in online state only
(B) When you are compressing indexes, leaf-level pages can be compressed with both row and
page compression
(C) Non–leaf-level pages do not receive page compression
Answer
Correct option is A
21. What is image?
(A) Picture
(B) Matrix of pixel
(C) Collection of pixel
(D) All of these
Answer
Correct option is D
22. An image transmitted using wireless network:
(A) corrupted as a result of lighting or other atmospheric disturbance.
(B) non-corrupted as a result of lighting or other atmospheric disturbance.
(C) corrupted as a result of pixel disturbance.
(D) none of above
Answer
Correct option is A

Unit-IV
1. Which of the following characterizes a quantizer
(A) Quantization results in a non-reversible loss of information
(B) A quantizer always produces uncorrelated output samples
(C) The output of a quantizer has the same entropy rate as the input
Answer
Correct option is A
2. What is the signal-to-noise ratio (SNR)?

(A) The ratio of the average squared value of the source output and the squared error of the source
output
(B) The ratio of the average squared value of the source output and the mean squared error of the
source output
(C) The ratio of the average squared value of the source output and the absolute difference measure of
the source output
Answer
Correct option is B
3. The output signal of a scalar quantizer has property

(A) The output is a discrete signal with a finite symbol alphabet
(B) The output is a discrete signal with a countable symbol alphabet (but not necessarily a finite
symbol alphabet)
(C) The output signal may be discrete or continuous
Answer
Correct option is B
4. What is a Lloyd quantizer?

(A) For a given source, the Lloyd quantizer is the best possible scalar quantizer in ratedistortion sense.
That means, there does not exist any other scalar quantizer that yields a smaller distortion at the same
rate.
(B) The output of a Lloyd quantizer is a discrete signal with a uniform pmf
(C) Both (A) and (B)
(D) A Lloyd quantizer is the scalar quantizer that yields the minimum distortion for a given source
and a given number of quantization intervals.
Answer
Correct option is D
5. Which of the following statement is correct for comparing scalar quantization and vector
quantization?
(A) Vector quantization improves the performance only for sources with memory. For iid sources, the
best scalar quantizer has the same efficiency as the best vector quantizer
(B) Vector quantization does not improve the rate-distortion performance relative to scalar
quantization, but it has a lower complexity
(C) By vector quantization we can always improve the rate-distortion performance relative to the best
scalar quantizer
Answer
Correct option is C

6. If {x}n is the source output and {y}n is the reconstructed sequence, then the squared error measure
is given by
(A) d(x, y) = (y - x)2
(B) d(x, y) = (x - y)2
(C) d(x, y) = (y + x)2
(D) d(x, y) = (x - y)4
Answer
Correct option is B
7. If {x}n is the source output and {y}n is the reconstructed sequence, then the absolute difference
measure is given by
(A) d(x, y) = |y - x|
(B) d(x, y) = |x - y|
(C) d(x, y) = |y + x|
(D) d(x, y) = |x - y|2
Answer
Correct option is B
8. The process of representing a _______ possibly infinite set of values with a much _______ set is
called quantization
(A) Large, smaller
(B) Smaller, large
(C) None of these
Answer
Correct option is A
9. The set of inputs and outputs of a quantizer can be

(A) Only scalars
(B) Only vectors
(C) Scalars or vectors
(D) None of these
Answer
Correct option is C
10. Which of the folowing is/are correct for uniform quantizer

(A) The simplest type of quantizer is the uniform quantizer
(B) All intervals are the same size in the uniform quantizer, except possibly for the two outer intervals
(C) The decision boundaries are spaced evenly
Answer
Correct option is D
11. If a Zero is assigned a decision level, then what is the type of quantizer?
(A) A midtread quantizer
(B) A midrise quantizer
(C) A midtreat quantizer
Answer
Correct option is B
12. If a Zero is assigned a quantization level, then what is the type of quantizer?
(A) A midtread quantizer
(B) A midrise quantizer
(C) A midtreat quantizer

Answer
Correct option is A
13. The main approaches to adapting the quantizer parameters:

(A) An off-line or forward adaptive approach
(B) An on-line or backward adaptive approach
(C) Both
Answer
Correct option is C
14. Uniform quantizer is also called as

(A) Low rise quantizer
(B) High rise quantizer
(C) Mid rise quantizer
Answer
Correct option is C
15. Non uniform quantizer ______ distortion.

(A) Decrease
(B) Increase
(C) Doesn't change
Answer
Correct option is A
16. The spectral density of white noise is ______.

(A) Poisson
(B) Exponential
(C) Uniform
(D) Gaussian
Answer
Correct option is C
17. Which audio/video refers to on-demand requests for compressed audio/video files?
(A) Streaming live
(B) Streaming stored
(C) Interactive
Answer
Correct option is B
18. According to Nyquist theorem, how many times the highest frequency we need to sample an
analog signal?
(A) Three
(B) Two
(C) Four
Answer
Correct option is B
19. Which encoding is based on the science of psychoacoustics, which is the study of how people
perceive sound?

(A) Predictive
(B) Perceptual
(C) Both of the above
Answer
Correct option is B
20. SDH uses to measure block errors.
(A) CRC
(B) Rectangular code
(C) bit-interleaved parity (BIP )
(D) Simple parity check
21. The minimum sampling rate is called?
(A) Data rate
(B) symbol rate
(C) Nyquist rate
Answer
Correct option is C
22. Spread spectrum is used for

(A) Encrypting signal
(B) Hiding signal
(C) Encrypting & Hiding signal
Answer
Correct option is C
23. Which is a quantization process?
(A) Rounding
(B) Truncation
(C) Rounding & Truncation
Answer
Correct option is C
24. . Quantization is a _____ process.
(A) Non linear
(B) Reversible
(C) Non linear & Reversible
Answer
Correct option is C
25. The mutual information between a pair of events is
(A) Positive
(B) Negative
(C) Zero
Answer
Correct option is D
26. The SNR value can be increased by _____ the number of levels.

(A) Increasing
(B) Decreasing
(C) Does not depend on
Answer
Correct option is A
27. 1 bit quantizer is a
(A) Hard limiter
(B) Two level comparator
(C) Hard limiter & Two level comparator
Answer
Correct option is C
28. The low pass filter at the output end of delta modulator depends on
(A) Step size
(B) Quantization noise
(C) Bandwidth
Answer
Correct option is C
29. Quantization Matrix in JPEG compression was introduced because
(A) It is computationally more efficient to work with matrix than with scalar
quantization;
(B) It allows better entropy encoding due to DC and AC coefficient distribution in the
8x8 block matrix;
(C) It allows better differentiation of DC and AC coefficients in the 8x8 block matrix
than a scalar quantization;
Answer
Correct option is C
30.What property has the output signal of a scalar quantizer

(A) The output is a discrete signal with a countable symbol alphabet (but not necessarily a
finite symbol alphabet).
(B) The output is a discrete signal with a finite symbol alphabet.
(C) The output signal may be discrete or continuous.
Answer
Correct option is A

Unit-V
1. Characteristic of a vector quantizer
(A) Multiple quantization indexes are represented by one codeword
(B) Each input symbol is represented by a fixed-length codeword
(C) Multiple input symbols are represented by one quantization index
Answer
Correct option is C
2. Vector quantization is rarely used in practical applications, why?

(A) The coding efficiency is the same as for scalar quantization
(B) The computational complexity, in particular for the encoding, is much higher than in scalar
quantization and a large codebook needs to be stored
(C) It requires block Huffman coding of quantization indexes, which is very complex
Answer
Correct option is B
3. Let N represent the dimension of a vector quantizer. What statement about the performance of the
best vector quantizer with dimension N is correct?
(A) For N approaching infinity, the quantizer performance asymptotically approaches the rate-
distortion function (theoretical limit)
(B) By doubling the dimension N, the bit rate for the same distortion is halved
(C) The vector quantizer performance is independent of N
Answer
Correct option is A
4. Which of the following is/are correct for advantage of vector quantization over scalar quantization
(A) Vector Quantization can lower the average distortion with the number of reconstruction levels
held constant
(B) Vector Quantization can reduce the number of reconstruction levels when distortion is held
constant
(C) Vector Quantization is also more effective than Scalar Quantization When the source output
values are not correlated
Answer
Correct option is D
5. Vector quantization is used for

(A) Lossy data compression
(B) Lossy data correction
(C) Pattern recognition
Answer
Correct option is D
6. The Linde–Buzo–Gray algorithm is a ______ quantization algorithm to derive a good codebook.

(A) Scalar
(B) Vector
(C) Both
Answer

Correct option is B
7. Vector quantization is used in

(A) Video coding
(B) Audio coding
(C) Speech coding
Answer
Correct option is C
8. What are process(Techniques) used in video coding?

(A) Partition of frames into macro blocks
(B) Form of Vector Quantization
(C) Both (A) & (B)
(D) None of these
Answer
Correct option is C
9. The process of converting the analog sample into discrete form is called
(A) Modulation
(B) Multiplexing
(C) Quantization
(D) Sampling
Answer
Correct option is C
10 . he sequence of operations in which PCM is done is

(A) Sampling, quantizing, encoding
(B) Quantizing, encoding, sampling
(C) Quantizing, sampling, encoding
Answer
Correct option is A
11. To convert a continuous sensed data into Digital form, which of the following is required?
(A) Sampling
(B) Quantization
(C) Both Sampling and Quantization
(D) Neither Sampling nor Quantization
Answer
Correct option is C
12. For a continuous image f(x, y), Quantization is defined as

(A) Digitizing the coordinate values
(B) Digitizing the amplitude values
(C) All of the mentioned
Answer
Correct option is B
13. The resulting image of sampling and quantization is considered a matrix of real numbers.

By what name(s) the element of this matrix array is called

(A) Image element or Picture element
(B) Pixel or Pel
(C) All of the mentioned
Answer
Correct option is C
14. Which conveys more information?
(A) High probability event
(B) Low probability event
(C) High & Low probability event
Answer
Correct option is B
15. The probability density function of the envelope of narrow band noise is
(A) Uniform
(B) Gaussian
(C) Rayleigh
(D) Rician
Answer
Correct option is B
16. Which model is known as ignorance model?
(A) Physical model
(B) Markov model
(C) Probability model
(D) Composite Source Model
Answer
Correct option is C
17. Shannons theorem is also called
(A) noiseless coding theorem
(B) noisy coding theorem
(C) coding theorem
(D) noiseless theorem
Answer
Correct option is A
18. Transform coding, vector quantization are examples for______
(A) Pixel
(B) compression
(C) Transmission
(D) Lossy compression
Answer

Correct option is D
19. Entropy Coding is an ________
(A) Lossless
(B) Lossy
(C) 0
(D) None
Answer
Correct option is A
20. ______ is normally used for the data generated by scanning the documents,
fax machine, typewriters etc.
(A) Huffman Coding
(B) Transformation Coding
(C) Vector Quantization
(D) Runlength Encoding
Answer
Correct option is D
21. Compression Technique used in Image Video is
(A) Huffman Coding
(B) Transformation Coding
(C) Entropy Coding
(D) Differential Encoding
Answer
Correct option is B
22. Compression Technique used in Audio is
(A) Differential Encoding
(B) Transformation Encoding
(C) Entropy Coding
(D) Differential & Transformation Encoding
Answer
Correct option is D
23. Expansion of LZ Coding is
(A) Lossy
(B) Lossless
(C) Lempel-ziv-welsh
(D) Lempel-ziv
Answer
Correct option is D
24. Expansion of LZW Coding is

(A) Lossy
(B) Lossless

(C) Lempel-ziv
(D) Lempel-ziv-welsh
Answer
Correct option is D

Practice Question
(Option In bold font is Answer )
a) To convert one file to another
b) To reduce the size of data to save space
c) To minimise the time taken for a file to be download
d) To compress something by pressing it hard
2. What does Lossy Compression do to files?

a) Increases the file size and keeps the same quality
b) Eliminates no information at all
c) Decreases the file size and keeps the same quality
d) Eliminates unnecessary information in a file to reduce file size
3. What is Lossless Compression?

a) No information is lost but file size is increased
b) There is no loss of information at all after compression
c) Files which have the exact same data after compression
d) Compression involves an algorithm
4. What type of compression would you use to compress a video?

a) Lossy
b) Lossless
5. When Lossy compression is used data is lost?

a) True
b) False

a) JPEG
b) MPEG
c) Bitmap
d) MP3
7. Uncompressed audio and video files require less memory thancompressed files....
a) True
b) False
8. What would you use compression for?

a) Making an image file smaller
b) Modifying an image

a) Images
b) Sounds
c) Videos
d) Text
10. Compression in general makes it to send, upload and stream data

a) Quicker
b) Slower
11. Lossless compression permanently deletes the data

a) True
b) False
12. Lossy compression would be suitable for text files

a) True
b) False
13. Compression looks for _ data

a) Unnecessary
b) Repeated
14. How many bits make up one byte?

a) 4
b) 16
c) 8
d) 10
a) Lossless compression throws away unimportant details that a human being will
likely be unable to detect.
b) Lossy compression is only possible on files that are at least one gigabyte in size before
compression.
c) Lossy compression techniques are no longer commonly used.
d) Lossless compression is fully reversible, meaning the original file can be recreated bit
for bit.
a) Both lossy and lossless compression techniques will result in some information
being lost from the original file.
b) Neither lossy nor lossless compression can actually reduce the number of bits needed to
represent a file.
c) Lossless compression is only used in situations where lossy compression techniques can't
be used.
d) Lossy compression is best suited for situations where some loss of detail is
tolerable, especially if it will not be detectable by a human.
17. data compression algorithm that allows the original data to be perfectly reconstructed
from the compressed data.
a) lossy compression
b) lossless compression

18. Compression looks for _ data

a) Unnecessary
b) Repeated
19. The codec from Google provides modest compression ratios.

a) Snapcheck
b) Snappy
c) FileCompress
d) None of the mentioned
20. Point out the correct statement.

a) Snappy is licensed under the GNU Public License (GPL)
b) BgCIK needs to create an index when it compresses a file
c) The Snappy codec is integrated into Hadoop Common, a set of common utilities that
supports other Hadoop subprojects
21. Which of the following compression is similar to Snappy compression?

a) LZO
b) Bzip2
c) Gzip
d) All of the mentioned
22. Which of the following supports splittable compression?

a) LZO
b) Bzip2
c) Gzip
23. Point out the wrong statement.

a) From a usability standpoint, LZO and Gzip are similar
b) Bzip2 generates a better compression ratio than does Gzip, but it’s much slower
c) Gzip is a compression utility that was adopted by the GNU project
24. Which of the following is the slowest compression technique?

a) LZO
b) Bzip2
c) Gzip
25. Gzip (short for GNU zip) generates compressed files that have a _ extension.
a) .gzip
b) .gz
c) .gzp
d) .g

26. Which of the following is based on the DEFLATE algorithm?

a) LZO
b) Bzip2
c) Gzip
27. typically compresses files to within 10% to 15% of the best available
techniques.
a) LZO
b) Bzip2
c) Gzip
28. The LZO compression format is composed of approximately _ blocks of compress

a) 128k
b) 256k
c) 24k
d) 36k
29. Digitizing the image intensity amplitude is called

A. sampling
B. quantization
C. framing
D. Both A and B
30. Compressed image can be recovered back by
A. image enhancement
B. image decompression
C. image contrast
D. image equalization
31. Which of the following algorithms is the best approach for solving Huffman codes?
a) exhaustive search
b) greedy algorithm
c) brute force algorithm
d) divide and conquer algorithm
32. The type of encoding where no character code is the prefix of another character code
is called?
a) optimal encoding
b) prefix encoding
c) frequency encoding
d) trie encoding
33. What is the running time of the Huffman encoding algorithm?

a) O(C)
b) O(log C)
c) O(C log C)

d) O( N log C)
34. What is the running time of the Huffman algorithm, if its implementation of the priority queue
is done using linked lists?
a) O(C)
b) O(log C)
c) O(C log C)
d) O(C2)
35. Run Length Encoding is used for

a) Reducing the repeated string of characters
b) Bit error correction
c) Correction of error in multiple bits
d) All of the above
36. While recovering signal, which gets attenuated more?

a) Low frequency component
b) High frequency component
c) Low & High frequency component
37. Mutual information should be

a) Positive
b) Negative
c) Positive & Negative
38. ASCII code is a

a) Fixed length code
b) Variable length code
c) Fixed & Variable length code
39. Which reduces the size of the data?

a) Source coding
b) Channel coding
c) Source & Channel coding
40. In digital image coding which image must be smaller in size?

a) Input image
b) Output image
c) Input & Output image
41. Which coding method uses entropy coding?
a) Lossless coding
b) Lossy coding

c) Lossless & Lossy coding

42. Which achieves greater compression?

a) Lossless coding
b) Lossy coding
c) Lossless & Lossy coding
43. A code is a mapping from

a) Binary sequence to dicrete set of symbols
b) Discrete set of symbols to binary sequence
c) All of the mentioned
44. Which are uniquely decodable codes?

a) Fixed length codes
b) Variable length codes
c) Fixed & Variable length codes
45. A rate distortion function is a

a) Concave function
b) Convex function
c) Increasing function
46. Self-information should be

a) Positive
b) Negative
47. The unit of average mutual information is

a) Bits
b) Bytes
c) Bits per symbol
d) Bytes per symbol
48. When probability of error during transmission is 0.5, it indicates that
a) Channel is very noisy
b) No information is received
c) Channel is very noisy & No information is received
49. Binary Huffman coding is a

a) Prefix condition code
b) Suffix condition code

c) Prefix & Suffix condition code

50. The event with minimum probability has least number of bits.
a) True
b) False
51. The method of converting a word to stream of bits is called as

a) Binary coding
b) Source coding
c) Bit coding
d) Cipher coding
52. When the base of the logarithm is 2, then the unit of measure of information is
a) Bits
b) Bytes
c) Nats
53. When X and Y are statistically independent, then I (x,y) is

a) 1
b) 0
c) Ln 2
d) Cannot be determined
54. The self information of random variable is
a) 0
b) 1
c) Infinite
55. Entropy of a random variable is

a) 0
b) 1
c) Infinite
56. Which is more efficient method?

a) Encoding each symbol of a block
b) Encoding block of symbols
c) Encoding each symbol of a block & Encoding block of symbols
57. Lempel-Ziv algorithm is

a) Variable to fixed length algorithm
b) Fixed to variable length algorithm
c) Fixed to fixed length algorithm
d) Variable to variable length algorithm

58. Coded system are inherently capable of better transmission efficiency than the uncoded
system.
a) True
b) False
59. The prefix code is also known as

a. Instantaneous code
b. Block code
c. Convolutional code
d. Parity bit
60. Down sampling is to make a digital image file smaller by

a) adding pixels
b) removing noise
c) removing pixels
d) adding noise
61. How many printable characters does the ASCII character set consists of? a) 120
b) 128
c) 100
d) 98

a) first
b) seventh
c) eighth
d) tenth
63. How many bits are needed for standard encoding if the size of the character set is
X?
a) log X
b) X+1
c) 2X
d) X2
64. The code length does not depend on the frequency of occurrence of characters.
a) true
b) false
65. In Huffman coding, data in a tree always occur?

a) roots
b) leaves
c) left sub trees
d) right sub trees
66. What are the types of quantization error?

a. Granular error
b. Slope over load error
c. Both a & b
d. None of the above
67. What are the types of quantizer?

a. Midrise quantizer
b. Midtread quantizer
c. Both a & b
68. What are the types of adaptive quantization?

a. forward adaptive quantization
b. backward adaptive quantization
c. Both a & b
69. Which is a quantization process?

a) Rounding
b) Truncation
c) Rounding & Truncation
70. Quantization is a process.

a) Few to few mapping
b) Few to many mapping
c) Many to few mapping
d) Many to many mapping
71. Quantization is a process.

a) Non linear
b) Reversible
c) Non linear & Reversible
72. Which conveys more information?

a) High probability event
b) Low probability event
c) High & Low probability event
73. What is the type of quantizer, if a Zero is assigned a quantization level?

a) Midrise type
b) Mid tread type
c) Mistreat type

74. What is the type of quantizer, if a Zero is assigned a decision level?

a) Midrise type
b) Mid tread type
c) Mistreat type
75. If the input analog signal is within the range of the quantizer, the quantization error eq
(n) is bounded in magnitude i.e., |eq (n)| < Δ/2 and the resulting error is called?
a) Granular noise
b) Overload noise
c) Particulate noise
d) Heavy noise
76. If the input analog signal falls outside the range of the quantizer (clipping), eq (n) becomes
unbounded and results in _
a) Granular noise
b) Overload noise
c) Particulate noise
d) Heavy noise
77. In the mathematical model for the quantization error eq (n), to carry out the analysis, what
are the assumptions made about the statistical properties of eq (n)?
i. The error eq (n) is uniformly distributed over the range — Δ/2 < eq (n) < Δ/2.
ii. The error sequence is a stationary white noise sequence. In other words, the error eq (m) and
the error eq (n) for m≠n are uncorrelated.
iii. The error sequence {eq (n)} is uncorrelated with the signal sequence x(n).
iv. The signal sequence x(n) is zero mean and stationary.
a) i, ii & iii
b) i, ii, iii, iv
c) i, iii
d) ii, iii, iv
78. What is the abbreviation of SQNR?

a) Signal-to-Quantization Net Ratio
b) Signal-to-Quantization Noise Ratio
c) Signal-to-Quantization Noise Region
d) Signal-to-Quantization Net Region
79. What is the scale used for the measurement of SQNR?

a) DB
b) db
c) dB
80. What is the expression for SQNR which can be expressed in a logarithmic scale?
a) 10 log10(Px/Pn)

b) 10 log10(Pn/Px)
c) 10 log2(Px/Pn)
d) 2 log2(Px/Pn)
81. In the equation SQNR = 10 log10(Px/Pn). what are the terms Px and Pn are called
respectively.
a) Power of the Quantization noise and Signal power
b) Signal power and power of the quantization noise
c) None of the mentioned
82. In the equation SQNR = 10log10(Px/Pn), what are the expressions of Px and Pn?
a) Px=σ2=E[x2(n)] and Pn=σ2 =E[e2q(n)]
b) Px=σ2=E[x2(n)] and Pn= σ2 =E[e3q(n)]
c) Px=σ2=E[x3(n)] and Pn= σ2 =E[e2q(n)]
83. If the quantization error is uniformly distributed in the range (-Δ/2, Δ/2), the mean value
of the error is zero then the variance Pn is?
a) Pn= σ2 =Δ2/12
b) Pn= σ2 =Δ2/6
c) Pn= σ2 =Δ2/4
d) Pn= σ2 =Δ2/2
84. By combining Δ=R2b+1 with Pn=σ2e=Δ2/12 and substituting the result into SQNR = 10
log10PxPn, what is the final expression for SQNR = ?
a) 6.02b + 16.81 + 20log10(R/σx)
b) 6.02b + 16.81 – 20log10(R/σx)
c) 6.02b – 16.81 – 20log10(R/σx)
d) 6.02b – 16.81 – 20log10(R/σx)
85. In the equation SQNR = 6.02b + 16.81 – 20log10(R/σx), for R = 6σx the equation
becomes?
a) SQNR = 6.02b-1.25 dB
b) SQNR = 6.87b-1.55 dB
c) SQNR = 6.02b+1.25 dB
d) SQNR = 6.87b+1.25 dB
86. What characterizes a quantizer?

a. The output of a quantizer has the same entropy rate as the input.
b. Quantization results in a non-reversible loss of information.
c. A quantizer always produces uncorrelated output samples.
87. What property has the output signal of a scalar quantizer?

a. The output is a discrete signal with a countable symbol alphabet (but not necessarily a
finite symbol alphabet).

b. The output is a discrete signal with a finite symbol alphabet.

c. The output signal may be discrete or continuous.
88. What is a Lloyd quantizer?

a. A Lloyd quantizer is the scalar quantizer that yields the minimum distortion for a
given source and a given number of quantization intervals.
b. The output of a Lloyd quantizer is a discrete signal with a uniform pmf.
c. For a given source, the Lloyd quantizer is the best possible scalar quantizer in ratedistortion
sense. That means, there does not exist any other scalar quantizer that yields a smaller
distortion at the same rate.
89. A Lloyd quantizer can be considered as optimal quantizer for fixed-length coding of the
quantization indices. Can we improve a Lloyd quantizer by using variable length codes?
a. No, variable length coding does not improve the quantizer performance, since all quantization
indices have the same probability.
b. No, variable length coding does not improve the quantizer performance, since the quantizer
output is uncorrelated.
c. Yes, in general, the quantizer performance can be improved by variable length coding
(there are some exceptions for special sources).
90. What characterizes an entropy-constrained Lloyd quantizer?

a. An entropy-constrained Lloyd quantizer is the scalar quantizer that yields the best
ratedistortion performance for a given operation point (assuming that the quantization
indices are coded using optimalentropy coding).
b. An entropy-constrained Lloyd quantizer minimizes the entropy rate of the quantizer output
for a given number of quantization intervals.
c. An entropy-constrained Lloyd quantizer minimizes the number of quantization
intervals for a given distortion.
91. What characterizes the best possible scalar quantizer with variable length coding at high
rates (for MSE distortion)?
a. All quantization intervals have the same probability.
b. All quantization intervals have the same size.
c. None of the above statements is correct.
92. Which statement is true regarding the performance of optimal scalar quantizers with
variable length coding at high rates for iid sources?
a. For iid sources, the operational distortion-rate curve for optimal scalar quantization is always
equal to the distortion-rate function (theoretical limit).
b. Only for Gaussian iid sources, the operational distortion-rate curve for optimal scalar
quantization is equal to the distortion-rate function (theoretical limit)
c. For iid sources, the operational distortion-rate curve for optimal scalar quantization is
1.53 dB worse than the distortion-rate function (theoretical limit).
93. What characterizes a vector quantizer?

a. Multiple input symbols are represented by one quantization index.

b. Multiple quantization indexes are represented by one codeword.

c. Each input symbol is represented by a fixed-length codeword.
94. What statement is correct for comparing scalar quantization and vector quantization?
a. By vector quantization we can always improve the rate-distortion performance
relative to the best scalar quantizer.
b. Vector quantization improves the performance only for sources with memory. For iid sources,
the best scalar quantizer has the same efficiency as the best vector quantizer.
c. Vector quantization does not improve the rate-distortion performance relative to scalar
quantization, but it has a lower complexity.
95. Why is vector quantization rarely used in practical applications?

a. The coding efficiency is the same as for scalar quantization.
b. It requires block Huffman coding of quantization indexes, which is very complex.
c. The computational complexity, in particular for the encoding, is much higher than in
scalar quantization and a large codebook needs to be stored.
96. Assume we have a source with memory and apply scalar quantization and scalar Huffman
coding? Can the performance, in general, be improved by replacing the scalar Huffman coding by
conditional Huffman coding or block Huffman coding?
a. Yes, the performance can in general be improved, since there will be also dependencies
between successive quantization indexes.
b. No, the performance cannot be improved, since the quantization removes all dependencies
between the source symbols.
c. No, the performance cannot be improved, since the quantization error and the input signal are
uncorrelated.
97. Uniform quantizer is also known as
a) Low rise type
b) Mid rise type
c) High rise type
98. The SNR value can be increased by the number of levels.

a) Increasing
b) Decreasing
c) Does not depend on
99. Prediction gain for better prediction.

a) Increases
b) Decreases
c) Remains same
100. Delta modulation is

a) 1 bit DPCM

b) 2 bit DPCM
c) 4 bit DPCM
101. 1 bit quantizer is a

a) Hard limiter
b) Two level comparator
c) Hard limiter & Two level comparator
102. If step size is increased occurs.

a) Slope overload distortion
b) Granular noise
c) Slope overload distortion & Granular noise
103. Which helps in maintaining the step size?

a) Delta modulation
b) PCM
c) DPCM
d) Adaptive delta modulation
104. The low pass filter at the output end of delta modulator depends on
a) Step size
b) Quantization noise
c) Bandwidth
105. In early late timing error detection method if the bit is constant, then the slope will be
a) Close to zero
b) Close to infinity
c) Close to origin
106. The theoretical gain in zero crossing TED is greater than early late TED.
a) True
b) False
107. Non uniform quantizer distortion.

a) Increases
b) Decreases
c) Does not effect

a) Audio coding
b) Video coding

c) Speech coding
109. The spectral density of white noise is

a) Exponential
b) Uniform
c) Poisson
d) Gaussian
110. The probability density function of the envelope of narrow band noise is
a) Uniform
b) Gaussian
c) Rayleigh
d) Rician
111. The type of noise that interferes much with high frequency transmission is
a) White
b) Flicker
c) Transit time
d) Shot
112. Thermal noise power of a resistor depends upon

a) Its resistance value
b) Noise temperature
c) Bandwidth
d) Ambient temperature
113. The size of the quantile interval is called as
a) Inter level
b) Step size
c) Quantile size
d) Level width
114. Uniform quantization provides better quantization for

a) Weak signals
b) Strong signals
c) Weak & Strong signals
115. Non uniform quantization provides better quantization for

a) Weak signals
b) Coarse signals
c) Weak & Coarse signals
116. In non uniform quantization, the quantization noise is _ to signal

size.

a) Inversely proportional
b) Directly proportional
c) Equal
d) Double
117. The output SNR can be made independent of input signal level by using
a) Uniform quantizer
b) Non uniform quantizer
c) Uniform & Non uniform quantizer
118. Companding is the process of

a) Compression
b) Expansion
c) Compression & Expansion
119. Which value of μ corresponds to linear amplification?
a) μ=0
b) μ=1
c) μ>0
d) μ<0
120. What is the standard value of μ in μ-law ? a) 128

b) 255
c) 256
d) 0
121. The standard value of A in A-law is

a) 87
b) 88
c) 86.7
d) 87.6
122. Which type of quantization is most preferable for audio signals for a human ear?
a) Uniform quantization
b) Non uniform quantization
c) Uniform & Non uniform quantization
123. The characteristics of compressor in μ-law companding are

a) Continuous in nature
b) Logarithmic in nature
c) Linear in nature
d) Discrete in nature
124. In Linde–Buzo–Gray algorithm, at each iteration, each vector is split into

a. two new vectors

b. three new vectors
c. four new vectors
d. eight new vectors
125. JBIG stands for
a. Joint Bi-level Image Experts Group
b. Joint Bi-level Image Export Group
c. Joint Binary Image Experts Group
126. The main features of JBIG is/are:

a. Lossless compression of one-bit-per-pixel image data
b. Ability to encode individual bitplanes of multiple-bit pixels
c. Progressive or sequential encoding of image data
d. All the above
127. Which among the following compression techniques is/are intended for still images?
a. JPEG
b. H.263
c. MPEG
d. All of the above
128. Lempel–Ziv–Welch (LZW) Algorithm is used for

a. lossless compression
b. lossy compression
129. Lempel–Ziv–Welch (LZW) Algorithm is used to compress

a. GIF
b. PDF
c. TIFF
d. All the above
130. GIF stands for

a. Graphical Interface Format
b. Graphical Interchange Format
c. Graphical Intrachange Format
d. Graphical Interlinked Fomat
131. GIF uses dictionary for compressing data.

a. StaticAdaptive/Dynamic
b. Both a & b
c. None of the above
132. JBIG2 compression is

a. lossless compression
b. lossy compression

133. LZ77 and LZ78 are the two data compression algorithms.
a. lossless
b. lossy
134. The LZ77 algorithm works on data whereas LZ78 algorithm attempts to
work on data.
a. future , past
b. past , future
c. present, future
d. past, present
135. Prediction by Partial Matching is a method to predict the next symbol depending on n
previous. This method is else called prediction by_
Model.
a. Probability
b. Physical
c. Markov
136. The Burrows–Wheeler transform (BWT, also called block-sorting compression)

is used to compress
a. float numbers
b. strings
c. real numbers
d. All the above

SHRI RAMSWAROOP MEMORIAL GROUP OF PROFESSIONAL COLLEGES
B.Tech. [SEM VIII]

OBJECTIVE TYPE QUESTION BANK-I
(Session: 2019-20)
RCS-087: DATA COMPRESSION
Unit: I Unit Name: Introduction to Data Compression

Course Outcome: CO1 Name of Faculty: Mr. Anjani Kumar
TOPIC-WISE OBJECTIVE QUESTIONS
Topic Set-1: Compression Techniques and Source Lecture(s): U1_L1 to U1_L2 Ref.: T1, R1 & D1
measure of performance
In the below mentioned questions: the statements have only G S

[A]
one correct option:
Which type of data can be compressed by using data

compression techniques?
(a) Only Text

Q1) M (d)
(b) Only Audio
(c) Only Video
(d) Text, Audio, Video all
Which type of compression techniques are used in

Data Compression?
(a) Lossless Compression

Q2) (b) Lossy Compression M (c)
(c) Lossless and Lossy both compression technique
(d) None of these
The main advantage of Data Compression is:
(a)To reduce the volume of data to be

transmitted(text, fax, images)
Q3) M (d)
(b)To reduce the bandwidth required for transmission.
(c)To reduce storage requirement(speech ,audio,
video)
(d) All of the above
The main disadvantage of Data Compression is:
Q4) (a)To reduce the volume of data to be transmitted M (b)

(text, fax, images).
(b) Compressed data must be decompressed to be
viewed (or heard)thus extra processing is required.
Page 1 of 13
(c) To reduce storage requirement(speech ,audio,
video)
(d) To reduce the bandwidth required for
transmission
Lossless compression method can compress which type

of data
(a) Text
Q5) (b) Program M (d)
(c) Audio
(d) both a and b
Lossy compression method can compress which type of

data
(a) Text
Q6) (b) Images M (d)
(c) Audio,Video
(d) both b and c
Which algorithm use the Lossless method to compress

the data
(a) JPEG
Q7) (b) MPEG M (c)
(c) HUFFMAN
(d) MP3
Which algorithm use the Lossy method to compress the

data
(a) RUN LENGTH
Q8) (b) HUFFMAN M (c)
(c) MPEG
(d) LEMPALZIV
According to the classification of methods in which

method the set of messages to the set of code words
is fixed before transmission begins.
(a) Dynamic Method M (b)
Q9)
(b) Static Method
(c) Hybrid Method
(d) None of these
According to the classification of methods in which

method the set of messages to the set of code words
changes over time.
(a) Dynamic Method M (a)
Q10)
(b) Static Method
(c) Hybrid Method
(d) None of these
What is compression?
Q11) (a) To convert one file to another M (b)
(b) To reduce the size of data to save space
Page 2 of 13
(c) To minimize the time taken for a file to be download
(d) To compress something by pressing it hard
What does Lossy Compression do to files?

(a) Increases the file size and keeps the same quality
(b) Eliminates no information at all M (d)
Q12)
(c) Decreases the file size and keeps the same quality
(d) Eliminates unnecessary information in a file to reduce file
size
Which of the following are not in a compressed format?

(a) JPEG
(b) MPEG L (c)
Q13)
(c) Bitmap
(d) MP3
Which of the following would not be suitable for Lossy
Compression?
Q14) (a) Images M (d)

(b) Sounds
(c) Videos
(d) Text
Which of the following is true of lossy and lossless compression
techniques?
(a) Lossless compression throws away unimportant details that a
human being will likely be unable to detect.
Q15) (b) Lossy compression is only possible on files that are at least H (d)
one gigabyte in size before compression.
(c) Lossy compression techniques are no longer commonly used.
(d) Lossless compression is fully reversible, meaning the original
file can be recreated bit for bit
Which of the following is true of lossy and lossless compression
techniques?
(a) Both lossy and lossless compression techniques will result

in some information being lost from the original file.
(b) Neither lossy nor lossless compression can actually reduce
the number of bits needed to represent a file.
Q16) H (d)
(c) Lossless compression is only used in situations where lossy
compression techniques can't be used.
(d) Lossy compression is best suited for situations where some
loss of detail is tolerable, especially if it will not be
detectable by a human.
Compression Ratio is
Q17) L (a)
(a)bits required before compression/bits required after compression
Page 3 of 13
(b)bits required after compression/bits required before compression
(c)bits required original data/bits required reconstruct data
(d)None of these
Compression Rate comes from the
(a) Storage compression
Q18) (b)Transmission Compression (b)

M
(c)Compression Ratio
(d)None of these
Compression Ratio comes from the
(a) Storage compression
Q19) (b)Transmission Compression M (a)
(c)Compression Rate
(d)None of these
Which compression is often used for image or audio data where
the loss of this precision can be tolerated?
(a)MPEG
Q20) M (d)
(b)MP3
(c)JPEG
(d)Both (a) and (c)
In the below mentioned questions: the statements may have

more than one correct option(s): G S
[B]
Which statement is true for data compression
(a)To reduce the volume of data to be

transmitted(text, fax, images)
(b) Compressed data must be decompressed to be viewed H (a)and(c)
Q21)
(or heard) thus extra processing is required.
(c) To reduce storage requirement(speech ,audio,
video)
(d) Data Compression is a more complex techniques.

Which compression method is based on lossless method?
(a)JPEG L (b) &(c)

Q22)
(b)Huffman
Page 4 of 13
(c)Run Length
(d)MP3
Which compression method is based on lossy method?
(a)Lempalziv
Q23) (b)MPEG L (a)&(c)
(c)Runlength
(d)JPEG
JPEG encoding is used to compress
(a) Video
Q24) (b)Picture L (b)&(d)
(c)Audio
(d)Graphics
Analytical and Numerical Problems: In the below mentioned

problem statements determine the correct solution: G S
[c]
In Lossless compression the following string can be interpreted as H 25.[9]8

Q25)
25.888888888
In Lossy compression the following string can be interpreted as H 26
Q26)
25.888888888
Suppose storing an image made up of a square array of 256*256 Compressi
pixels requires 65,536 bytes. The image is compressed and the H on
Q27)
compressed version requires 16,384 bytes then calculate the
ratio=4/1
compression ratio .
Consider the following sequence 1 2 3 2 3 4 5 4 5 6 7 8 9 8 9 10 P(6)=1/16
Q28) the calculate the Probability of 6 ,8 and 9. H ,P(8)=P(9
)=1/8
Consider the following sequence 1 2 3 2 3 4 5 4 5 6 7 8 9 8 9 10 H=3.25
Q29) H
then calculate the entropy of this source. bits
Topic Set-2: Modeling and Source Lecture(s): U1_L3 to U1_L4 Ref.: T1, R1 &
coding and a brief D1
introduction to information
theory
How to measure the performance of a compression
algorithm?
(a)Relative complexity of the algorithm.
Q1) (b)Memory required to implement the algorithm M (d)
(c)Amount of compression
(d)All of the above
The development of data compression algorithm for a
Q2) variety of data can be divided into following phases: M (d)
Page 5 of 13
(a)Modeling
(b)Coding
(c)Compression
(d)Both (a)and (b)
In which phase we extract information about any
redundancy that exists in the data and describe the
redundancy in the form of a model?
(a)Modeling phase
Q3) M (a)
(b)Coding Phase
(c)Construction phase
(d)Both (a) and (b)
In which phase we assign the binary sequences to
elements of an alphabet?
(a)Modeling phase
(b)Coding Phase M (b)
Q4)
(c)Construction phase
(d)Both (a) and (b)
Self information can be represented as

(a)i(A)=-LogbP(A)
Q5) (b)i(A)=LogbP(A) M (a)
(c)i(A)=LogeP(A)
(d)i(A)=Log10P(A)
If the proability of an event is low the amount of
self information is
(a)High
Q6) (b)low M (a)
(c)Medium
(d)None of these
If the proability of an event is high the amount of
self information is
(a)High
Q7) (b)low M (b)
(c)Medium
(d)None of these
Suppose A and B are two independent events. The self-
information associated with the occurrence of both
event A and event B is:
(a)i(AB)=-logbP(AB)
Q8) M (a)
(b) i(AB)=logbP(AB)
(c) i(AB)=logbP(A)/P(B)
(d)i(AB)=logbP(A)+logbP(B)
Page 6 of 13
Average self information associated with the
experiment is known as
(a)Self information
Q9) (b)Entropy M (b)
(c)Modeling
(d)Coding
The average self –information associated with the
random experiment is given by
(a)H=∑P(Ai)i(Ai)
Q10) (b)H=-∑P(Ai)logbP(Ai) M (d)
(c)H=∑P(Ai)+∑log2P(Ai)
(d)Both (a)and (b)
Individual member of the code is known as
(a)Alphabet
Q11) (b)Codeword M (b)
(c)model
(d)None of these
A branch of science that deals with the analysis of a
communication system is called
(a)Entropy
Q12) (b)Self information M (c)
(c)Information theory
(d)Models
If we use log base 2 then the unit of self
information is
(a)nats
Q13) (b)hartleys M (c)
(c)bits
(d)None of these
If we use log base e(loge) then the unit of self
information is
(a)nats
Q14) (b)hartleys M (a)
(c)bits
(d)None of these
If we use log base 10(log10) then the unit of self
information is
(a)nats
Q15) (b)hartleys M (b)
(c)bits
(d)None of these
Page 7 of 13
The information obtained from the occurrence of two
independent events is the ______of the information
obtained from the occurrence of the individual events
(a)Sum
Q16) M (a)
(b)Minus
(c)Multiply
(d) Divide
A code in which no codeword is a prefix to another
codeword is called
(a) Codeword
Q17) (b) Alphabet M (c)
(c)Prefix code
(d)code rate
The assignment of binary sequences to elements of an
alphabet is called
(a)Modeling
Q18) (b)Alphabet M (c)
(c)Coding
(d)None of These
The difference between the original and the
reconstruction is called the
(a)Compression Ratio
Q19) (b)Fidelity M (c)
(c)Distortion
(d)None of these
JPEG stands for
(a) Joint Picture Expert group
Q20) (b)Joint Photographer Expert group M (c)
(c)Joint Photographic Expert group
(d)None of these
In the below mentioned questions: the statements may have

[B] more than one correct option(s): G S
Which Statement is true for modeling

(a)In this phase We extract the information about ant
redundancy.
Q21) (b)It describe the redundancy in a form of a model. L (a)&(b)
(c)It assign the binary sequences to elements of an
alphabet.
Page 8 of 13
(d)The set of binary sequences are generated by
modeling phase
Which of the following is the type of data
compression model?
(a)Construction model
(b)Linear Sequencial Model L (c)&(d)
Q22)
(c)Probability Model
(d)Physical Model
Which statement is true for Linear System model

(a) It is a mathematical model of a system based on
the use of a linear operator.
(b)This model consists of two parts: AR and MA part.
Q23) H (a)&(b)
(c)This model is used for the design and analysis of
lossy compression schemes.
(d) This model is used for the design and analysis of
lossless compression schemes.
Topic Set-3: Models, Source Lecture(s): U1_L5 to U1_L7
Physical models,
Probability models, Ref.: T1, R1
Markov models, & D1
Composite Source
model and coding
Which model uses same information about the physics
of the data generation process?
(a)Markov Model
Q1) (b)Composite Source Model M (c)
(c)Physical Model
(d)Probability Model
Sampled speech can be enclosed by using this model
(a)Markov Model
(b)Composite Source Model
Q2) (c)Physical Model M (c)
(d)Probability Model
In following model the source is to assume that each

letter that is generated by the source is independent
of every other letter and each occurs with the
assigning probability in the alphabet.
Q3) (a)Physical model M (c)
(b) Markov Model
(c) Probability Model
(d) Composite Source Model
Page 9 of 13
Q4) Which model used the Lossless compression M (b)
(a)Physical model
(b) Markov Model
Which model is the composition of several sources
with only one source being active at any given time
(a)Physical model
Q5) (b) Markov Model M (d)

In which code any sequence of codewords can be
decoded in one and only one way.
(a)Composite source code
Q6) (b)Markov code H (d)
(c)Probability code
(d)Uniquely Decodable code
The unit of average length of each code is
(a)Bytes/symbol
Q7) (b)Kilo bits/symbol L (c)
(c)Bits/symbol
(d)Mega Bytes/symbol
Unique decodable code is the combination of
(a)Prefix+ suffix
Q8) (b)Postfix+ Pre suffix M (d)
(c)Postfix + dangling suffix
(d)Prefix+ dangling suffix
The average number of bits per symbol is often
called
(a)Dangling suffix of the code
Q9) (b)Prefix of the code M (d)
(c)Postfix of the code

(d)Rate of the code
The process of transforming a source symbol into a
coded message is called
(a)Modeling
10) (b)Coding M (b)
(c)Messaging
(d)None of these
[B] In the below mentioned questions: the statements may have G S

Page 10 of 13
more than one correct option(s):
We can use the physical model where

(a) Physical Model uses same information about the
physics of data generation process.
(b)It use the physics of data generation process to
11) construct a model. H (a)&(b)
(c)Each source is to assume that each letter that is
generated by the source is independent of every other
letter.
(d) The lossless compression is used
Which statements is true for Unique decodability
(a)Unique decodability from the code that is, any
given sequence of code words can be decoded in one
and only one way.
(b)In Unique decodable code we examine all pairs of
12) codewords to see if any codeword is a postfix of H (a)&(d)
another codeword.
(c)If we get the dangling suffix codeword then code
is uniquely decodable.
(d)Unique decodable code is the combination of prefix
and dangling suffix.
Which statements is true for Markov Model
(a) It uses same information about the physics of
data generation process.
(b) The lossless compression is used in this model
(c) Each source is to assume that each letter that is H (b)&(d)
13)
generated by the source is independent of every other
letter.
(d)In this model we use a specific type of Markov
process called a discrete time Markov chain.
Which statements is true for Composite Source Model

(a)This model is used where it is not easy to use a
single model to describe the source in many
applications.
(b) The lossless compression is used in this model
14) (c) Composite model is the composition of several H (a)&(c)
sources with only one source being active at any
given time.
(d) It use the physics of data generation process to
construct a model.
Which statements is true for Prefix code

15) (a)A code in which no codeword is a prefix to another L (a)&(c)
codeword is called prefix code
Page 11 of 13
(b)In a prefix code the codewords are only associated
with the internal node.
(c)If a code is a prefix code then it can check by
drawing the rooted binary tree corresponding to that
code.
(d) The lossless compression is used in this code.

[C] problem statements determine the correct solution: G S
If a=010 and b=01011 then according to unique Prefix=01

decodeable the value of prefix and dangling suffix of 0 and
16) H
b are:
dangling
suffix=11
Consider the code a1=0,a2=01,a3=10 the prove that Uniquely
17) code is uniquely decodable or not. M decodable
.
Given an alphabet A={a1,a2,a3,a4}.Find the first
order entropy in the following cases: L 2 bits
18)
P(a1)=P(a2)=P(a3)=P(a4)=1/4
Given an alphabet A={a1,a2,a3,a4}.Find the first
order entropy in the following cases: L 1.75 bits
19)
P(a1)=1/2,P(a2)=1/4,P(a3)=P(a4)=1/8
Determine whether the following codes are uniquely
decodable or not. Uniquely
20) H
decodable
{0.01,11,111}
REFERENCES:
TEXT BOOKS:
Ref. [ID] Authors Book Title Publisher/Press and Year of Publication
Edition
[T1] Khalid Sayood Introduction to Data Compression Elsevier 2006
S.K.KATARIA
[T2] Amrita Jyoti Data Compression 2011
&SONS
REFERENCE BOOKS:
Ref. [ID] Authors Book Title Publisher/Press Year of Publication
[R1] Mark Nelson, The Data Compression Book IDG Books Worldwide 1995
ONLINE/DIGITAL REFERENCES:
Ref. [ID] Source Name Source Hyperlink
Objective Questions in
[D1] https://quizizz.com/admin/quiz/5c87c23dc92ce4001ad06893/data-compression
Data Compression
…………………. X ………………….
Page 12 of 13
Page 13 of 13
Data compression unit:1
a. To convert one file to another
b. To reduce the size of data to save space
c. To minimize the time taken for a file to be
downloaded
d. To compress something by pressing it
very hard
2. Digital video is sequence of
a. A. pixels
b. B. matrix
c. C. frames
d. D. coordinates

a. A. code word
b. B. word
c. C. byte
d. D. nibble
4. If the P(E) = 1, it means event

a. does not occur
b. always occur
c. no probability
d. Normalization
5. Source of information depending on
finite no of outputs is called
a. A. markov
b. B. finite memory source
c. C. zero source
d. D. Both A and B
6. Information per source is called
a. A. sampling
b. B. quantization
c. C. entropy
d. D. normalization
7. Compression is done for saving
a. A. storage
b. B. bandwidth
c. C. money
d. D. Both A and B
8. Information ignored the human eye is the

a. A. coding redundancy
b. B. spatial redundancy
c. C. temporal redundancy
d. D. irrelevant info
9. An Image is represented by 65536 X8 bits,

and after compression it reduced to 16384
X8 bits. What
will be the compression ratio:
a. 55%
b. 65%
c. 75%
d. 85%
10. An Image is Square array of 256X256
pixel requires 65536 bytes, and after
compression it reduced to
16384 X8 bytes. What will be the
compression rate:
a. 2
b. 3
c. 4
d. 5
11. In the encoded file, which type of
changes are made in sysmbols ?
a. They are compressed
b. They are changed to a letter or symbol
c. They are represented in the graphical
form
d. No changes are made
12. An alphabet consist of the letters A, B, C
and D. The probability of occurrence is P(A)
= 0.4, P(B) =
0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman
code is
a. A = 01
B = 111
C = 110
D = 10
b. A = 0, B = 100, C = 101, D = 11
c. .A = 0, B = 111, C = 11, D = 101
d. A = 0, B = 11, C = 10, D=111
13. The basic idea behind Huffman coding is
to
a. compress data by using fewer bits to
encode fewer frequently occuring
characters
b. compress data by using fewer bits to
encode more frequently occuring
characters
c. compress data by using more bits to
encode more frequently occuring characters
d. expand data by using fewer bits to
14. Huffman coding is an encoding
algorithm used for
a. lossless data compression
b. files greater than 1 Mbit
c. broadband systems
d. lossy data compression
15. A Huffman code: A = 1, B = 000, C = 001,

D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D)
= 0.3
a. 8.0 bit
b. 2.0 bit
c. 1.9 bit
d. 2.1 bit
16. Huffman trees use the

_______________ of each character to
work out their encoding.
a. Frequency
b. Order in ASCII
c. Number value
d. Both (a) and (b)
17. Calculate the entropy for : P(A) = 0.4,

P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1
a. 1.24
b. 1.22
c. 1.28
d. 1.30
18. Average length of Extended Huffman
code is upper bounded by :
a. R
b. R+1
c. R-1
d. R+1/n
19. If the probability is not given which
method is preferable
a. Huffman
b. Non Binary Huffman
c. Adaptive Huffman
d. Extended Huffman
20. Compression method use for Integer
type data
a. Huffman
b. LZ77
c. Golomb Code
d. Adaptive Huffman
21. In Huffman encoding, both the sender
and receiver must have a copy of the code
a. Same
b. Different
c. Generate on Demand
d. Both (a) and (b)
22. In the multimedia contents, coding and
decoding is performed by a software
component known as:
a. codec
b. modec
c. sodec
d. bodec
23. In dictionary techniques for data
compaction, which approach of building
dictionary is used
for the prior knowledge of probability of the
frequently occurring patterns?
a. Static Dictionary
b. Adaptive Dictionary
c. both a and b
24. Dictionary order is sometimes used as a
synonym for:
a. Alphabetical order
b. Lexicographical order
c. Alphanumerical order
d. Both (a) and (c)
25. How many character an encoder reads
and searches the dictionary to see if this
input exists in
the dictionary.
a. 2 character
b. 1 character
c. 3 character
d. Both (a) and (b)
26. Sliding windowing technique is used in
which dictionary compression
a. LZW
b. LZ77
c. LZ78
d. Diagram coding
27. The distance of the pointer from the
look-ahead buffer is called :
a. Length
b. Offset
c. Triplet
d. Code
28. The UNIX compress command is one of
the earlier applications of
a. LZ77
b. LZ78
c. Huffman
d. LZW
29.The basic algorithm initially attempts to
use the _________context.
a. Small
b. Shortest
c. Longest
d. Zero
30.An ________is encoded and the
algorithm attempts to use the next smaller
context.
a. One length context
b. Zero context
c. Escape symbol
d. None
31.The CALIC scheme actually functions on :
a. bi-level images.
b. gray-scale images
c. RBG images
d. Both (a) and (b)
32. In facsimile transmission, a page is
scanned and converted into a sequence of
a. Binary sequence
b. Ternary sequence
c. black or white pixels
d. alphanumeric sequence
33. ___________has become quite popular
for encoding all kinds of images, both
computer-generated and “natural” images.
a. GIF
b. PNG
c. TIFF
d. JPEG
34. A static dictionary technique that is less
specific to a single application is:
a. LZ77
b. Diagram Coding
c. Initial dictionary
d. LZW
35. Earliest name of the facsimile coding
is___________.
a. Feminine
b. CALIC
c. Telephone
d. Fax
36. Window in dictionary method consists
of ___________ parts
a. 1
b. 3
c. 2
d. 4
37.At any given time, the output of an
encoder depends on ______
a. Past input
b. Present input
c. Both a and b
38.Digital video is sequence of
a. pixels
b. matrix
c. frames
d. coordinates
39.The reconstruction of a
________constructed sequence is identical
to the original sequence.
a. losslessly
b. lossy
c. Predictive
40.We can improve the amount of
_______by accepting a certain degree of
loss during the
compression process.
a. Compression
b. Decompression
c. Distortion
d. Compression ratio
41.The difference between the original and
reconstructed data, which we will refer to
as the
______in the reconstructed data.
a. Redundancy
b. Compression
c. loss
d. Distortion
42. The rate for a discrete source is simply
the______.
a. Entropy
b. Loss
c. Noise
d. Distortion
43. Popular measures of distortion is
a. Squared error measure
b. Absolute difference
c. Noise
d. Nats
44.Which file format stores multiple files in
a single Zip file ?
a. zap
b. zip
c. zop
d. zep
45.The process of representing Infinite set
of values with a much smaller set is called
a. Mapping
b. clustering
c. Quantization
d. Sampling
46. A simple quantization scheme would be
to represent each output of the source with
the ____value closest to it.
a. Codeword
b. Integer
c. Binary sequence
d. Coordinates
47. The design of the _____has a significant
impact on the amount of compression.
a. Cluster
b. Quantizer
c. Codebook
d. Both (b) and (a)
48. Quantization techniques that operate
on blocks of data are called
a. Adaptive quantization
b. Non uniform Quantization
c. Scalar Quantization
d. None of the Above
49. Set of L-dimensional blocks called the
_______of the vector quantizer.
a. Group
b. Codebook
c. Coding
d. Index
50. LBG algorithm is used to design a
_________.
a. Quantizer
b. Vector
c. Codebook
d. Index table
51. ___________ shape is used to make
codebook in structure vector quantization.
a. Square
b. Rectangle
c. Circle
d. Hexagon
52.In polar vector quantization r is called
________.
a. Quantum
b. Phase
c. Magnitude
d. None of above
53.In Tree structures vector quantization
cluster is divided in
a. 2 groups
b. 3 groups
c. Infinite groups
d. N groups
54. Run length encoding is a compression
method in which repeated ______ of a
symbol
are replaced.
a. Residual
b. Occurrence
c. Letters
d. None
55.Extended Huffman method is used due
to
a. Large alphabet
b. Skewed probability
c. Equal probability
d. Both (a) and(b)
56. Probability model is based on
a. Probability
b. Physics
c. Frequency
d. None
57.Entropy of a source is
a. Self information of the source
b. Average self information
c. Average number of bits
d. Both (a) and (b)
58. ASCII Code is a example of
a. Prefix code
b. Variable length code
c. Fixed length code
d. Alphanumeric code
59.Code {0,10,100,111} is :
a. UDC
b. Prefix code
c. Instantaneous code
d. All above
60.Code {0,01,11,111} is UDC.
a. True
b. False
UNIT: 2
Data Compression
Objective Questions
1) The techniques for reducing the storage requirement of computer files and
directory structure are known by which name ?
a) Data compression
b) Data storage place
c) Data form
d) Data transfer
2) By using data compression technique, what can be done in the data storage place
of memory and disk ?
a) increment
b) Reduction
c) Transfer
d) Repetition
3) What process is done by the data compression while encoding the data ?
a) Identifying repetition in the data
b) Reducing repetition in the data
c) Eliminating
repetition in the data
d) All of these
4) Which technique identify and eliminate less important information to conserve

space ?
a) Data compression
b) Data repetition
c) Data extension
d) Data conservation
5) In data compression technique, each word is represented by what ?

a) Digit
b) Letter
c) a or b
d) Picture
6) Where in the encoded file, one can have the data that tells which digit/letter
represents which word ?
a) Beginning b) Middle c) Ending d) None of these
7) What is the reason that in the beginning of encoded file there is data telling which
digit/letter represents which word ?
a) It is needed to convert the file in compression form
b) it is needed to convert the
file in encoded form
c) it is needed to convert the file in its original uncompressed form
d) it is needed to convert the file in graphical form
8) In the encoded file, how many time lengthy words appear ?

a) Not a single time b) One c) Infinite d) As specified
9) In the encoded file, which type of changes are made in sysmbols ?

a) They are compressed
b) They are changed to a letter or symbol
c) They are
represented in the graphical form
d) No changes are made
10) In the encoded file, which symbol is marked in the beginning ?

a) ^
b) &
c) $
d) %
11) In the encoded file, which symbol is marked in the ending ?
a) ^
b) &
c) $
d) %
12) In the encoded file, by using which process it can be transformed into original
file at any time ?
a) Straight
b) Reverse
c) Transfer
d) Compressed
13) From the following for which process ‘Archive Manager tool ‘ is used ?
a) For transferring the data of file and directory
b) For place compression on the file
and directory
c) For altering the form of file and directory
d) For data compression
on file and directory
14) From the following, which file format stores multiple files in a single Zip file ?
a) zap b) zip c) zop d) zep
15) Using gzip program an uncompressed file in the tar format is compressed in the
zip format, by providing which extension ?
a) tar
b) tar.gz
c) tar.gz
d) zip
16) Which file in java uses zip compression?

a) JAR
b) JER
c) ZAR
d) ZER
17) What is done firstly, to create a compressed and archive file into uncompressed ?
a) Left clicking a file -> Open with archive manager
b) Right clicking a file ->
open with archive manager
c) Left clicking a file -> open with Winzip
d) Right clicking a file -> open with winzip
18) Which button can be used in the Archive manager toolbar, to create a
compressed file into uncompressed ?
a) Open button b) Home button c) Extract d) Up button
19) From the following, which option shows an issue faced with multimedia
contents ?
a) Converting multimedia information coming from hardware devices into computer
data
b) converting the computer data back into audio/video streams for playing on
the hardware device
c) a and b both
d) None of these
20) To convert multimedia information coming from hardware devices into

computer data can be compared with which process ?
a) coding
b) Decoding
c) (a) and (b) both
d) None of these
21) In the multimedia contents, which process is done by a software ?

a) Conversion (coding)
b) Reverse conversion
c) (A) and (B) both
d) None of these
22) In the multimedia contents, coding and decoding is performed by a software

component known as _______.
a) codec
b) modec
c) sodec
d) bodec
23) The list of playing media file is known as ________.

a) medialist
b) playlist
c) masterlist
d) filelist
24) What is the full form of M3U ?
a) MPEG user sound reference file
b) MPEG Universal Sound reference file
c) MPEG unified sound reference file
d) MPEG URL sound reference file
25) Google maps service is provided by whom ?

a) Google corporation
b) Google incorporation
c) Google outcorporation
d) Google newcormporation
26. An alphabet consist of the letters A, B, C and D. The probability of occurrence is

P(A) = 0.4, P(B) = 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is
a. A = 01
B = 111
C = 110
D = 10
b. A = 0
B = 111
C = 110
D = 10
c. A = 0
B = 111
C = 11
D = 101
d.A = 0
B = 11
C = 10
D = 111
ANS: A = 0
B = 111
C = 110
D = 10

A. compress data by using fewer bits to encode fewer frequently occuring characters
B. compress data by using fewer bits to encode more frequently occuring
characters
C. compress data by using more bits to encode more frequently occuring characters
D. expand data by using fewer bits to encode more frequently occuring characters
A. lossless data compression
B. files greater than 1 Mbit
C. broadband systems
D. lossy data compression
29. A Huffman encoder takes a set of characters with fixed length and produces a set
of characters of
A. fixed length
B. constant length
C. random length
D. variable length
30. A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C)
= 0.2, P(D) = 0.3
A. 8.0 bit
B. 2.0 bit
C. 1.9 bit
D. 2.1 bit
A. sinus functions
B. simple basic functions
C. lines
D. square functions
32. Down sampling is to make a digital image file smaller by

A. removing pixels
B. adding noise
C. adding pixels
D. removing noise

A. 20:1
B. 2000:1
C. 2:1
D. 200:1

A. DCT
B. Wavelets
C. Dolby
D. Fourier transform
35. The two catagories of data compression methods are ________ and
______.(lossless and lossy)
36. Lossless compression preserves the ________ of the data exactly.(integrity)
37. In lossy compression, some of the data is ___ in the compression/decompression
process.(lost)
38. Run length encoding is a compression method in which repeated ______ of a
symbol are replaced.(occurance)
39. Lempel-Ziv encoding is a type of ________-based encoding.(dictionary)
40. Huffman coding uses the ______ of the characters in the file to construct a
tree.(frequency)
41. In Huffman codes for each character with the ____ frequent characters having
shorter codes than the less frequent characters.(more)
42. The dictionary in LZ encoding consists of ______ entries that refer to substrings
in the original file.(indexed)
43. In Huffman encoding, both the sender and receiver must have a copy of the ___
Code.(same)
44. JPEG is used to compress ______.(image)
45. MPEG is used to compress______.( video)
46. MPEG uses a method similar to JPEG to compress the individual _____of
video.( frames)
47. Blocking is the act of dividing the image into 8 x 8 pixel _____in order to reduce
the number of calculations.( blocks)
48. DCT changes the 64 pixel values in each _____so that the relative relationships
between pixels are kept but the redundancies are revealed.( block)
49. Quantization of the T table ______the number of bits needed for encoding.(
reduces)
50. A motion picture is a rapid flow of a set of ____where each frame is a picture.(
frames)
51. Huffman trees use the _______________ of each character to work out their
encoding.
A. Frequency
B. Order in ASCII
C. Number value
52.How do you move through a Huffman tree?
A. 0 = right 1= left
B. 1 = left 2 = right
C. 0 = left 1 = right
0 = middle 1 = back
Data Compression Objective Question
1. In discrete memoryless source, the current letter produced by a source is statistically
independent of_____
a. Past output
b. Future output
c. Both a and b
2. Which coding terminology deals with the inverse operation of assigned words of
second language corresponding to the words in the first language?
a. Enciphering
b. Deciphering
c. Codeword
d. Codebook
3. Which bitmap file format/s support/s the Run Length Encoding (RLE)?
a. TIFF
b. BMP
c. PCX
d. All of the above
4. In dictionary techniques for data compaction, which approach of building dictionary is

used for the prior knowledge of probability of the frequently occurring patterns?
c. Both a and b
5. Which type of channel does not represent any correlation between input and output
symbols?
a. Noiseless Channel
b. Lossless Channel
c. Useless Channel
d. Deterministic Channel
6. In channel coding theorem, channel capacity decides the _________permissible rate at

which error free transmission is possible.
a. Maximum
b. Minimum
c. Constant
7. If the channel is bandlimited to 6 kHz & signal to noise ratio is 16, what would be the
capacity of channel?
a. 15.15 kbps
b. 24.74 kbps
c. 30.12 kbps
d. 52.18 kbps
8. According to Shannon's second theorem, it is not feasible to transmit information over

the channel with ______error probability, although by using any coding technique.
a. small
b. large
c. stable
d. unpredictable
9. Which among the following represents the code in which codewords consists of
message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
10. Which among the following represents the code in which codewords consists of
message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
11. In a linear code, the minimum Hamming distance between any two code words is
______minimum weight of any non-zero code word.
a. Less than
b. Greater than
c. Equal to
12. Basically, Galois field consists of ______ number of elements.

a. Finite
b. Infinite
c. Both a and b
13. According to linearity property, the ________ of two code words in a cyclic code is
also a valid code word.
a. sum
b. difference
c. product
d. division
14. What is the value of leading coefficient of a monic polynomial?

a. 0.5
b. 1
c. 4
d. 16
15. While decoding the cyclic code, if the received code word is similar as transmitted
code word, then r(x) mod g(x) is equal to _________
a. Zero
b. Unity
c. Infinity
16. For designing of (4,1) cyclic repetition code, what would be the order of the generator
polynomial g(x)?
a. 1
b. 3
c. 4
d. 5
17. At any given time, the output of an encoder depends on ______
a. Past input
b. Present input
c. Both a and b
18. The partition in which the tag resides depends on the ________of the sequence being
encoded.( first symbol)
19. Dictionary order is sometimes used as a synonym for _________order.(
lexicographic)
20. The ordering of words in a dictionary is a good (maybe the original) example of
________ordering. (lexicographic)
21. Static dictionary technique is most appropriate when considerable ___________
about the source is available.( prior knowledge)
22. A static dictionary technique that is less specific to a single application
is________________. (digram coding)
23. The dictionary consists of all letters of the source _______followed by as many pairs
of letters, called digrams (alphabet)
24. The digram encoder reads a __________input and searches the dictionary to see if
this input exists in the dictionary.( two-character)
25. The approaches based on the 1977 paper are said to belong to the______ family.(
LZ77)
26. Window consists of two parts, a _________ and _________ .
27. The distance of the pointer from the look-ahead buffer is called the_______.( offset)
28. LZ77 scheme is a __________scheme.( adaptive)
29. In LZ78 inputs are coded as a __________.(double)
30. best-known applications of LZW:_____, and_______.( GIF ,V.42 bis)
31. The UNIX compress command is one of the earlier applications of_______.( LZW)
32. ___________has become quite popular for encoding all kinds of images, both
computer-generated and “natural” images. (GIF)
33. The best-known context-based algorithm is the ____algorithm,(PPM)
34. The basic algorithm initially attempts to use the _________context.( largest)
35. An ________is encoded and the algorithm attempts to use the next smaller
context.( escape symbol)
36. The CALIC scheme actually functions in two modes, one for _________and another
for bi-level images.( gray-scale images)
37. In facsimile transmission, a page is scanned and converted into a sequence
of___________. (black or white pixels)
38. One that is not a type of data redundancy is
A. coding
B. spatial
C. temporal
D. facsimile
Answer D
49. The dictionary in LZ encoding consists of ______ entries that refer to substrings
in the original file.(indexed)
40. Lempel-Ziv encoding is a type of ________-based encoding.(dictionary)
41. Run length encoding is a compression method in which repeated ______ of a symbol
are replaced.(occurance)
Data Compression
1. Digitizing the image intensity amplitude is called
A. sampling
B. quantization
C. framing
D. Both A and B
A. pixels
B. matrix
C. frames
D. coordinates
3. Image compression comprised of
A. encoder
B. decoder
C. frames
D. Both A and B
4. Digitizing the coordinates of the image is called
A. sampling
B. quantization
C. framing
D. Both A and B
5. Standard rate of showing frames in a video per second are
A. 10
B. 20
C. 25
D. 30
Answer D
6. Reducing the data required referred to
B. image compression
C. image contrast
Answer B
A. coding
B. spatial
C. temporal
D. facsimile
Answer D
8. Redundancy of the data can be found using formula
A. 1-(1/c)
B. 1+(1/c)
C. 1-(-1/c)
D. (1/c)
9. Transforming the difference between adjacent pixels is called
A. mapping
C. image watermarking

A. noiseless coding theorem
B. noisy coding theorem
C. coding theorem
D. noiseless theorem
Answer A
11. A codec is capable of

A. encoding
B. decoding
C. framing
D. Both A and B
Answer D
12. Encoder is used for
C. image decompression
13. The reconstruction of a ________constructed sequence is identical to the original sequence.(
losslessly)
14. The limited amount of compression available from using _______schemes may be acceptable in
several circumstances.( lossless compression)
15. The storage or __________resources available to us may be sufficient to handle our data
requirements after lossless compression.( transmission)
16. We can improve the amount of _______by accepting a certain degree
of loss during the compression process.( compression)
17. The difference between the original and reconstructed data, which we will refer
to as the ______in the reconstructed data.( distortion)
18. The rate for a discrete source is simply the______.( entropy)
19. The channel block represents all transformations the _______representation undergoes before
the
source is reconstructed.( compressed)
20. Two popular measures of ______or difference between the original and reconstructed
sequences are the squared error measure and the absolute difference measure.( distortion)
21. A number of average measures are used to summarize the _____in the difference sequence.(
information)
22. From the following, which file format stores multiple files in a single Zip file ?
a) zap
b) zip
c) zop
d) zep
23. Using gzip program an uncompressed file in the tar format is compressed in the zip format, by
providing which extension ?
a) tar
b) tar.gz
c) tar.gz
d) zip
24. Which file in java uses zip compression?

a) JAR
b) JER
c) ZAR
d) ZER
25. What is done firstly, to create a compressed and archive file into uncompressed ?
b) Right clicking a file -> open with archive
manager
26. Which button can be used in the Archive manager toolbar, to create a compressed file into
uncompressed ?
a) Open button
b) Home button
c) Extract
d) Up button
27. From the following, which option shows an issue faced with multimedia contents ?
a) Converting multimedia information coming from hardware devices into computer data
b) converting
the computer data back into audio/video streams for playing on the hardware device
c) a and b both
d) None of these
28. To convert multimedia information coming from hardware devices into computer data can be
compared with which process ?
a) coding
b) b) Decoding
c) c) (a) and (b) both
d) d) None of these
29. In the multimedia contents, which process is done by a software?

c) (A) and (B) both
d) None of these
30. In the multimedia contents, coding and decoding is performed by a software component known
as
_______.
a) codec
b) modec
c) sodec
d) bodec
31. The list of playing media file is known as ________.

a) medialist
b) playlist
c) masterlist
d) filelist
32. What is the full form of M3U ?

33. Google maps service is provided by whom ?

a) Google corporation
b) Google incorporation
c) Google outcorporation
d) Google new corporation
34. The process of representing a largepossibly______set of values with a much smaller set is
called quantization.( infinite)
35. A simple quantization scheme would be to represent each output of the source with the
____value closest to it.( integer)
36. The set of inputs and outputs of a quantizer can be _____or vectors.( scalars)
37. the design of the _____has a significant impact on the amount of compression.( quantizer)
38. The simplest type of quantizer is the__________.( uniform quantizer)
39. All intervals are the same size in the _______quantizer.( uniform)
40. A quantizer that has nonuniform intervals is called a _____quantizer.( nonuniform)
41. Quantization of the T table ______the number of bits needed for encoding.( reduces)
UNIT : 5
Data Compression Objective Question

2. Several quantization techniques that operate on blocks of data are described. We can view these
blocks as______.( vectors)
3. A set of L-dimensional vectors called the _______of the vector quantizer.( codebook)
4. In vector quantization we group the source output into _____or vectors.( blocks)
5. Our intent here is to provide you with enough information so that you can write your own
programs for design of vector___________.( quantizer codebooks)
6. The set of quantizer output points is called the _______of the quantizer.( codebook)
7. LBG algorithm is used to design a _________. (codebook)
8. Imaging system produces

A. high resolution image
B. voltage signal
C. digitized image
D. analog signal
9. Digitizing the coordinate values is called

A. radiance
B. illuminance
C. sampling
D. quantization
Answer C
10. Black and white images have only
A. 2 levels
B. 3 levels
C. 4 levels
D. 5 levels
Answer A
A. 1-(1/c)
B. 1+(1/c)
C. 1-(-1/c)
D. (1/c)

A. mapping

C. coding theorem
Answer A

A. encoding
B. decoding
C. framing
D. Both A and B
Answer D
16. 1024 x 1024 image has resolution of

A. 1048576
B. 1148576
C. 1248576
D. 1348576
Answer C
17. Digital images are displayed as a discrete set if
A. values
B. numbers
C. frequencies
D. intensities
Answer D
18. In MxN, M is no of
A. intensity levels
B. colors
C. rows
D. columns
Answer C
19. Each element of the matrix is called

A. dots
B. coordinate
C. pixels
D. value
Answer C
20. Imaging system produces

A. high resolution image
B. voltage signal
C. digitized image
D. analog signal
Answer C
21. Digitizing the coordinate values is called

A. radiance
B. illuminance
C. sampling
D. quantization
Answer C
22. Reducing the data required referred to

C. image contrast
Answer B
A. coding
B. spatial
C. temporal
D. facsimile
Answer D
A. 1-(1/c)
B. 1+(1/c)
C. 1-(-1/c)
D. (1/c)

A. mapping

C. coding theorem
Answer A

A. encoding
B. decoding
C. framing
D. Both A and B
Answer D
28. ___________ shape is used to make codebook in structure vector quantization.(Hexagon)

29 .In polar vector quantization r is called ________. (magnitude)
B.Tech. [SEM VIII]

OBJECTIVE TYPE QUESTION BANK-III
(Session: 2019-20)
Unit: III Unit Name: IMAGE AND TEXT CODING AND

COMPRESSION
Topic Set-1: Coding a sequence, Generating a binary code, Source Lecture(s): U3_L1 to U3_L3 Ref.: T2, R1 & D1
Comparison of Binary and Huffmancoding, Applications:
Bi-level image compression-The JBIG standard, JBIG2
In the below mentioned questions: the statements have only one G S

[A]
correct option:
In generating a binary code for Tx(x) can be obtained by

taking the binary representation of this number and
truncating it to
Q1) (a) (|log1/P(x)|+1) bits M (a)

(b) (|log P(x)|+1) bits
(c) (|log1/P(x)|+1) bytes
(d) (|log P(x)|+1) Kilo bytes
The main advantages of arithmetic code are
(a) More Flexible

Q2) (b) More Optimal M (d)
(c) Conjunction with models that can provide a sequence
of event probabilities i.e. adaptive model
(d) All (a),(b)and (c)
The main disadvantages of arithmetic code are

(a)Slow Processing
Q3) (b)Does not provide a prefix code M (d)
(c)Poor error resistance
In which coding adaptive table is used for the whole

coding process?
(a)Huffman Coding
Q4) M (b)
(b)Arithmetic Coding
(c)Run Length Encoding
(d)Unary coding
Page 1 of 11
Which coding generates the high compression ratio
(a)Huffman Coding
Q5) (b)Arithmetic Coding M (b)
(c)Run Length Encoding
(d)Unary coding
The short form of JBIG is

(a) Junior Bi –level image expectation group
(b) Joint Bi –level image experts group
Q6) M (b)
(c) Joint Big –level image experts group
(d) Joint By image experts group
Arithmetic coding is used in a variety of

(a) Lossless Compression
(b) Adaptive Huffman Coding
Q7) M (d)
(c) Lossy Compression
(d) Both (a) and (c)
The main job of JBIG is

(a) Compatible Progressive
(b) Sequential Coding M (d)
Q8)
(c) Lossless image compression standard
(d) All of the Above
The two methods available in generic coding are
(a)MMR(Group 4)
Q9) (b)MMA(Group 5) M (d)
(c)MQ Arithmetic coding
(d)Both (a) and (c)
JBIG2 sports have the following basic coding modes

(a) Generic
(b) Halftone M (d)
Q10)
(c) Text
Which is a group of experts that is producing standards for bi-level

image coding?
(a) Huffman coding
Q11) (b) JBIG M (b)
(c) Arithmetic coding
(d) Rice coding
Which of the following coding assigns codes to particular sequences of

length m without having to generate cords for all sequences of length m?
(a) Arithmetic coding
Q12) M (a)
(b) Huffman coding
(c) Adaptive Huffman coding
(d) Minimum variance Huffman coding
Page 2 of 11
The code table modification information need not be transmitted to the
(a) Sender
(b) Receiver M (b)
Q13)
(c) Encoder
(d) Decoder
Which is a computer image in which each pixel is represented by only
one bit , which can be either on or off.
Q14) (a) Unary –level image M (c)

(b)Tri-level image
(c)Bi-level image
(d)Binary – level image
Regions which are neither text nor halftones are typically compressed
using a context –dependent arithmetic coding algorithm called
(a)QR Coder
Q15) M (c)
(b)MR Coder
(c)QM Coder
(d)RM Coder
In the below mentioned questions: the statements may have more

than one correct option(s): G S
[B]
The two major difficulties of Arithmetic Coding are
(a)The shrinking current interval requires use of high

Precision arithmetic.
(b) In an optimum code, the two symbols that occur least
Q16) frequently will have the same length. H (a)and(c)
(c) No output is produced until the entire message has
Been encoded.
(d) In an optimum code, the two symbols that occur highest
frequently will have the same length.
The two phases of Arithmetic Coding are
(a)A unique identifier or tag is generated for a given sequence of

symbols.
Q17) L (a) &(d)
(b) The variance of the length of the codeword is significantly different.
(c)The shorting procedure is slightly different.
(d) The generated tag is given a unique binary code.

Which statements are true for Halftone coding
Q18) L (a)&(c)
(a)A halftone is coded as multi –level image, along with a pattern and
Page 3 of 11
grid parameter.
(b)The encoder constructs the halftone from the multi-level image and
the pattern.
(c)The multilevel image is coded as bi-level bit planes, with a generic

coder.
(d)None of these.
Arithmetic coding is useful for sources with
(a)Small Alphabets
Q19) (b) Large Alphabets M (a)&(c)
(c)Alphabets with highly skewed probabilities
(d) Alphabets with low skewed probabilities

[c]
Given the probability model in the following given table , Find the real
value tag for first letter A1 of the given sequence A1A1A3A2A3A1.
Letter Probability
Q20) H 0.1
A1 0.2
A2 0.3
A3 0.5
value tag for second letter A1 of the given sequence A1A1A3A2A3A1.
Letter Probability
Q21) H 0.02
A1 0.2
A2 0.3
A3 0.5
value tag for third letter A3 of the given sequence A1A1A3A2A3A1.
Letter Probability
Q22) A1 0.2 H 0.03
A2 0.3
A3 0.5
value tag for fourth letter A2 of the given sequence A1A1A3A2A3A1.
Letter Probability
Q23) H 0.027
A1 0.2
A2 0.3
A3 0.5
value tag for fifth letter A3 of the given sequence A1A1A3A2A3A1.
Q24) Letter Probability H 0.0285
A1 0.2
A2 0.3
Page 4 of 11
A3 0.5
Topic Set-2: Image Source Lecture(s): U3_L4 to U3_L8 Ref.: T2, R1 & D1
compression.
Dictionary
Techniques:
Introduction,
Static Dictionary:
Diagram Coding,
Adaptive
Dictionary, The LZ77
Approach, The LZ78
Approach ,
Applications: File
Compression-UNIX
compress, Image
Compression: The
Graphics Interchange
Format (GIF)
Compression over
Modems: V.42 bits
The dictionary consists of all letters of the source
alphabet followed by as many pairs of letters called
(a)Static Dictionary
Q1) (b)Diagram M (b)
(c)Adaptive Dictionary
(d)Diagram coding
Diagram coding follow the
(a)Dynamic Dictionary
Q2) (b)Adaptive Dictionary M (c)
(c)Static Dictionary
(d)Both (b)and (c)
Adaptive Dictionary consists of following approaches
(a)LZW
Q3) (b)LZ77 M (d)
(c)LZ78
(d)All of the above
In LZ77 approach the encoding of any symbol can be
represented by the symbols
(a)o(offset)
(b)c(Codeword)
Q4) (c)l(Length of match) M (d)
(d)All (a),(b)and (c)
Which statement defines the offset of LZ77

(a) It is a distance from the search buffer to the
Q5) M (b)
found pattern.
(b)It is a distance from the look ahead buffer to the
Page 5 of 11
found pattern.
(c) It is a distance from the length of match to the
found pattern.
(d) It is a distance from the codeword to the
found pattern.
Which statement is true for LZ77 approach
(a)A size L of look –ahead buffer is unlimited.
(b)The search for longer matches would high the speed.
Q6) M (c)
(c) A size L of search buffer is limited.
(d)LZ77 assumes patterns in the output stream occur close
together.
In LZ77 approach the encoding of any symbol can be
represented by
(a)<0,l,c>
Q7) (b)<0,c,l> M (c)
(c)<o,l,c>
(d)<c,l,o>
GIF images are compressed using ………………… lossless data
compression techniques to reduce the file size without
degrading the visual quality.
(a)LZ78
Q8) M (a)
(b)LZW
(c)LZ77
(d)LZ88
In LZ78 approach the encode of any symbol can be
represented by
(a) <c,i>
Q9) (b)<i , c > M (b)
(c) <o,l,c>
(d) <o,c,l>
In LZ78 a sequence of codeword and characters is called
(a)Algorithm
Q10) (b)Variance L (c)
(c)Minimum Variance
(d)Coding
Depending upon how much knowledge is available,there are
………………… and …………………dictionary techniques.
(a)Sliding window and Adaptive
Q11) (b) Static and Adaptive M (b)
(c) Static and Dynamic

(d)Dynamic and Adaptive
Page 6 of 11
[B] than one correct option(s): G S
Which statement is true for Diagram coding

(a) Diagram coding is based on adaptive dictionary.
(b) The dictionary consists of all letters of the source
alphabet followed by as single pair of letters called
Q12) Diagram coding. H (c)&(d)
(c) Diagram coding is based on static dictionary.
(d) Diagram coding is permanent in nature.
LZ77 approach consists of following buffer

(a)Search Buffer
(b)Look ahead Buffer
Q13) L (a)&(b)
(c)Sorting Buffer
(d)Rocking Buffer
Which statement is true for limitation of LZ78 approach

(a)A LZ78 dictionary is slowly growing.
(b)The LZ78 algorithm has the ability to capture patterns
Q14) and hold them indefinitely. L (a)&(b)
(c) A LZ78 dictionary is fast growing.

(d) The LZ78 approach is based on static dictionary.
The applications of LZW are
(a)File Compression
Q15) (b)Image Compression. M (a) and (b)
(c)Audio Compression.
(d) Video Compression.

[c] problem statements determine the correct solution: G S
Encode the first letter of the given sequence using LZ77

Q16) algorithms : b a r r a y a M <0,0,c(b)>
Which algorithm is used in modems connecting computers to

remote users? H V.42
Q17)
Enlist the two modes of V.42 algorithm. Transparent

mode
Q18) H
Compressed
mode
Page 7 of 11
What is the color depth of JPEG? 24 bits
Q19) H
/pixel
Q20) What is the color depth of GIF? H 8 bits /pixel
Topic Set-3: Source Lecture(s): U3_L9 to U3_L15
Predictive Coding:
Prediction with Partial
match (ppm): The
basic algorithm, The
ESCAPE SYMBOL,
length of context, The
Exclusion
Principle, The Ref.: T2, R1 &
Burrows- Wheeler D1
Transform: Move-to-
front coding,
CALIC, JPEG-LS,
Multi-resolution
Approaches,
Facsimile Encoding,
Dynamic
Markoy Compression
The full form of PPM is
(a)Purchasing per minute
Q1) (b)Prediction with partial match M (b)
(c)Pant per million
(d)Parcel per minute
PPM algorithm was first proposed by
(a) Charlie
(b) Closen
Q2) L (c)
(c) Cleary
(d) Clay
PPM algorithm initially attempts to use the

(a)Huge context
Q3) (b) Smaller context L (c)
(c)Largest context
(d) Low context
The full form of BWT algorithm is

(a) Borrowers Wohler telegram
(b) Borrows Whaler Telegram
Q4) M (d)
(c) Burrows Wheeler Transform
(d) Browning Wheeler Telephonic
BWT algorithm requires
(a) The entire sequence to be coded be available to the
Q5) encoder after the coding takes place. M (c)
(b) The entire sequence to be coded be available to the
encoder when the coding takes place.
Page 8 of 11
(c) The entire sequence to be coded be available to the
encoder before the coding takes place.
(d) None of These
In which coding ,the first time a particular symbol
occurs ,the number corresponding to its place in the list
is transmitted .Then it is moved to the list at the top?
(a) BWT coding
Q6) H (c)
(b) PPM coding
(c) Move –to-front coding
(d) Dynamic Markov Coding
_________ coding is technique that encodes streams of
symbols based on an adapting code.
(a) BWT coding
Q7) (b) PPM coding L (d)
(c) Dynamic Markov Coding

(d) Move –to-front coding
The full form of CALIC is
(a) Context Audio Lossy Image Compression
Q8) (b)Context Adaptive Lossy Image Compression M (c)
(c)Context Adaptive Lossless Image Compression
(d)Context Auditable Lossy Image Compression
In which algorithm scheme, a given pixel generally has a
value close to one of its neighbors in an image?
(a)FACSIMILE Scheme
Q9) (b)JPEG-LS Scheme M (c)
(c)CALIC Scheme
(d)None Of These
A facsimile transmission a page is scanned and converted
into the
(a)Black Pixels
10) (b)Color Pixels M (d)
(c)White Pixels
(d)Both (a) and (c)

Which statements is true for CALIC

(a) CALIC scheme is came for a new lossless image H (a)&(c)
11)
compression scheme.
(b) It is a technique that encodes streams of symbols
Page 9 of 11
based on an adapting code..
(c)It uses both context and prediction of the pixel
values.
(d) In this coding, the first time a particular symbol
is transmitted .Then it is moved to the list at the top.
The two methods of Group 3 in Facsimile encoding are
(a) Modified Adaptive Huffman
12) (b) Modified Huffman H (b)&(d)
(c) Modified Write
(d) Modified Read
Which statements is true for Facsimile
(a) This encoding is used for image Compression.
(b) A facsimile transmission a page is scanned and
Converted into the Black and White pixel.
13) H (b)&(c)
(c) A facsimile a document over a telephone line.
(d) It is a technique that encodes streams of symbols
based on an adapting code.
Which statements is true for JPEG-LS

(a) It is a technique that encodes streams of symbols
based on an adapting code
(b) In this coding, the first time a particular symbol
is transmitted .Then it is moved to the list at the top.
14) M (c)&(d)
(c)JPEG-LS is an image compression standard designed to
provide effective lossless and near lossless compression
of continuous –tone gray scale and color still images
(d) The core algorithm behind JPEG-LS is called low
complexity for images.
In Facsimile encoding in which group faxes were sent as a

frame of analogue television
(a)Group 1
(b)Group 3 L (a)&(c)
15)
(c)Group 2
(d)Group 4

16) If X=100 and mean of X=75 then calculate the Prediction

error of CALIC. H 25
Page 10 of 11
By using BTW decoding algorithm decode the given sequence The resultant
17) L= R U D A R with index 3. H sequence is
R U D R A
By using Move-to-front Coding encode the given sequence The resultant
L=s s h t t h b i i b e. sequence is
18) L
4 0 3 5 0 1 3
5 0 1 5
By using BTW Coding algorithm encode the given sequence L= The resultant
t h i s b is b t h e. sequence is
19) L
L=s s h t t h
b i i b e
By using BTW Coding algorithm encode the given sequence L= The resultant
20) R U D R A. H sequence is
R U D A R
REFERENCES:
TEXT BOOKS:
Edition
S.K.KATARIA
&SONS
REFERENCE BOOKS:
Data Compression
…………………. X ………………….
Page 11 of 11
Data Compression
Unit-3 MCQ
1. The partition in which the tag resides depends on the ________of the
sequence being encoded.
( first symbol)
2. Dictionary order is sometimes used as a synonym for _________order.

(lexicographic)
3. Static dictionary technique is most appropriate when considerable

___________about the source is available.
( prior knowledge)
4. A static dictionary technique that is less specific to a single application

is________________.
(digram coding)
5. The dictionary consists of all letters of the source _______followed by as many

pairs of letters, called digrams
(alphabet)
6. The digram encoder reads a __________input and searches the dictionary to

see if this input exists in the dictionary.
( two-character)
7. The approaches based on the 1977 paper are said to belong to the______
family.
(LZ77)
8. In discrete memoryless source, the current letter produced by a source is

statistically independent of_____
a. Past output
b. Future output
c. Both a and b
9. Which coding terminology deals with the inverse operation of assigned words
of second language corresponding to the words in the first language?
a. Enciphering
b. Deciphering
c. Codeword
d. Codebook
10. Which bitmap file format/s support/s the Run Length Encoding (RLE)?
a. TIFF
b. BMP
c. PCX
d. All of the above
11. In dictionary techniques for data compaction, which approach of building

dictionary is used for the prior knowledge of probability of the frequently
occurring patterns?
c. Both a and b
12. Which type of channel does not represent any correlation between input and
output symbols?
a. Noiseless Channel
b. Lossless Channel
c. Useless Channel
d. Deterministic Channel
13. In channel coding theorem, channel capacity decides the

_________permissible rate at which error free transmission is possible.
a. Maximum
b. Minimum
c. Constant
14. If the channel is bandlimited to 6 kHz & signal to noise ratio is 16, what would
be the capacity of channel?
a. 15.15 kbps
b. 24.74 kbps
c. 30.12 kbps
d. 52.18 kbps
15. According to Shannon's second theorem, it is not feasible to transmit

information over the channel with ______error probability, although by using
any coding technique.
a. small
b. large
c. stable
d. unpredictable
16. Which among the following represents the code in which codewords consists
of message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
17. Which among the following represents the code in which codewords consists
of message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
18. In a linear code, the minimum Hamming distance between any two code
words is ______minimum weight of any non-zero code word.
a. Less than
b. Greater than
c. Equal to
19. Basically, Galois field consists of ______ number of elements.
a. Finite
b. Infinite
c. Both a and b
20. According to linearity property, the ________ of two code words in a cyclic
code is also a valid code word.
a. sum
b. difference
c. product
d. division
21. What is the value of leading coefficient of a monic polynomial?

a. 0.5
b. 1
c. 4
d. 16
22. While decoding the cyclic code, if the received code word is similar as
transmitted code word, then r(x) mod g(x) is equal to _________
a. Zero
b. Unity
c. Infinity
23. For designing of (4,1) cyclic repetition code, what would be the order of the
generator polynomial g(x)?
a. 1
b. 3
c. 4
d. 5
24. The distance of the pointer from the look-ahead buffer is called the_______.
(offset)
25. LZ77 scheme is a __________scheme.
( adaptive)
26. In LZ78 inputs are coded as a __________.

(double)
27. best-known applications of LZW:_____, and_______.

( GIF ,V.42 bis)
28. The UNIX compress command is one of the earlier applications of_______.
( LZW)
29. ___________has become quite popular for encoding all kinds of images, both
(GIF)
30. The best-known context-based algorithm is the ____algorithm

(PPM)
31. The basic algorithm initially attempts to use the _________context.

( largest)
32. An ________is encoded and the algorithm attempts to use the next smaller
context.
( escape symbol)
33. The CALIC scheme actually functions in two modes, one for _________and
another for bi-level images.
( gray-scale images)
34. In facsimile transmission, a page is scanned and converted into a sequence

of___________.
(black or white pixels)
A. coding
B. spatial
C. temporal
D. facsimile
Answer D
36. The dictionary in LZ encoding consists of ______ entries that refer to

substrings in the original file.
(indexed)
37. Lempel-Ziv encoding is a type of ________-based encoding.

(dictionary)
38. Run length encoding is a compression method in which repeated ______ of a

symbol are replaced.
(occurance)
39. At any given time, the output of an encoder depends on ______

a. Past input
b. Present input
c. Both a and b
B.Tech. [SEM VIII]

OBJECTIVE TYPE QUESTION BANK-IV
(Session: 2019-20)
Unit: IV Unit Name: SCALAR QUANTIZATION

Topic Set-1: Distortion criteria Models Source Lecture(s): U4_L1 Ref.: T2, R1 & D1
In the below mentioned questions: the statements have only one G S

[A] correct option:
The difference between the original and reconstructed

data, is refer to as the _________ in the reconstructed
data
Q1) (a) Conditional Entropy M (a)

(b) Distortion
(c) Probability
(d) Entropy
A measure of the relationship between two random

variables in the _____________.
Q2) M (a)
(a) Conditional Entropy
(b) Distortion
(c) Probability
(d) Entropy
____________ is the ratio of the average squared
value of the source input and the msg.
Q3) (a)Probability M (b)
(b)Signal to Noise ratio
(c)Distortion
(d)Conditional Entropy
A linear system is a mathematical model of a system
based on the used a _____________.
(a)Linear Operator
Q4) M (a)
(b)Arithmetic Operator
(c)Logical Operator
(d)Unary Operator
Page 1 of 13
Q5) The squared error measure is calculated by
(a) d(x,y)=2(-x+y) M (b)
(b)d(x,y)=(x-y)2
(c)d(x,y)=2(x-y)
(d)d(x,y)=2(-x-y)
The absolute difference measure is calculated by
(a) d(x,y)=(-x+y)
(b) d(x,y)=(x-y)2 M (c)
Q6)
(c) d(x,y)=|x-y|
(d) d(x,y)=2(-x-y)
The mean squared error is calculated by
(a)
(b)
(c) M (b)
Q7)
(d)
Average self information associated with the random

experiment is known as
(a) Probability associated with the same experiment M (b)
Q8) (b) Entropy associated with the same experiment
(c) Entropy associated with the different experiment
(d) Probability associated with the same experiment
Average value of the conditional self information is
known as
(a)Conditional Probability M (c)

Q9) (b)Probability
(c)Conditional Entropy
(d)Distortion

[B]
Mutual information relates the

(a) Entropy of two random variables M (a)&(c)
Q10) (b) Probability of two random variables
(c) Uncertainty
Page 2 of 13
(d) Probability
Which models are commonly used in the design and analysis of lossy
compression systems in Probability Models?
(a)Beta Distribution model

L (b) &(d)
Q11) (b) Uniform Model
(c)Alpha Distribution Model
(d) Gaussion Model

Which statements are true for Linear System Models?
(a)A linear system is a mathematical model of a system based on the

use of a linear operator.
(b) A linear system is a statistical model of a system based on the use

of a single operator. L (a)&(c)
Q12)
(c) As a mathematical abstraction or idealization, linear systems finds
important applications in signal processing.
(d) A linear system is a statistical model of a system based on the use

of a logical operator.
The Linear System Models consists of
(a)An autoregressive (AR) part
(b) An automobile (AM) part M (a)&(c)

Q13)
(c)A moving average (MA)part
(d) A mean square (MS) part

[C]
The Uniform Distribution function of probability models is

Fx(x)=
H
Q14)
The Gaussian Distribution function of probability models is Fx(x)=
H
Q15)
Find the differential entropy of a random variable X that is uniformly H(X)=log(b-a)

H
Q16) distributed in the interval (a, b).
Page 3 of 13
Source Lecture(s): U4_L1 to U4_L1
Topic Set-2: Models Ref.: T2, R1 & D1
The ratio of the average squared value of the source output and mean
squared error is called
(a) SMR
Q1) (b) SNR M (b)
(c) SPR
(d) SQR
How many probability models are used in the design and analysis of
lossy compression systems?
Q2) (a) 2 M (b)
(b) 4
(c) 5
(d) 3
How many parts are available in Linear System Models?
(a) 2
Q3) (b) 4 M (a)
(c) 5
(d) 3
Which is a computer image in which each pixel is represented by only
one bit , which can be either on or off.
Q4) (a) Unary –level image M (c)

(b)Tri-level image
(c)Bi-level image
(d)Binary – level image
Regions which are neither text nor halftones are typically compressed
using a context –dependent arithmetic coding algorithm called
(a)QR Coder
Q5) M (c)
(b)MR Coder
(c)QM Coder
(d)RM Coder
If we do not know anything about the distribution of the source
output, except possibly the range of values, we can use the _______
model
(a)Gaussian Distribution M (d)

Q6)
(b) Laplacian Distribution
(c) Gamma Distribution
Page 4 of 13
(d) Uniform Distribution
A distribution that is even more peaked ,though considerably less

traceable, than the Laplacian distribution is the ________
a)Gaussian Distribution
(b) Laplacian Distribution M (c)

Q7)
(c) Gamma Distribution
(d) Uniform Distribution

[B]
Which statement is true for Gaussian Distribution?
(a)It is a mathematical traceable.
(b)It can be argued that in the limit the distribution of interest goes to
a Gaussian distribution. H (a) &(b)

Q8)
(c) If we do not know anything about the distribution of the source
output, except possibly the range of values, we can use the Gaussian
model.
(d)The close match is the Gaussian distribution ,which is peaked at

zero.
Which statement is true for Uniform Distribution?
(a) If we do not know anything about the distribution of the source

output, except possibly the range of values, we can use the Uniform
model.
(b) The Uniform Distribution function of probability models is
Fx(x)=
Q9) H (a)&(b)
(c) The close match is the Uniform distribution , which is peaked at
zero.
(d) The Gaussian Distribution function of probability models is

Fx(x)=
Page 5 of 13
[C]
The AR(N) model can be written as N

10) H x n = C +  a i x n −i +  n
i =1
Find the differential entropy of a random variable X that has a

Gaussian PDF
11) H h(X)=
1 (x − )2
Fx(x)= exp−
2 2 2 2
The Gamma Distribution function of probability models is Fx(x)=
12) H
The Laplacian Distribution function of probability models is Fx(x)=

13) H
Topic Set-3: Scalar Quantization: The Source Lecture(s): U4_L2 to U4_L3 Ref.: T2, R1 & D1
Quantization problem
The process of representing a large possibly infinite
set of values with a much smaller set is called
(a)Static Dictionary
(b)Diagram M (c)
Q1)
(c)Quantization
(d)Dynamic Dictionary
A mapping of an input value x into a finite number of
output values y ,is called
(a)Multiple Quantization
(b)Scalar Quantization M (b)
Q2)
(c)Uniform Quantization
(d) Non-Uniform Quantization
In which quantization mapping the encoder divides the
range of values that the source generates into a number
of intervals
a) Diagram Mapping
M (d)
Q3) (b) Decoder Mapping
(c) Module Mapping
(d) Encoder Mapping
In which mapping, knowing the code only tell us the
interval to which the sample value belongs?
a) Diagram Mapping M (d)
Q4)
(b) Decoder Mapping
(c) Module Mapping
Page 6 of 13
(d) Encoder Mapping
In the decoder mapping ,we generally use the _______ of

the interval as the representative value
(a)Last point
Q5) (b)Mid point M (b)
(c)Mean point
(d) First point
In Encoder mapping the sample value comes from an
analog source, the encoder is called an
(a) Output to Input Converter
Q6) (b)Analog to Digital Converter M (b)
(c) Input to Output Converter

(d) Digital To Analog Converter
If the reconstruction is analog ,the decoder is often
referred to as a
(a) Output to Input Converter
(b)Analog to Digital Converter M (d)
Q7)
(c) Input to Output Converter
(d) Digital To Analog Converter
How many types of codewords to represent the quantizer
output
(a)5
(b)4 M (c)
Q8)
(c)2
(d)3
If we used__________ to represent the quantizer output,
then the size of the output alphabet immediately
specified the rate.
(a) Adaptive length codewords
M (b)
Q9) (b) Fixed length codewords
(c) Dynamic length codewords
(d) Variable length codewords
In___________ to represent the quantizer output, the

rate will depend on the probability of occurance of the
output.
Q10)
(b) Fixed length codewords
(c) Dynamic length codewords M (d)
Page 7 of 13
[B]
The Quantization consists of following mappings

(a) Diagram Mapping
(b) Decoder Mapping
H (b)&(d)
Q11) (c) Module Mapping
(d) Encoder Mapping
Which statement is true for Decoder mapping

(a)Decoder mapping does not tells us which of the many
values in the interval is the actual sample value.
(b) In decoder mapping, knowing the code only tell us
the interval to which the sample value belongs?
(c) In the decoder mapping ,we generally use the L (c)&(d)
Q12)
Midpoint of the interval as the representative value.
(d) In the decoder mapping, there is no way of knowing
which value in the interval was actually generated by
the source.
Which type of codeword to represent the quantizer

output
(b) Fixed length codewords L (b)&(d)
Q13)
(c) Dynamic length codewords

[c]
If the number of quantizer output is M ,then the rate of

fixed length codeword is given by M R=[Log2M]
Q14)
___________ does not have zero as one of its
representation levels. H Midrise Quantizer
Q15)
___________ does have zero as one of its representation

levels. H Midtread Quantizer
Q16)
If the number of level is M, then(step size)∆ is equal

to ___________. H 2Xmax/M
Q17)
Page 8 of 13
Source Lecture(s): U4_L2 to
Topic Set-4: Uniform Quantizer U4_L3
Ref.: T2, R1 & D1
In the midrise quantizer the representation levels do not include the

value of
(a)3
1) M (d)
(b)2
(c)1
(d)0
Midtread quantizer has ______ as one of its output levels.
(a)3
2) (b)2 M
(c)
(c)0
(d)1
_________ is a quantizer where all reconstruction
levels are equally spaced.
3) M (c)
(b)Scalar Quantization
(c)Uniform Quantization
Which can be interpreted as the amount of uncertainty
remaining about the random variable X or the source
output?
(a) Probability M (d)
4)
(b) Conditional Probability
(c) Distortion
(d) Conditional Entropy

The two features of uniform Quantizer are

(a)Except possibly the right- most and left-most intervals, all intervals
along the X-axis are uniformly spaced.
(b) Except possibly the right- most and left-most intervals, all
(5) intervals along the Y-axis are uniformly spaced. H (a)&(d)
(c) Except possibly the right- most and left-most intervals, all intervals
along the Z-axis are uniformly spaced.
(d)Except possibly the outer intervals, the reconstruction levels of the
quantizer are uniformly spaced.
Uniform Quantizes can be divided into following types of
quantizer
(a) Scalar Quantizer
(6) (b)&(d)
(b) Midrise Quantizer
(c) Midterm Quantizer
(d) Midtread Quantizer
Page 9 of 13
How can be represented the uniform quantizer in mathematical ri +1 − ri = 

format? 1  i  L −1
where
ri  reconstruction
levels
L = number
7) H of
output
states
 = length
of
the
int ervel
In Uniformly Quantization of a uniformly distributed source
8) ,distortion value is _______. M
In Quantization Distortion the bounded error is called Granular error or

9) the ________________ M
Granular noise
Source Lecture(s): U4_L4 to

Topic Set-5: Adaptive Quantization, U4_L5
Non uniform Quantization [ Ref.: T2, R1 & D1
_______________ refers to adjusting the decision and
reconstruction levels according to the local statistic
of the prediction error.
M (b)
Q1) (b)Scalar Quantization
(c)Adaptive Quantization
How many approaches to adapting the quantize parameter?
(a) 4
(b) 3
L (c)
Q2) (c) 2
(d) 1
Forward Adaptive Approach is also called

(a) Offline Adaptive Approach
(b) Smaller Adaptive Approach L (a)
Q3)
(c) Online Adaptive Approach
(d) Bigger Adaptive Approach
Page 10 of 13
Backward Adaptive Approach is also called
(a) Offline Adaptive Approach
(b) Smaller Adaptive Approach
Q4) M (c)
(c) Online Adaptive Approach
(d) Bigger Adaptive Approach
In Forward Adaptive Quantization ,the source output is
divided into_________.
(a) Frames of Data
(b) Square of Data M (c)
Q5)
(c) Blocks of Data
(d) None of These
In backward Adaptive Quantization ,the adaption is
performed based on the
(a) Quantizer Uniformity
Q6) (b) Quantizer Output
(c) Quantizer Ratio H (b)
(d) Quantizer input
In backward Adaptive Quantization only the ____quantized

samples are available for use in adapting the quantizer.
(a) First
Q7)
(b) Post
L (b)
(c) Pre
(d) Last
The optimum entropy –constrained quantizer is the_______
Quantizer.
M (d)
(d)Uniform Quantization
If the input range is divided into levels of unequal
spacing, then the quantizer is termed as a
_____quantizer.
M (d)
(d)Non-Uniform Quantization
Page 11 of 13
The optimum entropy-constrained quantizer is the ______
quantizer.
10)
(a)Multiple
(b)Scalar M (d)
(c)Adaptive
(d)Uniform

[B]
The two main approaches to adapting the quantize

parameter are
(a) Non-Uniform adaptive approach
(b) Forward adaptive approach H (b)&(d)
11)
(c) Uniform adaptive approach
(d) backward adaptive approach
Four scaled Lloyd Max quantizers representing the
following regions
(a) Ancient edges
12) (b) Textured regions
(c) Uniform regions
(d) Small edges H (b)&(c)
Which statements is true for Adaptive Quantization

(a) Adaptive Quantization refers to adjusting the
decision and reconstruction levels according to the
local statistic of the prediction error.
(b)The optimum entropy –constrained quantizer is
the Adaptive Quantizer. H (a)&(c)
13)
(c)There are the two approaches to adapting the
quantize parameter.
(d) It is a technique that encodes streams of symbols
based on an adapting code.
Which Quantization is a part of Adaptive Quantization

(a) Offline Adaptive Quantization
(b) Non-Uniform Adaptive Quantization
M (a)&(c)
14) (c)Online Adaptive Quantization
(d)Inline Adaptive Quantization
Page 12 of 13
In which data compression file, the recovered file from
the compressed data is a close approximation of its
15) original.
(a)MPEG
(b)Huffman
L (a)&(d)
(c)Run length
(d)JPEG

[C]
In Quantization Distortion the unbounded error is called Overload error or

16) the ________________ H
overload noise.
Quantization error is equal to the___________. Q=x-Q(x) where x and
H Q(x) are input and
17)
quantized output.
Quantization error is often referred to as ____________. L Quantization noise.
18)
In forward adaptive Quantization the estimation of
variance is equal to the __________
L
19)
The adaption process can be represented as______ ∆n=Ml(n-1)∆n-1 where l(n-

H 1)is the quantization
20)
interval at time (n-1).
REFERENCES:
TEXT BOOKS:
Edition
S.K.KATARIA
&SONS
REFERENCE BOOKS:
Data Compression
…………………. X ………………….
Page 13 of 13
Data Compression
Unit-2 MCQ
1) In the multimedia contents, coding and decoding is performed by a software

component known as _______.
a) codec
b) modec
c) sodec
d) bodec
2) What is the full form of M3U ?

3) The techniques for reducing the storage requirement of computer files and
directory structure are known by which name ?
a) Data compression
b) Data storage place
c) Data form
d) Data transfer
4) By using data compression technique, what can be done in the data storage
place of memory and disk ?
a) increment
b) Reduction
c) Transfer
d) Repetition
5) What process is done by the data compression while encoding the data ?
a) Identifying repetition in the data
b) Reducing repetition in the data
c) Eliminating
repetition in the data
d) All of these
6) Which technique identify and eliminate less important information to

conserve space ?
a) Data compression
b) Data repetition
c) Data extension
d) Data conservation
7) In data compression technique, each word is represented by what ?

a) Digit
b) Letter
c) a or b
d) Picture
8) Where in the encoded file, one can have the data that tells which digit/letter
represents which word ?
a) Beginning
b) Middle
c) Ending
d) None of these
9) What is the reason that in the beginning of encoded file there is data telling
which digit/letter represents which word ?
a) It is needed to convert the file in compression form
b) it is needed to convert the file in encoded form
c) it is needed to convert the file in its original uncompressed form
d) it is needed to convert the file in graphical form
10) In the encoded file, how many time lengthy words appear ?
a) Not a single time
b) One
c) Infinite
d) As specified
11) In the encoded file, which type of changes are made in sysmbols ?
a) They are compressed
b) They are changed to a letter or symbol
c) They are
represented in the graphical form
d) No changes are made
12) The two catagories of data compression methods are ________ and
______.(lossless and lossy)
13) Lossless compression preserves the ________ of the data exactly.(integrity)
14) In lossy compression, some of the data is ___ in the

compression/decompression process.(lost)
15) Run length encoding is a compression method in which repeated ______ of a

symbol are replaced.(occurance)
16) Lempel-Ziv encoding is a type of ________-based encoding.(dictionary)
17) Huffman coding uses the ______ of the characters in the file to construct a
tree.(frequency)
18) In Huffman codes for each character with the ____ frequent characters
having shorter codes than the less frequent characters.(more)
19) The dictionary in LZ encoding consists of ______ entries that refer to

substrings in the original file.(indexed)
20) In Huffman encoding, both the sender and receiver must have a copy of the
___Code.(same)
21) JPEG is used to compress ______.(image)
22) MPEG is used to compress______.( video)
23) MPEG uses a method similar to JPEG to compress the individual _____of
video.( frames)
24) In the encoded file, which symbol is marked in the beginning ?

a) ^
b) &
c) $
d) %
25) In the encoded file, which symbol is marked in the ending ?

a) ^
b) &
c) $
d) %
26) In the encoded file, by using which process it can be transformed into original
file at any time ?
a) Straight
b) Reverse
c) Transfer
d) Compressed
27) From the following for which process ‘Archive Manager tool ‘ is used ?
a) For transferring the data of file and directory
b) For place compression on the file
and directory
c) For altering the form of file and directory
d) For data compression on file and directory
28) From the following, which file format stores multiple files in a single Zip file ?
a) zap
b) zip
c) zop
d) zep
29) Using gzip program an uncompressed file in the tar format is compressed in
the zip format, by providing which extension ?
a) tar
b) tar.gz
c) tar.gz
d) zip
30) Which file in java uses zip compression?

a) JAR
b) JER
c) ZAR
d) ZER
31) What is done firstly, to create a compressed and archive file into
uncompressed ?
b) Right clicking a file ->open with archive manager
32) Which button can be used in the Archive manager toolbar, to create a
compressed file into uncompressed ?
1. A)Open button
2. b) Home button
3. c) Extract
4. d) Up button
33) From the following, which option shows an issue faced with multimedia
contents ?
a) Converting multimedia information coming from hardware devices into computer
data
b) converting the computer data back into audio/video streams for playing on
the hardware device
c) a and b both
d) None of these
34) To convert multimedia information coming from hardware devices into

computer data can be compared with which process ?
a) coding
b) Decoding
c) (a) and (b) both
d) None of these
35) In the multimedia contents, which process is done by a software ?

c) (A) and (B) both
d) None of these
36) An alphabet consist of the letters A, B, C and D. The probability of occurrence

is P(A) = 0.4, P(B) = 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is
a. A = 01
B = 111
C = 110
D = 10
b. A = 0
B = 111
C = 110
D = 10
c. A = 0
B = 111
C = 11
D = 101
d.A = 0
B = 11
C = 10
D = 111
37) The basic idea behind Huffman coding is to

B. compress data by using fewer bits to encode more frequently occuring
characters
38) Huffman coding is an encoding algorithm used for

B. files greater than 1 Mbit
C. broadband systems
39) A Huffman encoder takes a set of characters with fixed length and produces a
set of characters of
A. fixed length
B. constant length
C. random length
D. variable length
40) A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C)
= 0.2, P(D) = 0.3
A. 8.0 bit
B. 2.0 bit
C. 1.9 bit
D. 2.1 bit
41) The idea with wavelets is to represent a complicated function by

A. sinus functions
B. simple basic functions
C. lines
D. square functions
42) Down sampling is to make a digital image file smaller by
A. removing pixels
B. adding noise
C. adding pixels
D. removing noise
43) Without losing quality, JPEG-2000 can achieve compression ratios of

A. 20:1
B. 2000:1
C. 2:1
D. 200:1
44) The best visual compression quality is achieved using

A. DCT
B. Wavelets
C. Dolby
D. Fourier transform
45) Blocking is the act of dividing the image into 8 x 8 pixel _____in order to
reduce the number of calculations.( blocks)
46) DCT changes the 64 pixel values in each _____so that the relative
relationships between pixels are kept but the redundancies are revealed.( block)
47) Quantization of the T table ______the number of bits needed for encoding.
(reduces)
48) A motion picture is a rapid flow of a set of ____where each frame is a picture.
(frames)
49) Huffman trees use the _______________ of each character to work out their
encoding.
A. Frequency
B. Order in ASCII
C. Number value
50) How do you move through a Huffman tree?
A. 0 = right 1= left
B. 1 = left 2 = right
C. 0 = left 1 = right
0 = middle 1 = back
Data Compression
Unit 1
1. Data compression means to decrease the file size

Ans. True
2. Data encryption and compression both work on binary code.
Ans. True
Ans. To reduce the size of data to save space and Transmission Bandwidth
4. The purpose of data compression is to decrease file sizes.

Ans. True
5. Compression in general makes it _______ to send, upload and stream data

(a) Quicker
(b) Slower
Ans. Quicker
6. Data compression usually works by
(a) Finding repeating patterns.

(b) Deleting random bits data
Ans. Finding repeated patterns
7.What are the main reasons to compress data? (select all that apply)
(a)To reduce secondary storage space
(b)To maximise the available RAM memory
(c)To speed up network transmission times
(d)To optimise the data
(e)To reduce packet congestion on networks
Ans. (a), (c), (e)
8.Which of these terms is a type of data compression?

(a)resolution
(b)zipping
(c)inputting
(d)caching
Ans. Zipping
9.Lossy or lossless? This type of compression does not get rid of any data
(a)Lossy
(b)Lossless
(c)Both
Ans. Lossless
10. Lossy or lossless? This type of compression makes the file smaller
(a)Lossy
(b)Lossless
(c)Both
Ans. Both
11.Lossy or lossless? This type of compression gets rid of some information

(a)Lossy
(b)Lossless
(c)Both
Ans. Lossy
12. Which best describes Lossless Compression?

(a)No information is lost but file size is increased
(b)There is no loss in information at all after compression
(c)Files which have the exact same data after compression
(d)Compression that involves an algorithm
Ans. There is no loss in information at all after compression
13. When is Run Length Encoding used?

(a)When we want to compress patterns of data
(b)When we want to decompress patterns of data
(c)When we want to encode running videos
Ans. When we want to compress patterns of data
14. Makes the file smaller by deleting parts of the file permanently (forever)
(a)Lossy Compression
(b)Lossless Compression
Ans. Lossy Compression
15. Huffman trees use the _______________ of each character to work out their
encoding.
(a)Frequency
(b)Order in ASCII
(c)Number value
Ans. Frequency
16. How do you move through a Huffman tree?

(a) 0 = right 1= left
(b) 1 = left 2 = right
(c) 0 = left 1 = right
(d) 0 = middle 1 = back
Ans. 0 = left 1 = right
17.How do you calculate the number of bits of a body of text in ASCII?

(a) Number of characters * 7
(b) Number of characters (including spaces) *7
(c) bits in Huffman * 7
(d) bits in Huffman / 7
Ans. Number of characters (including spaces) *7
18.Which formula shows how to work out the percentage a file has been
compressed by?
(a) bits in (Huffman *7) /100
(b) bits in ASCii - bits in Huffman
(c) difference in bits / bits in ASCII * 100
Ans. difference in bits / bits in ASCII * 100
(a) pixels
(b) matrix
(c) frames
(d) coordinates
Ans. Frames

(a) code word
(b) word
(c) byte
(d) nibble
Ans. Code word
21. If the P(E) = 1, it means event

a. does not occur
b. always occur
c. no probability
d. Normalization
Ans. Always occur
22. Source of information depending on

finite no of outputs is called
a. markov
b. finite memory source
c. zero source
d. Both A and B
Ans. Both (a) and (b)
23. Information per source is called

a. sampling
b. quantization
c. entropy
d. normalization
Ans. Entropy
24. Information ignored the human eye is

the
a. coding redundancy
b. spatial redundancy
c. temporal redundancy
d. irrelevant info
Ans. Irrelevant info
25. An Image is represented by 65536 X8
bits, and after compression it reduced to
16384 X8 bits. What will be the compression
ratio:
a. 55%
b. 65%
c. 75%
d. 85%
Ans. 75%
26. An Image is Square array of 256X256
pixel requires 65536 bytes, and after
compression it reduced to
16384 X8 bytes. What will be the
compression rate:
a. 2
b. 3
c. 4
d. 5
Ans. 2
27. In the encoded file, which type of

changes are made in symbols?
a. They are compressed
b. They are changed to a letter or symbol
c. They are represented in the graphical form
d. No changes are made
Ans. No changes are made
28. The basic idea behind Huffman coding is
to
a. compress data by using fewer bits to
encode fewer frequently occuring characters
b. compress data by using fewer bits to
c. compress data by using more bits to
d. expand data by using fewer bits to encode
more frequently occuring characters
Ans. compress data by using fewer bits to
29. Huffman coding is an encoding algorithm

used for
a. lossless data compression
b. files greater than 1 Mbit
c. broadband systems
d. lossy data compression
Ans. lossless data compression
30. A Huffman code: A = 1, B = 000, C = 001,

D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D)
= 0.3
a. 8.0 bit
b. 2.0 bit
c. 1.9 bit
d. 2.1 bit
Ans. 1.9 bit=
31. Huffman trees use the _______________
of each character to work out their
encoding.
a. Frequency
b. Order in ASCII
c. Number value
d. Both (a) and (b)
Ans. Frequency
32. Calculate the entropy for : P(A) = 0.4,

P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1
a. 1.24
b. 1.22
c. 1.28
d. 1.30
Ans. 1.22
33. Average length of Extended Huffman
code is upper bounded by :
a. R
b. R+1
c. R-1
d. R+1/n
34. If the probability is not given which

method is preferable
a. Huffman
b. Non Binary Huffman
c. Adaptive Huffman
d. Extended Huffman
35. Compression method use for Integer
type data
a. Huffman
b. LZ77
c. Golomb Code
d. Adaptive Huffman
36. In Huffman encoding, both the sender
and receiver must have a copy of the code
a. Same
b. Different
c. Generate on Demand
d. Both (a) and (b)
37. In the multimedia contents, coding and

decoding is performed by a software
component known as:
a. codec
b. modec
c. sodec
d. bodec
38. In dictionary techniques for data

compaction, which approach of building
dictionary is used for the prior knowledge of
probability of the frequently occurring
patterns?
c. both a and b
39. Dictionary order is sometimes used as a

synonym for:
a. Alphabetical order
b. Lexicographical order
c. Alphanumerical order
d. Both (a) and (c)
40. How many character an encoder reads

and searches the dictionary to see if this
input exists in the dictionary.
a. 2 character
b. 1 character
c. 3 character
d. Both (a) and (b)
41. Sliding windowing technique is used in

which dictionary compression
a. LZW
b. LZ77
c. LZ78
d. Diagram coding
42. The distance of the pointer from the

look-ahead buffer is called :
a. Length
b. Offset
c. Triplet
d. Code
43. The UNIX compress command is one of

the earlier applications of
a. LZ77
b. LZ78
c. Huffman
d. LZW
44.The basic algorithm initially attempts to

use the _________context.
a. Small
b. Shortest
c. Longest
d. Zero
45.An ________is encoded and the

algorithm attempts to use the next smaller
context.
a. One length context
b. Zero context
c. Escape symbol
d. None
46.The CALIC scheme actually functions on :
a. bi-level images.
b. gray-scale images
c. RBG images
d. Both (a) and (b)
47. In facsimile transmission, a page is

scanned and converted into a sequence of
a. Binary sequence
b. Ternary sequence
c. black or white pixels
d. alphanumeric sequence
48. ___________has become quite popular
for encoding all kinds of images, both
a. GIF
b. PNG
c. TIFF
d. JPEG
49. A static dictionary technique that is less

specific to a single application is:
a. LZ77
b. Diagram Coding
c. Initial dictionary
d. LZW
50. Earliest name of the facsimile coding

is___________.
a. Feminine
b. CALIC
c. Telephone
d. Fax
51. Window in dictionary method consists of

___________ parts
a. 1
b. 3
c. 2
d. 4
52.At any given time, the output of an

encoder depends on ______
a. Past input
b. Present input
c. Both a and b
53.Digital video is sequence of

a. pixels
b. matrix
c. frames
d. coordinates
54.The reconstruction of
a______constructed sequence is identical to
the original sequence.
a. losslessly
b. lossy
c. Predictive
55.We can improve the amount of
_______by accepting a certain degree of loss
during the compression process.
a. Compression
b. Decompression
c. Distortion
d. Compression ratio
56.The difference between the original and

reconstructed data, which we will refer to as
the______in the reconstructed data.
a. Redundancy
b. Compression
c. loss
d. Distortion
57. The rate for a discrete source is simply
the______.
a. Entropy
b. Loss
c. Noise
d. Distortion
58. Popular measures of distortion is

a. Squared error measure
b. Absolute difference
c. Noise
d. Nats
59.Which file format stores multiple files in a
single Zip file ?
a. zap
b. zip
c. zop
d. zep
60.The process of representing Infinite set of

values with a much smaller set is called
a. Mapping
b. clustering
c. Quantization
d. Sampling
61. A simple quantization scheme would be

to represent each output of the source with
the ____value closest to it.
a. Codeword
b. Integer
c. Binary sequence
d. Coordinates
62. The design of the _____has a significant

impact on the amount of compression.
a. Cluster
b. Quantizer
c. Codebook
d. Both (b) and (a)
63. Quantization techniques that operate on

blocks of data are called
a. Adaptive quantization
b. Non uniform Quantization
c. Scalar Quantization
d. None of the Above
64. Set of L-dimensional blocks called the

_______of the vector quantizer.
a. Group
b. Codebook
c. Coding
d. Index
65. LBG algorithm is used to design a

_________.
a. Quantizer
b. Vector
c. Codebook
d. Index table
66. ___________ shape is used to make

codebook in structure vector quantization.
a. Square
b. Rectangle
c. Circle
d. Hexagon
67.In polar vector quantization r is called

________.
a. Quantum
b. Phase
c. Magnitude
d. None of above
68.In Tree structures vector quantization
cluster is divided in
a. 2 groups
b. 3 groups
c. Infinite groups
d. N groups
69. Run length encoding is a compression

method in which repeated ______ of a
symbol
are replaced.
a. Residual
b. Occurrence
c. Letters
d. None
70.Extended Huffman method is used due to
a. Large alphabet
b. Skewed probability
c. Equal probability
d. Both (a) and(b)
71. Probability model is based on

a. Probability
b. Physics
c. Frequency
d. None
72.Entropy of a source is
a. Self information of the source
b. Average self information
c. Average number of bits
d. Both (a) and (b)
73. ASCII Code is a example of

a. Prefix code
b. Variable length code
c. Fixed length code
d. Alphanumeric code
74.Code {0,10,100,111} is :
a. UDC
b. Prefix code
c. Instantaneous code
d. All above
75.Code {0,01,11,111} is UDC.

a. True
b. False
Data Compression UNIT-5 MCQ Questions with Solutions AKTU ~ ... https://www.goeldigitalsolution.com/2021/07/data-compression-unit-5...
जनवरी
को होगी यू पी टीईटी परी ा
अ ापक पा ता परी ा यूपीटीईटी

की नई तारीख आ गई है । बेिसक िश ा
िवभाग की अित र मु सिचव रे णु का कुमार ने सोमवार को
बताय
Subscribe
1 of 7 27-07-2021, 18:14
Followers (13)
Follow
2 of 7 27-07-2021, 18:14
3 of 7 27-07-2021, 18:14
A. Multiple quantization indexes are represented by one codeword

B. Each input symbol is represented by a fixed-length codeword
C. Multiple input symbols are represented by one quantization index
D. All of the above
Correct option is C
16. Vector quantization is rarely used in practical applications, why?
A. The coding efficiency is the same as for scalar quantization

B. The computational complexity, in particular for the encoding, is much higher
than in scalar quantization and a large codebook needs to be stored
C. It requires block Huffman coding of quantization indexes, which is very complex
D. All of the above
Correct option is B
17. Let N represent the dimension of a vector quantizer. What statement about the
performance of the best vector quantizer with dimension N is correct?
A. For N approaching infinity, the quantizer performance asymptotically

approaches the rate- distortion function (theoretical limit)
B. By doubling the dimension N, the bit rate for the same distortion is halved
C. The vector quantizer performance is independent of N
D. All of the above
Correct option is A
18. Which of the following is/are correct for the advantage of vector quantization over
scalar quantization.
A. Vector Quantization can lower the average distortion with the number of
reconstruction levels held constant
B. Vector Quantization can reduce the number of reconstruction levels when
distortion is held constant
C. Vector Quantization is also more effective than Scalar Quantization When the
source output values are not correlated
D. All of the above
Correct option is D
19. Vector quantization is used for
A. Lossy data compression

B. Lossy data correction
C. Pattern recognition
D. All of the above
Correct option is D
20. The Linde–Buzo–Gray algorithm is a quantization algorithm to derive a
4 of 7 27-07-2021, 18:14
good codebook.
A. Scalar
B. Vector
C. Both
D. None of the above
Correct option is B
A. Video coding
B. Audio coding
C. Speech coding
D. All of the above
Correct option is C
22. What are processes (Techniques) used in video coding?
A. Partition of frames into macroblocks

B. Form of Vector Quantization
C. Both (A) & (B)
D. None of these
Correct option is C
23. The process of converting the analog sample into discrete form is called
A. Modulation
B. Multiplexing
C. Quantization
D. Sampling
Correct option is C
24. The sequence of operations in which PCM is done is
5 of 7 27-07-2021, 18:14
6 of 7 27-07-2021, 18:14
← →
Comment as:
Publish Notify me
Search
7 of 7 27-07-2021, 18:14
Data Compression MCQ Questions with Solutions /UNIT-4/ AKTU ~... https://www.goeldigitalsolution.com/2021/07/data-compression-unit-4...
Data Compression
UNIT-4 MCQ Questions with Solutions AKTU
1. Name of Two popular measures of distortion are:
A. squared error measure and absolute difference measure
जनवरी
B. Fidelity and Quality को होगी यू पी टीईटी परी ा
C. Scalar and Vector Quantization
D. mean squared error (mse) and Signal to Noise Ratio(SNR) अ ापक पा ता परी ा यूपीटीईटी
Correct option is A बताय
2. If we are interested in the size of the error relative to the signal, we can find the
ratio of the average squared value of the source output and the mse. This is
called...............
A. signal-to-noise ratio (SNR)
B. Peak to Noise Ratio (PNR)
C. Compression Ratio
D. Distrortion
Correct option is A
3. Rate is defined as the __________ number of bits used to represent each Subscribe
sample value.
A. Maximum
B. Minimum
C. Average
D. All of the above
Correct option is C
4. The rate distortion function R(D) specifies the ___________rate at which the
output of a source can be encoded while keeping the distortion less than or equal
to D.
A. Highest
B. Lowest
C. Average
D. None of these
Correct option is B
5. For two random variables X and Y , where H(X|Y)<= H(X) with equality if X
is independent of Y . The given statement is:
A. True
B. False
1 of 11 27-07-2021, 18:14
Correct option is A Followers (13)
6. The unit of average mutual information is

A. Bits
B. Bytes
C. Bits per symbol Follow
D. Bytes per symbol
Correct option is A
7. The self information of random variable is

a) 0
b) 1
c) Infinite
Correct option is C
8. Entropy of a random variable is

a) 0
b) 1
c) Infinite
Correct option is C
9. When probability of error during transmission is 0.5, it indicates that
a) Channel is very noisy

b) No information is received
c) Channel is very noisy & No information is received
Correct option is C
10. Self information should be

a) Positive
b) Negative
Correct option is A
11. The relation between entropy and mutual information is

a) I(X;Y) = H(X) - H(X/Y)
b) I(X;Y) = H(X/Y) - H(Y/X)
c) I(X;Y) = H(X) - H(Y)
d) I(X;Y) = H(Y) - H(X)
Correct option is A
12. The mutual information

a) Is symmetric
b) Always non negative
c) Both a) and b) are correct
d) None of the above
2 of 11 27-07-2021, 18:14
Correct option is C
13. The models play an important role in the ___________ of lossy compression
algorithms.
A. Testing
B. Design
C. Maintenance
D. Coding
Correct option is B
14. Which model is used for the design and analysis of lossy compression
schemes?
A. Probability Model
B. Physical Model
C. Linear System Models
D. All of the above
Correct option is A
15. The models are based on the physics of the source output production is
called_____________.
A. Probabilistic Model
B. Physical Model
C. Linear System Models
D. Composite Source Model
Correct option is B
16. The ______________ is the most popular of all the linear models, especially
in speech compression, where it arises as a natural consequence of the speech
production model.
A. Probabilistic Model
B. Physical Model
C. Composite Source Model
D. Nth-order autoregressive model (AR(N) model)
Correct option is D
17. The Probability Models commonly used in the design and analysis of lossy
compression systems are:
A. Uniform Distribution
B. Gaussian Distribution, Laplacian Distribution
C. Gamma distribution
D. All of the above
Correct option is D
18. The process of representing a large—possibly infinite—set of values with a

much smaller
3 of 11 27-07-2021, 18:14
set is called__________.
A. Correlation
B. Quantization
C. Model
D. Non Uniform Quantization
Correct option is B
19. A mapping which divides the range of values that the source generates into a
number of intervals.
A. Decoder Mapping
B. Encoder Mapping
C. Decoder Mapping & Encoder Mapping
D. None of these
Correct option is C
20. A mapping that generates reconstruction value is called:

A. Decoder Mapping
B. Encoder Mapping
C. Decoder Mapping & Encoder Mapping
D. None of these
Correct option is A
21. A quantizer does not have zero as one of its representation levels is called :
A. midtread quantizer
B. midrise quantizer
C. Vector quantizer
Correct option is B
22. A quantizer has zero as one of its output levels is called :

C. Vector quantizer
Correct option is A
23. Control systems in which it is important to represent a zero value accurately,

and audio
Coding schemes in which we need to represent silence periods are examples of
C. Non Uniform quantizer
Correct option is A
24. The main approach to adapting the quantizer parameters are :
4 of 11 27-07-2021, 18:14
A. an off-line or forward adaptive approach

B. an on-line or backward adaptive approach
C. Both A and B
Correct option is C
25. In _____________ , the source output is divided into blocks of data & Each
block is analyzed
before quantization, and the quantizer parameters are set accordingly. The settings
of the
quantizer are then transmitted to the receiver as side information.
A. backward adaptive quantization
B. forward adaptive quantization
C. Uniform
Correct option is B
26. In _________________ quantization, the quantizer output is available to both

transmitter and receiver, there is no need for side information.
A. backward adaptive quantization
B. forward adaptive quantization
C. Uniform
Correct option is A
27. A Quantizer also with another name "quantization with one word memory" is
called
C. Jayant quantizer
D. Vector Quantizer
Correct option is C
28. A quantizer that has nonuniform intervals is called

A. nonuniform quantizer
B. uniform quantizer
C. midrise quantizer
Correct option is A
29. A nonuniform quantizer provides __________ average distortion.

A. higher
B. lower
C. Both higher and lower
5 of 11 27-07-2021, 18:14
Correct option is B
30. The mean values of the input and output of a Lloyd-Max quantizer are
A. equal
B. Unequal
C. Zero
Correct option is A
31. For a given Lloyd-Max quantizer, the variance of the output is always
__________ the variance of the input.
A. equal to
B. less than or equal to
C. less than
D. greater than or equal to
Correct option is B
32. For a given Lloyd-Max quantizer, the quantizer output and the quantization
noise are ________.
A. diagonal
B. square
C. orthogonal
D. parallel
Correct option is C
33. In Companded quantization, the compressor function ___________the high-

probability regions close to the origin.
A. compresses
B. stretches
C. expands
D. all of the above
Correct option is B
34. In Companded quantization, the compressor function ____________the low-

probability regions away from the origin.
A. compresses
B. stretches
C. expands
D. all of the above
Correct option is A
35. Which of the following characterizes a quantizer?

A. Quantization results in a non-reversible loss of information
B. A quantizer always produces uncorrelated output samples
C. The output of a quantizer has the same entropy rate as the input
Correct option is A
6 of 11 27-07-2021, 18:14
What is the signal-to-noise ratio (SNR)?

A. The ratio of the average squared value of the source output and the squared
error of the source output
B. The ratio of the average squared value of the source output and the mean
squared error of the source output
C. The ratio of the average squared value of the source output and the absolute
difference measure of the source output
Correct option is B
The output signal of a scalar quantizer has property

A. The output is a discrete signal with a finite symbol alphabet
B. The output is a discrete signal with a countable symbol alphabet (but not
necessarily a finite symbol alphabet)
C. The output signal may be discrete or continuous
Correct option is B
What is a Lloyd quantizer?

A. For a given source, the Lloyd quantizer is the best possible scalar quantizer in
ratedistortion That means, there does not exist any other scalar quantizer that
yields a smaller distortion at the same rate.
B. The output of a Lloyd quantizer is a discrete signal with a uniform pmf
C. Both (A) and (B)
D. A Lloyd quantizer is the scalar quantizer that yields the minimum distortion
for a given source and a given number of quantization
Correct option is D
Which of the following statement is correct for comparing scalar

quantization and vector quantization?
A. Vector quantization improves the performance only for sources with memory.
For iid sources, the best scalar quantizer has the same efficiency as the best
vector quantizer
B. Vector quantization does not improve the rate-distortion performance relative
to scalar quantization, but it has a lower complexity
C. By vector quantization we can always improve the rate-distortion performance
relative to the best scalar quantizer
D. All of the above
Correct option is C
If {x}n is the source output and {y}n is the reconstructed sequence, then
the squared error measure is given by
A. d(x, y) = (y – x)2
B. d(x, y) = (x – y)2
C. d(x, y) = (y + x)2
D. d(x, y) = (x – y)4
Correct option is B
If {x}n is the source output and {y}n is the reconstructed sequence, then
the absolute difference measure is given by
A. d(x, y) = |y – x|
B. d(x, y) = |x – y|
C. d(x, y) = |y + x|
D. d(x, y) = |x – y|2
Correct option is B
The process of representing a possibly infinite set of values with a

much set is called quantization
A. Large, smaller
7 of 11 27-07-2021, 18:14
B. Smaller, large
C. None of these
Correct option is A
The set of inputs and outputs of a quantizer can be

A. Only scalars
B. Only vectors
C. Scalars or vectors
D. None of these
Correct option is C
Which of the folowing is/are correct for uniform quantizer

A. The simplest type of quantizer is the uniform quantizer
B. All intervals are the same size in the uniform quantizer, except possibly for the
two outer intervals
C. The decision boundaries are spaced evenly
D. All of the above
Correct option is D
If a Zero is assigned a decision level, then what is the type of quantizer?

A. A midtread quantizer
B. A midrise quantizer
C. A midtreat quantizer
Correct option is B
If a Zero is assigned a quantization level, then what is the type of

quantizer?
A. A midtread quantizer
B. A midrise quantizer
C. A midtreat quantizer
Correct option is A
The main approaches to adapting the quantizer parameters:

A. An off-line or forward adaptive approach
B. An on-line or backward adaptive approach
C. Both
Correct option is C
Uniform quantizer is also called as

A. Low rise quantizer
B. High rise quantizer
C. Mid rise quantizer
Correct option is C
Non uniform quantizer

A. Decrease
B. Increase
C. Doesn’t change
Correct option is A
The spectral density of white noise is .

A. Poisson
B. Exponential
8 of 11 27-07-2021, 18:14
C. Uniform
D. Gaussian
Correct option is C
Which audio/video refers to on-demand requests for compressed

audio/video files?
a. Streaming live
b. Streaming stored
c. Interactive
Correct option is B
According to Nyquist theorem, how many times the highest frequency we

need to sample an analog signal?
a. Three
b. Two
c. Four
Correct option is B
Which encoding is based on the science of psychoacoustics, which is the

study of how people perceive sound?
A. Predictive
B. Perceptual
C. Both of the above
Correct option is B
SDH uses to measure block errors.

a. CRC
b. Rectangular code
c. bit-interleaved parity (BIP )
d. Simple parity check
Correct option is C
55. The minimum sampling rate is called?

a. Data rate
b. symbol rate
c. Nyquist rate
Correct option is C
Spread spectrum is used for

a. Encrypting signal
b. Hiding signal
c. Encrypting & Hiding signal
d. None of the mentioned
Correct option is C
Which is a quantization process?

a. Rounding
b. Truncation
c. Rounding & Truncation
Correct option is C
. Quantization is a……………..process.
a. Non linear
9 of 11 27-07-2021, 18:14
b. Reversible
c. Non linear & Reversible
Correct option is C
The mutual information between a pair of events is

a. Positive
b. Negative
c. Zero
d. All of the mentioned
Correct option is D
The SNR value can be increased by the number of levels.

A. Increasing
B. Decreasing
C. Does not depend on
D. None of the mentioned
Correct option is A
1 bit quantizer is a
a. Hard limiter
b. Two level comparator
c. Hard limiter & Two level comparator
Correct option is C
The low pass filter at the output end of delta modulator depends on
a. Step size
b. Quantization noise
c. Bandwidth
Correct option is C
Quantization Matrix in JPEG compression was introduced because

a. It is computationally more efficient to work with matrix than with scalar
quantization;
b. It allows better entropy encoding due to DC and AC coefficient distribution
in the 8×8 block matrix;
c. It allows better differentiation of DC and AC coefficients in the 8×8 block
matrix than a scalar quantization;
Correct option is C
What property has the output signal of a scalar quantizer

A. The output is a discrete signal with a countable symbol alphabet (but not
necessarily a finite symbol alphabet).
B. The output is a discrete signal with a finite symbol
C. The output signal may be discrete or continuous
Correct option is A
10 of 11 27-07-2021, 18:14
← →
Comment as:
Publish Notify me
Search
11 of 11 27-07-2021, 18:14
Data Compression UNIT-1 AKTU MCQ with Solutions ~ GOEL DIG... https://www.goeldigitalsolution.com/2021/07/data-compression-unit-1-...
1. Data compression means to the file size.

जनवरी
a. Increase
b. Decrease की नई तारीख आ गई है । बेिसक िश ा
c. Can’t say बताय
d. None of the above Answer
Correct option is B
2. Data compression and encryption both work on binary
a. False
b. True
Subscribe
Correct option is B
a. To compress something by pressing it very hardly
b. To minimize the time taken for a file to be downloaded
c. To reduce the size of data to save space
d. To convert one file to another Answer
Correct option is C
4. Data compression usually works by .
a. Deleting random bits data
b. Finding repeating patterns Answer
Correct option is B
1 of 15 27-07-2021, 18:13
Followers (13)
5.
Why data compressed?
Follow
a. To optimise the data
b. To reduce secondary storage space
c. To reduce packet congestion on networks
d. Both (B) and (C)
Correct option is D
6.
Which is a type of data compression?
a. Resolution
b. Zipping
c. Inputting
d. Caching
Correct option is B
7. Data compression involves
a. Compression only
b. Reconstruction only
c. Both compression and reconstruction
Correct option is C
8. Based on the requirements of reconstruction, data compression schemes can be divided into
broad classes
a. 3
b. 4
c. 2
d. 5
Correct option is C
9. Compression is the method which eliminates the data which is not noticeable and
compression does not eliminate the data which is not
a. Lossless, lossy
b. Lossy, lossless
2 of 15 27-07-2021, 18:13
c. None of these
Correct option is B
10. Compression is generally used for applications that cannot tolerate any difference between
the original and reconstructed data.
a. Lossy
b. Lossless
c. Both
d. None of these
Correct option is B
11. What is compression ratio?
a. The ratio of the number of bits required to represent the data before compression to the
number of bits required to represent the data after
b. The ratio of the number of bits required to represent the data after compression to the number
of bits required to represent the data before
c. The ratio of the number of bits required to represent the data after reconstruction to the
number of bits required to represent the data before
d. The ratio of the number of bits required to represent the data before reconstruction to the
number of bits required to represent the data after
Correct option is A
12. Suppose storing an image made up of a square array of 256×256 pixels requires 65,536
bytes. The image is compressed and the compressed version requires 16,384 bytes. Then the
compression ratio is .
a. 1:4
b. 4:1
c. 1:2
d. 2:1
Correct option is B
13. Lossy techniques are generally used for the compression of data that originate as analog
signals, such as
a. Speech
b. Video
c. Both
d. None of these
3 of 15 27-07-2021, 18:13
Correct option is C
14. If fidelity or quality of a reconstruction is , then the difference between the reconstruction
and the original is .
a. High, small
b. Small, small
c. High, high
d. None of the above Answer
Correct option is A
15. The development of data compression algorithms for a variety of data can be divided into
______ phases.
a. 2
b. 3
c. 4
d. 5
Correct option is A
16. The difference between the original and the reconstruction is often called the_________.
a. Error
b. Distortion
c. noise
d. waveform
Correct option is B
17. The average number of bits required to represent a single sample. This is generally referred
to as the __________.
a. Bit Rate
b. Byte rate
c. Compression rate
d. All of the above
Correct option is A
18. If we say that we say that the fidelity or quality of a reconstruction is high, we mean that the
difference between the reconstruction and the original_______.
a. Is high
b. is small
4 of 15 27-07-2021, 18:13
c. average
Correct option is B
a. Lossless compression is only used in situations where lossy compression techniques can’t be
used
b. Lossy compression is best suited for situations where some loss of detail is tolerable,
especially if it will not be detectable by a human
c. Both lossy and lossless compression techniques will result in some information being lost
from the original file
d. Neither lossy nor lossless compression can actually reduce the number of bits needed to
represent a file
Correct option is B
a. Speech
b. Video
c. Text
d. Image
Correct option is C
a. MP3
b. Bitmap
c. MPEG
d. JPEG
Correct option is B
22. Information theory was given by
a. Claude von Regan
b. Claude Elwood Shannon
c. Claude Monet
d. Claude Debussy
Correct option is B
5 of 15 27-07-2021, 18:13
23. The unit of information depends on the base of the log. If we use log base 2, the unit is ; if
we use log base e, the unit is ; and if we use log base 10, the unit is
a. Hartleys, nats, bits
b. Hartleys, bits, nats
c. Bits, nats, hartleys
d. Bits, hartleys, nats
Correct option is C
24. According to Claude Elwood Shannon’s second theorem, it is not feasible to transmit
information over the channel with error probability, although by using any coding technique?
a. Large
b. May be large or small
c. Unpredictable
d. Small
Correct option is D
25. The essential condition/s for a good error control coding technique?
a. Better error correcting capability
b. Maximum transfer of information in bits/sec
c. Faster coding & decoding methods
d. All of the above
Correct option is D
26. The prefix code is also called as
a. Block code
b. Convolutional code
c. Parity code
d. Instantaneous code
Correct option is D
27. Self information should be .
a. Negative
b. Positive
c. Both a and b
d. None of these
6 of 15 27-07-2021, 18:13
Correct option is B
28. A code in which no codeword is a prefix to another codeword is called as
a. Prefix code
b. Parity code
c. Convolutional code
d. Block code
Correct option is A
29. The set of binary sequences is called a_______ , and the individual members of the set are
called ____________.
a. Codewords, code
b. Code, codewords
c. None of these
Correct option is B
30. Full form of ASCII is
a. American Standard Code for Information Intercaste
b. American Standard Codewords for Information Interchange
c. American Standard Code for Information Interchange
d. American System Code for Information Interchange
Correct option is C
31. Composite source models is a combination or composition of several sources. In which how
many source being active at any given time?
a. All
b. Only one
c. Only first three
d. None of these
Correct option is B
32. For models used in lossless compression, we use a specific type of Markov process called
a. Continous time Markov chain
b. Discrete time Markov chain
c. Constant time Markov chain
7 of 15 27-07-2021, 18:13
Correct option is B
33. Markov model is often used when developing coding algorithms for
a. Speech
b. Image
c. Both
d. None of these
Correct option is C
34. Which of the following compression type is supported by SQL Server 2014?
a. Row
b. Column
c. Both row and column
Correct option is C
35. Point out the correct statement:
a. The details of data compression are subject to change without notice in service packs or
subsequent releases
b. Compression is not available for system tables
c. If you specify a list of partitions or a partition that is out of range, an error will be generated
d. All of the mentioned
Correct option is D
36. In which type of Data Compression, the integrity of the data is preserved?
a. Lossy Compression
b. Lossless Compression
c. Both of the above
Correct option is B
37. Which of the following are Lossless methods?
a. Run-length
b. Huffman
8 of 15 27-07-2021, 18:13
c. Lempel Ziv
d. All of the above
Correct option is D
38. Which of the following are lossy methods?
a. JPEG
b. MPEG
c. MP3
d. All of the above
Correct option is D
39. In how many parts we can divide audio and video services into broad categories?
a. Two
b. Three
c. Four
Correct option is B
a. code word
b. word
c. byte
d. nibble
Correct option is A
41. Data compression means to decrease the file size
a. True
b. False
Correct option is A
a. To convert one file to another
b. To reduce the size of data to save space
c. To minimize the time taken for a file to be downloaded
d. To compress something by pressing it very hard
9 of 15 27-07-2021, 18:13
Correct option is B
43. Compression in general makes it _______ to send, upload and stream data
a. Quicker
b. Slower
Correct option is A
44. _______ is the process of encoding information using fewer bits than the original
representation
a. Data loss
b. Data compression
c. Data transmit
d. Data gain
Correct option is B
Explanation: Data compression is the process of encoding information using fewer bits than the
original representation
45. How many types of compression there?
a. 4
b. 3
c. 2
d. 5
Correct option is C
Explanation: There are two kinds of compression: Lossless and Lossy
46. Which compression loses data?
a. Lossy compression
b. Lossless compression
c. Both A and B
Correct option is A
Explanation: Lossy compression loses data, while lossless compression keeps all the data. With
lossless compression we don't get rid of any data
47. Which of the following is Lossless Data Compression Algorithms?
a. LZ77
10 of 15 27-07-2021, 18:13
b. LZR
c. DEFLATE
d. All of the above
Correct option is D
Explanation: All of the above are Lossless Data Compression Algorithms.
48. Lossy compression reduces bits by removing unnecessary or less important information
A. TRUE
B. FALSE
C. Can be true or false
D. Can not say
Correct option is A
Explanation: True, Lossy compression reduces bits by removing unnecessary or less important
information
49. Which of the following is true about Lempel–Ziv–Welch (LZW) algorithm?
A. Optimized for compressing plain text
B. Used by GIF images and Unix's compress utility
C. Used by WinRAR in tandem with Huffman coding
D. used by ZIP, gzip, and PNG images
Correct option is B
Explanation: Lempel–Ziv–Welch (LZW) : Used by GIF images and Unix's compress utility
50. Which of the following algorithms has very high compression ratio, used by 7zip and xz?
a. LZSS
b. LZO
c. LZMA
d. LZW
Correct option is C
Explanation: Lempel–Ziv–Markov chain algorithm (LZMA) : Very high compression ratio,

used by 7zip and xz
51. Lossy image compression is used in digital cameras, to increase storage capacities
a. Yes
b. No
11 of 15 27-07-2021, 18:13
c. Can be yes or no
d. Can not say
Correct option is A
Explanation: Yes, Lossy image compression is used in digital cameras, to increase storage
capacities
52. Uncompressed video requires a ________ data rate.
a. high
b. low
c. medium
d. very high
Correct option is D
Explanation: Uncompressed video requires a very high data rate.
53. In the _________ phase we try to extract information about any redundancy that exists in
the data and describe the redundancy in the form of a model.
a. Coding
b. Modeling
c. Distortion
d. Fidelity and Quality
Correct option is B
54. A description of the model and a “description” of how the data differ from the model are
encoded, is called
a. Modeling
b. Coding
c. Testing
d. Maintainence
Correct option is A
55. Consider the following sequence: 1 2 3 2 3 4 5 4 5 6 7 8 9 8 9 10. The entropy can then be
calculated as________.
a. 3.25 bits/sample.
b. 3 bits/sample.
c. 2.25 bits/sample.
d. 5.25 bits/sample.
12 of 15 27-07-2021, 18:13
Correct option is A
56. Suppose A and B are two independent events. The self-information associated with the
occurrence of both event A and event B is……………
a. i(AB)= i(A) * i(B)
b. i(AB)= i(A) + i(B)
c. i(AB)= i(A) / i(B)
d. i(AB)= i(A)
Correct option is B
57. There are several approaches to building mathematical models such as:
a. Proboability Model, Physical Model
b. Markov Model and Composite Source Model
c. Both a and b are correct
Correct option is c
58. The set of binary sequences is called a code, and the individual members of the set are
called …....
a. Coding.
b. Code length
c. Code words
d. Letters
Correct option is C
59. Determine whether the following codes are uniquely decodable:
Code 1: { 0, 01, 11}, Code 2: {0, 01, 10}
a. Both codes code1 and code 2 are uniquely decodable
b. Code1 is uniquely decodable
c. Code2 is uniquely decodable
d. Neither code1 or code2 are uniquely decodables.
Correct option is B
60. A code in which no codeword is a prefix to another codeword is called a…………..
a. Root Code
13 of 15 27-07-2021, 18:13
b. Prefix Code
c. Huffman Code
d. Binary Code
Correct option is B
61. The Difference between Entropy and Average Length is called:
a. Self Information
b. Redundancy
c. Probability
d. None of these
Correct option is B
62. ASCII code uses the same number of bits to represent each symbol such a code
is called
a. fixed-length code
b. Variable Length Code
c. Fixedexd Code
Correct option is A
← →
14 of 15 27-07-2021, 18:13
Comment as:
Publish Notify me
Search
15 of 15 27-07-2021, 18:13
1. Huffman codes are codes and are optimum for a given model (set of probabilities). जनवरी
A. Parity
B. Prefix
C. Convolutional code िवभाग की अित र मु सिचव रे णु का कुमार ने सोमवार को
D. Block code बताय
Correct option is B
2. The Huffman procedure is based on observations regarding optimum prefix codes,

which is/are
A. In an optimum code, symbols that occur more frequently (have a higher
probability of occurrence) will have shorter code words than symbols that occur less
B. In an optimum code,the two symbols that occur least frequently will have the same
length
C. Both (A) and (B) Subscribe
D. None of these
Correct option is C
3. The best algorithms for solving Huffman codes
A. Brute force algorithm

B. Divide and conquer algorithm
C. Greedy algorithm
D. Exhaustive search
Correct option is C
4. How many printable characters does the ASCII character set consists of?
A. 128
B. 100
C. 98
D. 90
Correct option is B
5. The difference between the entropy and the average length of the Huffman code is
called
1 of 8 27-07-2021, 18:13
A. Rate Followers (13)

B. Redundancy
C. Power
D. None of these
Correct option is B Follow
6. Unit of redundancy is
A. bits/second
B. symbol/bits
C. bits/symbol
D. none of these
Correct option is C
7. The redundancy is zero when
A. The probabilities are positive powers of two

B. The probabilities are negative powers of two
C. Both
Correct option is B
A. Sixth
B. Seventh
C. Eighth
D. Ninth
Correct option is C
9. Bits are needed for standard encoding if the size of the character set is X
A. X+1
B. log(X)
C. X2
D. 2X
Correct option is B
10. In Huffman coding, data in a tree always occur in
A. Leaves
B. Roots
C. Left sub trees
D. None of these
Correct option is A
11. An optimal code will always be present in a full tree?
A. True
B. False
Correct option is A
12. Running time of the Huffman encoding algorithm is
A. O(Nlog(C))
B. O(Clog(C))
C. O(C)
D. O(log(C)) Answer
2 of 8 27-07-2021, 18:13
Correct option is B
13. Running time of the Huffman algorithm, if its implementation of the priority queue is
done using linked lists
A. O(log(C))
B. O(Clog(C))
C. O(C2)
D. O(C)
Correct option is C
14. The unary code for a positive integer n is simply n followed by a .
A. zero, ones
B. ones, zero
C. None of these
Correct option is B
15. The unary code for 4 is .
A. 11100
B. 11110
C. 00001
D. 00011
Correct option is B
16. In the Tunstall code, all codewords are of However, each codeword represents a
number of letters.
A. different, equal
B. equal, different
C. none of these
Correct option is B
17. Tunstall coding is a form of entropy coding used for
A. Lossless data compression

B. Lossy data compression
C. Both
D. None of these
Correct option is A
18. The main advantage of a Tunstall code is that
A. Errors in codewords do not propagate

B. Errors in codewords propagate
C. The disparity between frequencies
D. None of these
Correct option is A
19. Applications of Huffman Coding
A. Text compression
B. Audio compression
C. Lossless image compression
D. All of the above
Correct option is D
3 of 8 27-07-2021, 18:13
20. An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) =
0.4, P(B)= 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is
A. A = 1 B = 011 C = 010 D = 00
B. A = 0 B = 11 C = 10 D = 111
C. A = 0 B = 111 C = 11 D = 101
D. A = 01 B = 111 C = 110 D = 10
Correct option is A

B. compress data by using fewer bits to encode more frequently occuring characters
Correct option is B

B. broadband systems
C. files greater than 1 Mbit
Correct option is A
23. A Huffman encoder takes a set of characters with fixed length and produces a set of
characters of
A. random length
B. fixed length
C. variable length
D. constant length
Correct option is C
A. A Huffman code: A = 1, B = 000, C = 001, D = 01 , P(A) = 0.4, P(B) = 0.1, P(C) = 0.2,
P(D) = 0.3 The average number of bits per letter is
a. 8.0 bit
b. 1.9 bit
c. 2.0 bit
d. 2.1 bit
Correct option is b
25. Which of the following is not a part of the channel coding?

A. rectangular code
B. Checksum checking
C. Hamming code
D. Huffman code
Correct option is D
26. Which of the following is the first phase of JPEG?

A. DCT Transformation
B. Quantization
C. Data Compression
Correct option is D
27. Which type of method is used is used to compress data made up of combination of
symbols?
A. Run- length encoding
B. Huffman encoding
C. Lempel Ziv encoding
D. JPEG encoding
4 of 8 27-07-2021, 18:13
Correct option is A
28. How many passes does lossy compression makes frequently?

A. One pass
B. Two pass
C. Three pass
D. Four pass
Correct option is B
29. Information is the

A. data
B. meaningful data
C. raw data
D. Both A and B
Correct option is B
≥ ≤
5 of 8 27-07-2021, 18:13
6 of 8 27-07-2021, 18:13
7 of 8 27-07-2021, 18:13
← →
Comment as:
Publish Notify me
Search
8 of 8 27-07-2021, 18:13
Data Compression UNIT-3 MCQ Questions AKTU ~ GOEL DIGITA... https://www.goeldigitalsolution.com/2021/07/data-compression-unit-3...
जनवरी

बताय
1. In dictionary techniques for data compaction, which approach of building dictionary is

used for the prior knowledge of probability of the frequently occurring patterns?
A. Adaptive dictionary
B. Static dictionary
C. Both
Subscribe
Correct option is B
2. If the probability of encountering a pattern from the dictionary is p, then the average
number of bits per pattern R is given by
A. R=21-12p
B. R=9-p
C. R=21-p
D. R=12-p
Correct option is A
3. Static dictionary –
A. permanent
B. sometimes allowing the addition of strings but no deletions
C. allowing for additions and deletions of strings as new input symbols are being read
D. Both (A) and (B)
E. Both (A) and (C)
Correct option is D
4. Adaptive dictionary –
1 of 8 27-07-2021, 18:14
A. holding strings previously found in the input stream Followers (13)

B. sometimes allowing the addition of strings but no deletions
C. allowing for additions and deletions of strings as new input symbols are being read
D. Both (A) and (B)
E. Both (A) and (C)
Follow
Correct option is E
5. LZ77 and LZ78 are the two algorithms published in papers by Abraham Lempel and
Jacob Ziv in 1977 and 1978
A. Lossy data compression

B. Lossless data compression
C. Both
Correct option is B
6. Deflate =………….
A. LZ78 + Huffman
B. LZ77 + Huffman
C. LZW + Huffman
D. None of these
Correct option is B
7. Full form of GIF
A. Graphics Interchange Form

B. Graphics Inter Format
C. Graphics Interchange Format
D. Graphics Interact Format
Correct option is C
8. LZ78 has compression but very decompression than
A. fast, slow
B. slow, fast
C. None of these
Correct option is B
9. Compression packages which use an LZ77-based algorithm followed by a variable-

length coder.
A. PKZip
B. Zip
C. PNG
D. All of the above
Correct option is D
10. Application of LZW
A. GIF
B. Zip
C. PNG
D. All of the above
Correct option is A
11. Algorithm used for solving temporal probabilistic reasoning
2 of 8 27-07-2021, 18:14
A. Depth-first search
B. Hidden markov model
C. Hidden markov model
D. Breadth-first search
Correct option is C
12. Where does the Hidden Markov Model is used?
A. Understanding of real world

B. Speech recognition
C. Both
Correct option is B
13. A coding scheme that takes advantage of long runs of identical symbols is called as
A. Move-to-front coding
B. Binary coding
C. Huffman coding
D. Move-to-back coding
Correct option is A

A. simple basic functions
B. sinus functions
C. lines
D. square functions
Correct option is A
15. In a typical picture, most pixels will be

A. equal
B. very different to their neighbors
C. bright
D. very similar to their neighbors
Correct option is C
A. 2:1
B. 200:1
C. 2000:1
D. 20:1
Correct option is B

A. Fourier transform
B. Wavelets
C. DCT
D. Dolby
Correct option is B
18. Which is the image processing technique used to improve the quality of image for
human viewing?
A. compression
B. enhancement
C. restoration
D. analysis
Correct option is B
3 of 8 27-07-2021, 18:14
19. To remove archival compression and restore the data to column store compression
A. Use ALTER TABLE
B. Use ALTER COLUMN
C. Use ALTER DATABASE
D. All of the mentioned
Correct option is A
20. Point out the wrong

A. You can enable or disable ROW or PAGE compression in online state only
B. When you are compressing indexes, leaf-level pages can be compressed with both
row and page compression
C. Non–leaf-level pages do not receive page compression
D. None of the mentioned
Correct option is A
21. What is image?

A. Picture
B. Matrix of pixel
C. Collection of pixel
D. All of these
Correct option is D
22. An image transmitted using wireless network:

A. corrupted as a result of lighting or other atmospheric
B. non-corrupted as a result of lighting or other atmospheric
C. corrupted as a result of pixel
D. none of above
Correct option is A
Which of the following is true about Lempel–Ziv–Welch (LZW) algorithm?
4 of 8 27-07-2021, 18:14
5 of 8 27-07-2021, 18:14
6 of 8 27-07-2021, 18:14
← →
7 of 8 27-07-2021, 18:14
Comment as:
Publish Notify me
Search
8 of 8 27-07-2021, 18:14

Data Compression: Multiple Choice Questions On

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Compression: Multiple Choice Questions On

Uploaded by

Copyright:

Available Formats

Multiple Choice Questions on Data Compression

Multiple Choice Questions

1|Page University Academy www.universityacademy.in , info@universityacademy.in

1. Data compression means to ______ the file size.

2. Data compression and encryption both work on binary code.

4. Data compression usually works by _______.

5. Why data compressed?

6. Which is a type of data compression?

7. Data compression involves

2|Page University Academy www.universityacademy.in , info@universityacademy.in

11. What is compression ratio?

3|Page University Academy www.universityacademy.in , info@universityacademy.in

(A) High, small

18. Which of the following are not in a compressed format?

19. Information theory was given by

4|Page University Academy www.universityacademy.in , info@universityacademy.in

23. The prefix code is also called as

24. Self information should be _____.

25. A code in which no codeword is a prefix to another codeword is called as

27. Full form of ASCII.

5|Page University Academy www.universityacademy.in , info@universityacademy.in

(C) American Standard Code for Information Interchange

31.Which of the following compression type is supported by SQL Server 2014?

32.Point out the correct statement.

6|Page University Academy www.universityacademy.in , info@universityacademy.in

(D) None of the above

34. Which of the following are Lossless methods?

37. Sequence of code assigned is called

7|Page University Academy www.universityacademy.in , info@universityacademy.in

3. The best algorithms for solving Huffman codes

8|Page University Academy www.universityacademy.in , info@universityacademy.in

7. The redundancy is zero when

8. Which bit is reserved as a parity bit in an ASCII set?

10. In Huffman coding, data in a tree always occur in

11. An optimal code will always be present in a full tree.

12. Running time of the Huffman encoding algorithm is

9|Page University Academy www.universityacademy.in , info@universityacademy.in

15. The unary code for 4 is ______.

17. Tunstall coding is a form of entropy coding used for

18. The main advantage of a Tunstall code is that

19. Applications of Huffman Coding

10 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

21. The basic idea behind Huffman coding is to

22. Huffman coding is an encoding algorithm used for

11 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

25. Which of the following is not a part of the channel coding?

12 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

13 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

7. Full form of GIF.

9. Compression packages which use an LZ77-based algorithm followed by a variable-length coder.

10. Application of LZW

11. Algorithm used for solving temporal probabilistic reasoning

12. Where does the Hidden Markov Model is used?

14 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

14. The idea with wavelets is to represent a complicated function by

15.In a typical picture, most pixels will be

16. Without losing quality, JPEG-2000 can achieve compression ratios of

17. The best visual compression quality is achieved using

15 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

16 | P a g e University Academy www.universityacademy.in , info@universityacademy.in

2. What is the signal-to-noise ratio (SNR)?

3. The output signal of a scalar quantizer has property