Data Compression and Data Retrieval MCQs with answers Page - 2

Here, you will find a collection of MCQ questions on Data Compression and Data Retrieval. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 802.91K Points
Coach

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

  • (A) 3c5m5s1d6c
  • (B) C3m5s5d1c6
  • (C) Cmsdc35516
  • (D) Cccmmmmmsssssdcccccc

A

Admin • 802.91K Points
Coach

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

  • (A) JPEG
  • (B) Bitmap
  • (C) MPEG
  • (D) MP3

A

Admin • 802.91K Points
Coach

Q. Identify types of lossless compression

  • (A) Run length encoding
  • (B) Dictionary encoding
  • (C) Transform Coding
  • (D) a and b

A

Admin • 802.91K Points
Coach

Q. Digitizing the image intensity amplitude is called

  • (A) Sampling
  • (B) Quantization
  • (C) Framing
  • (D) Both A And B

A

Admin • 802.91K Points
Coach

Q. Compressed image can be recovered back by

  • (A) Image Enhancement
  • (B) Image Decompression
  • (C) Image Contrast
  • (D) Image Equalization

A

Admin • 802.91K 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

A

Admin • 802.91K 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

A

Admin • 802.91K Points
Coach

Q. Huffman coding is an encoding algorithm used for

  • (A) Lossy Data Compression
  • (B) Broadband Systems
  • (C) Lossless Data Compression
  • (D) Files Greater Than 1 Mbit

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.