Data Compression and Data Retrieval MCQs | Page - 2

Dear candidates you will find MCQ questions of Data Compression and Data Retrieval here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 53.08K Points
Coach 

Q. 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
(D) Option.
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. What is the correct Run-length encoding for the data: cccmmmmmsssssdcccccc

(A) 3c5m5s1d6c
(B) C3m5s5d1c6
(C) Cmsdc35516
(D) Cccmmmmmsssssdcccccc
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

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

(A) JPEG
(B) Bitmap
(C) MPEG
(D) MP3
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. Identify types of lossless compression

(A) Run length encoding
(B) Dictionary encoding
(C) Transform Coding
(D) a and b
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. Digitizing the image intensity amplitude is called

(A) Sampling
(B) Quantization
(C) Framing
(D) Both A And B
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. Compressed image can be recovered back by

(A) Image Enhancement
(B) Image Decompression
(C) Image Contrast
(D) Image Equalization
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. Digital video is sequence of

(A) Pixels
(B) Matrix
(C) Frames
(D) Coordinates
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. Coding redundancy works on

(A) Pixels
(B) Matrix
(C) Intensity
(D) Coordinates
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. 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 = 0 , B = 11 , C = 10 , D = 111
(B) A = 0 , B = 111 , C = 110 , D = 10
(C) A = 01 , B = 111 , C = 110 , D = 10
(D) A = 0 , B = 111 , C = 11 , D = 101
View Answer Discuss Share

M

Mr. Dubey • 53.08K Points
Coach 

Q. The basic idea behind huffman coding is to

(A) Compress data by using more bits to encode more frequently occurring characters
(B) Compress data by using fewer bits to encode more frequently occurring characters
(C) Expand data by using fewer bits to encode more frequently occurring characters
(D) Compress data by using fewer bits to encode fewer frequently occurring characters
View Answer Discuss Share

Jump to

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Image