8/1/2021 dcq.

html

Data Compression Online MCQ Test

1. Data compression means to the file size.

Increase
Decrease
Can’t say
None of the above

1. Data compression and encryption both work on binary

False
True

1. What is compression?

To compress something by pressing it very hardly

To minimize the time taken for a file to be downloaded
To reduce the size of data to save space
To convert one file to another

1. Data compression usually works by          .

Deleting random bits of data

Finding repeating patterns

1. Why data compressed?

A. To optimize the data

B. To reduce secondary storage space
C. To reduce packet congestion on networks
D. Both (B) and (C) 

1. Which is a type of data compression?

Resolution
Zipping
Inputting
Caching 

1. Data compression involves

Compression only
Reconstruction only
Both compression and reconstruction
None of the above 

1. Based on the requirements of reconstruction, data compression schemes can be divided into  broad
classes

3
4
2
5 

file:///C:/Users/STATISTICAL OFFICER/Desktop/dcq.html 1/6

8/1/2021 dcq.html

1. compression is the method that eliminates the data which is not noticeable and  ____ compression
does not eliminate the data which is not

Lossless, lossy
Lossy, lossless
None of these 

>
1. Compression is generally used for applications that cannot tolerate any difference between the
original and reconstructed data.

Lossy
Lossless
Both
None of these 

>
1. What is compression ratio?

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
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
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
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

>
1. 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             .

1:4
4:1
1:2
2:1

>
1. Lossy techniques are generally used for the compression of data that originate as analog signals,
such as

Speech
Video
Both
None of these 

>
1. If fidelity or quality of reconstruction is____, then the difference between the reconstruction and the
original is____ .

High, small
Small, small
High, high
None of the above
file:///C:/Users/STATISTICAL OFFICER/Desktop/dcq.html 2/6
8/1/2021 dcq.html

>
1. The development of data compression algorithms for a variety of data can be divided into  

2
3
4
5 

>
1. Which of the following is true of lossy and lossless compression techniques?

Lossless compression is only used in situations where lossy compression techniques can’t be used
Lossy compression is best suited for situations where some loss of detail is tolerable, especially if it
will not be detectable by a human
Both lossy and lossless compression techniques will result in some information being lost from the
original file
Neither lossy nor lossless compression can actually reduce the number of bits needed to represent a file

>
1. Which of the following would not be suitable for Lossy Compression?

Speech
Video
Text
Image

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

MP3
Bitmap
MPEG
JPEG

>
1. Information theory was given by

Claude von Regan

Claude Elwood Shannon
Claude Monet
Claude Debussy 

>
1. 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 ____.

Hartleys, nats, bits

Hartleys, bits, nats
Bits, nats, hartleys
Bits, hartleys, nats

>
1. 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?

file:///C:/Users/STATISTICAL OFFICER/Desktop/dcq.html 3/6

8/1/2021 dcq.html

Large
May be large or small
Unpredictable
Small 

>
1. The essential condition/s for a good error control coding technique?

Better error-correcting capability

Maximum transfer of information in bits/sec
Faster coding & decoding methods
All of the above 

>
1. The prefix code is also called as

Block code
Convolutional code
Parity code
Instantaneous code 

>
1. Self information should be .

Negative
Positive
Both
None of these 

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

Prefix code
Parity code
Convolutional code
Block code 

>
1. The set of binary sequences is called a____, and the individual members of the set are called_____.   
  

Codewords, code
Code, codewords
None of these

>
1. Full form of ASCII is

American Standard Code for Information Intercaste

American Standard Codewords for Information Interchange
American Standard Code for Information Interchange
American System Code for Information Interchange

>

file:///C:/Users/STATISTICAL OFFICER/Desktop/dcq.html 4/6

8/1/2021 dcq.html

1. Composite source models is a combination or composition of several sources. In which how many
source being active at any given time?

All
Only one
Only first three
None of these 

>
1. For models used in lossless compression, we use a specific type of Markov process called a

Continuous-time Markov chain

Discrete-time Markov chain
Constant time Markov chain
None of the above 

>
1. Markov model is often used when developing coding algorithms for

Speech
Image
Both
None of these 

>
1. Which of the following compression type is supported by SQL Server 2014?
Row
Column
Both row and column
None of the mentioned 

>
1. Point out the correct statement:

The details of data compression are subject to change without notice in service packs or subsequent
releases
Compression is not available for system tables
If you specify a list of partitions or a partition that is out of range, an error will be generated
All of the mentioned

>
1. In which type of Data Compression, the integrity of the data is preserved?
Lossy Compression
Lossless Compression
Both of the above
None of the above 

>
1. Which of the following are Lossless methods?
Run-length
Huffman
Lempel Ziv
All of the above

>
file:///C:/Users/STATISTICAL OFFICER/Desktop/dcq.html 5/6
8/1/2021 dcq.html

1. Which of the following are lossy methods?

JPEG
MPEG
MP3
All of the above 

>
1. In how many parts we can divide audio and video services into broad categories?
Two
Three
Four
None of the above 

>
1. The sequence of code assigned is called
codeword
word
byte
nibble

38. Huffman codes are codes and are optimum for a given model (set of probabilities).

Parity
Prefix
Convolutional code
Block code 

39. The Huffman procedure is based on observations regarding optimum prefix codes, which is

 In an optimum code, symbols that occur more frequently (have a higher probability of occurrence) will
have shorter codewords than symbols that occur less
In an optimum code, the two symbol that occurs least frequently will have the same length
Both (A) and (B)
None of these

40. The best algorithms for solving Huffman codes

Brute force algorithm

Divide and conquer algorithm
Greedy algorithm
Exhaustive search 

Note: If you can find any error, please comment on the given below.

file:///C:/Users/STATISTICAL OFFICER/Desktop/dcq.html 6/6