Quiz  /  Data compression Gate & PSU MCQ Questions With Answers

  • 1. 
    ___ Bits are needed for standard encoding if the size of the character set is X

  • X+1
  • log(X)
  • X2
  • 2X

  • 2. 
    In dictionary techniques for data compaction, which approach of building dictionary is used for the prior knowledge of probability of the frequently occurring patterns?

  • Adaptive dictionary
  • Static dictionary
  • Both
  • None of the above

  • 3. 
    LZ77 and LZ78 are the two algorithms used for

  • Lossy data compression
  • Lossless data compression
  • Both
  • None of the above

  • 4. 
    Full form of GIF

  • Graphics Interchange Form
  • Graphics Inter Format
  • Graphics Interchange Format
  • Graphics Interact Format

  • 5. 
    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 = 0 B = 111 C = 110 D = 10
  • A = 0 B = 11 C = 10 D = 111
  • A = 0 B = 111 C = 11 D = 101
  • A = 01 B = 111 C = 110 D = 10

  • 6. 
    Huffman coding is an encoding algorithm used for

  • lossless data compression
  • broadband systems
  • files greater than 1 Mbit
  • lossy data compression

  • 7. 
    Which of the following is the first phase of JPEG?

  • DCT Transformation
  • Quantization
  • Data Compression
  • None of the above

  • 8. 
    Adaptive dictionary –

  • holding strings previously found in the input stream
  • sometimes allowing the addition of strings but no deletions
  • allowing for additions and deletions of strings as new input symbols are being read
  • Both (A) and (B)
  • Both (A) and (C)

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

  • PKZip
  • Zip
  • PNG
  • All of the above

  • 10. 
    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 codeword length is

  • 6
  • 3.1
  • 5.2
  • 2.1

  • 11. 
    Application of LZW

  • GIF
  • Zip
  • PNG
  • All of the above

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

  • simple basic functions
  • sinus functions
  • lines
  • square functions

  • 13. 
    The redundancy is zero when

  • The probabilities are positive powers of two
  • The probabilities are negative powers of two
  • Both
  • None of the above

  • 14. 
    A Huffman encoder takes a set of characters with fixed length and produces a set of characters of

  • random length
  • fixed length
  • variable length
  • constant length

  • 15. 
    Information is the

  • data
  • meaningful data
  • raw data
  • Both A and B

  • 16. 
    The basic idea behind Huffman coding is to

  • compress data by using fewer bits to encode fewer frequently occuring characters
  • compress data by using fewer bits to encode more frequently occuring characters
  • compress data by using more bits to encode more frequently occuring characters
  • expand data by using fewer bits to encode more frequently occuring characters

  • 17. 
    LZ78 has ___ compression but very ____ decompression.

  • fast, slow
  • slow, fast
  • None of these
  • All of above

  • 18. 
    Applications of Huffman Coding

  • Text compression
  • Audio compression
  • Lossless image compression
  • All of the above
Report Question
warning
access_time
  Time