Home / Engineering / Data Compression and Data Retrieval MCQs / Page 3
Data Compression and Data Retrieval MCQs | Page - 3
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
Q. 21) 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
M
Q. 22) The basic idea behind huffman coding is to
M
Q. 23) Huffman coding is an encoding algorithm used for
M
Q. 24) A huffman encoder takes a set of characters with fixed length and produces a set of characters of
M
Q. 25) 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
M
Q. 26) The idea with wavelets is to represent a complicated function by
M
Q. 27) Down sampling is to make a digital image file smaller by
M
Q. 28) In a typical picture, most pixels will be
M
Q. 29) Without losing quality, JPEG-2000 can achieve compression ratios of
M
Q. 30) The best visual compression quality is achieved using
Explore Sets
Data Compression and Data Retrieval MCQs Set 1
Data Compression and Data Retrieval MCQs Set 2
Data Compression and Data Retrieval MCQs Set 3
Data Compression and Data Retrieval MCQs Set 4
Data Compression and Data Retrieval MCQs Set 5
Data Compression and Data Retrieval MCQs Set 6
Data Compression and Data Retrieval MCQs Set 7
Data Compression and Data Retrieval MCQs Set 8
Explore More Categories
Click on category to learn MCQs of that category.Electronics and Communication Engineering
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
