Q.1
What is data compression
  • Restructuring Data
  • Modifying Data
  • Both A & B
  • None of These
Q.2
Applications of Huffman Coding
  • Text compression
  • Audio compression
  • Lossless image compression
  • All of the above
Q.3
The idea with wavelets is to represent a complicated function by
  • simple basic functions
  • sinus functions
  • lines
  • square functions
Q.4
Advantages for lossless compression
  • The quality will not be affected much
  • Will send quicker
  • A very simple algorithm
  • All of above
Q.5
The purpose of data compression is to decrease file sizes .
  • True
  • False
Q.6
Which formula shows how to work out the percentage a file has been compressed by?
  • bits in (Huffman *7) /100
  • bits in ASCii - bits in Huffman
  • difference in bits / bits in ASCII * 100
  • None of these
Q.7
How do you calculate the number of bits of a body of text in ASCII?
  • Number of characters * 7
  • Number of characters (including spaces) *7
  • bits in Huffman * 7
  • bits in Huffman / 7
Q.8
How do you move through a Huffman tree?
  • 0 = right 1= left
  • 1 = left 2 = right
  • 0 = left 1 = right
  • 0 = middle 1 = back
Q.9
Huffman trees use the _______________ of each character to work out their encoding.
  • Frequency
  • Order in ASCII
  • Number value
  • None of these
Q.10
Lossy or lossless? This type of compression gets rid of some information
  • Lossy
  • Lossless
  • Both
  • None of these
Q.11
Lossy or lossless? This type of compression makes the file smaller
  • Lossy
  • Lossless
  • Both
  • All of above
Q.12
Which best describes Lossless Compression?
  • No information is lost but file size is increased
  • There is no loss in information at all after compression
  • Files which have the exact same data after compression
  • Compression that involves an algorithm
Q.13
Lossy or lossless? This type of compression does not get rid of any data
  • Lossy
  • Lossless
  • Both
  • All of above
Q.14
Application of LZW
  • GIF
  • Zip
  • PNG
  • All of the above
Q.15
Compression packages which use an LZ77-based algorithm followed by a variable-length coder.
  • PKZip
  • Zip
  • PNG
  • All of the above
Q.16
LZhas ___ compression but very ____ decompression.
  • fast, slow
  • slow, fast
  • None of these
  • All of above
Q.17
Full form of GIF
  • Graphics Interchange Form
  • Graphics Inter Format
  • Graphics Interchange Format
  • Graphics Interact Format
Q.18
LZand LZare the two algorithms used for
  • Lossy data compression
  • Lossless data compression
  • Both
  • None of the above
Q.19
Which of these terms is a type of data compression?
  • resolution
  • zipping
  • inputting
  • caching
Q.20
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)
0 h : 0 m : 1 s