Q.1
Static dictionary –
  • permanent
  • 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)
Q.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
Q.3
Which of the following is the first phase of JPEG?
  • DCT Transformation
  • Quantization
  • Data Compression
  • None of the above
Q.4
Data compression usually works by..
  • Finding repeating patterns.
  • Deleting random bits data
Q.5
A Huffman code: A =B =C =D =, P(A) = 0.P(B) = 0.P(C) = 0.P(D) = 0.3 The average codeword length is
  • 6
  • 3.1
  • 5.2
  • 2.1
Q.6
Information is the
  • data
  • meaningful data
  • raw data
  • Both A and B
Q.7
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
Q.8
Huffman coding is an encoding algorithm used for
  • lossless data compression
  • broadband systems
  • files greater than 1 Mbit
  • lossy data compression
Q.9
An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.P(B)= 0.P(C) = 0.2 and P(D) = 0.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
Q.10
Data encryption and compression both work on binary code.
  • True
  • False
Q.11
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
Q.12
Data compression means to decrease the file size
  • True
  • False
Q.13
___ Bits are needed for standard encoding if the size of the character set is X
  • X+1
  • log(X)
  • X2
  • 2X
Q.14
The redundancy is zero when
  • The probabilities are positive powers of two
  • The probabilities are negative powers of two
  • Both
  • None of the above
Q.15
350MB is how many GB?
  • 0.0035
  • 0.035
  • 0.35
  • 3.5
Q.16
Jaspreet and Mark are recording a podcast that they will be uploading to the internet so that listeners can download or stream it. What type of compression is suitable for the sound file?
  • Lossy
  • Lossless
Q.17
TRUE or FALSE: Some file formats are able to support both lossy and lossless compression
  • True
  • False
Q.18
Kara is using an app to convert printed text into e-books that she can read on her phone. What type of compression would be appropriate here?
  • Lossy
  • Lossless
Q.19
Uncompressed audio and video files require less memory than compressed files....
  • True
  • False
Q.20
When Lossy compression is used data is lost?
  • True
  • False
0 h : 0 m : 1 s