Q.1.
What is data compression
Q.2.
Applications of Huffman Coding
Q.3.
The idea with wavelets is to represent a complicated function by
Q.4.
Advantages for lossless compression
Q.5.
The purpose of data compression is to decrease file sizes .
Q.6.
Which formula shows how to work out the percentage a file has been compressed by?
Q.7.
How do you calculate the number of bits of a body of text in ASCII?
Q.8.
How do you move through a Huffman tree?
Q.9.
Huffman trees use the _______________ of each character to work out their encoding.
Q.10.
Lossy or lossless? This type of compression gets rid of some information
Q.11.
Lossy or lossless? This type of compression makes the file smaller
Q.12.
Which best describes Lossless Compression?
Q.13.
Lossy or lossless? This type of compression does not get rid of any data
Q.14.
Application of LZW
Q.15.
Compression packages which use an LZ77-based algorithm followed by a variable-length coder.
Q.16.
LZhas ___ compression but very ____ decompression.
Q.17.
Full form of GIF
Q.18.
LZand LZare the two algorithms used for
Q.19.
Which of these terms is a type of data compression?
Q.20.
Adaptive dictionary –