chapter 3
3 types of compression rations
1) Keyword coding- frequently used words are replaced with a single character 2) Run Length coding- replacing a long series of a repeated character with a count of the repetition 3) Huffman Code- using a variable-length binary string to represent a character so that frequently used characters have short codes.
A computer must use the binary number system to represent information.
FALSE
A computer represents information in an analog form.
FALSE
Four bits can be used to represent 32 unique things.
FALSE
In the ASCII character set, there is no distinction made between uppercase and lowercase letters.
FALSE
Run-length encoding is very good at compressing English text.
FALSE
A CD stores audio information in a binary format.
TRUE
A digital signal represents one of two values at any point in time.
TRUE
An audio signal is digitized by sampling it at regular intervals.
TRUE
Huffman encoding uses variable-length binary strings to represent characters.
TRUE
Keyword encoding replaces frequently used words with a single character.
TRUE
Lossless compression means the data can be retrieved without losing any of the original information.
TRUE
The MP3 audio format discards information that can't be heard by humans.
TRUE
The Unicode character set includes all of the characters in the ASCII character set.
TRUE
Data Compress
reduces the size of bits needed
