Computer Science - Chapter 3

Analog Data

Bandwidth

Character Set

Compression Ratio

Data

Data Compression

Digital Data

Digitize

Floating Point

Huffman Encoding

Information

Keyword Encoding

Lossless Compression

Lossy Compression

Multimedia

Overflow

Pixels

Pulse-Code Modulation

Radix Point

Raster-Graphics Format

Reclock

Resolution

Run-Length Encoding

Scientific Notation

Signed-Magnitude Representation

Spatial Compression

Temporal Compression

Ten’s Complement

Vector Graphics

Video Codec

True or False: Lossless compression means the data can be retrieved without losing any of the original information.

True or False: A computer represents information in an analog form.

True or False: A computer must use the binary number system to represent information.

True or False: A digital signal represents one of two values at any point in time.

True or False: Four bits can be used to represent 32 unique things.

True or False: The signed-magnitude representation of numbers has two representations for zero.

True or False: Overflow occurs when the value that we compute cannot fit into the number of bits we have allocated for the result.

True or False: In the ASCII character set, no distinction is made between uppercase and lowercase letters.

True or False: The Unicode character set includes all of the characters in the ASCII character set.

True or False: Keyword encoding replaces frequently used words with a single character.

True or False: Run-length encoding is very good at compressing English text.

True or False: Huffman encoding uses variable-length binary strings to represent characters.

True or False: An audio signal is digitized by sampling it at regular intervals.

True or False: A CD stores audio information in a binary format.

True or False: The MP3 audio format discards information that cannot be heard by humans.

True or False: An RGB value represents a color using three numeric values.

True or False: Indexed color increases the number of colors that can be used in an image and thus increases the file size.

True or False: Bitmap, GIF, and JPEG are all examples of raster-graphics formats.

True or False: Vector graphics represent images in terms of lines and geometric shapes.

True or False: A keyframe is used in temporal compression to represent the changes from one frame to another.

______ data is a continuous representation of information.

The representation for numbers you’ve used since grade school is called ______.

If the number base is other than base 10, we call the decimal point the ______.

______ data is a discrete representation of information.

Huffman codes are created based on the ______ of the character.

An audio signal is digitized by ______ its value at regular intervals.

Why is data compression an important topic today?

What is the difference between lossless and lossy data compression?

Why do computers have difficulty with analog information?

Is a clock with a sweeping second hand an analog device or a digital device? Explain.

What does it mean to digitize something?

What is pulse-code modulation?

How many things can be represented with four bits?

How many things can be represented with five bits?

How many things can be represented with six bits?

How many things can be represented with seven bits?

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: X + Y

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: X + W

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: Z + W

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: Y + Z

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: W - Z

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: X - W

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: Y - W

Evaluate the following expression where W is 17, X is 28, Y is –29, and Z is –13: Z - Y

Use the base-10 number line to prove the solutions to the following operations, where A is 5 and B is –7: A + B

Use the base-10 number line to prove the solutions to the following operations, where A is 5 and B is –7: A - B

Use the base-10 number line to prove the solutions to the following operations, where A is 5 and B is –7: B + A

Use the base-10 number line to prove the solutions to the following operations, where A is 5 and B is –7: B - A

Evaluate the following expressions, where A is 11111110 and B is 00000010, using the two’s complement: A + B

Evaluate the following expressions, where A is 11111110 and B is 00000010, using the two’s complement: A - B

Evaluate the following expressions, where A is 11111110 and B is 00000010, using the two’s complement: B - A

Evaluate the following expressions, where A is 11111110 and B is 00000010, using the two’s complement: -B

Evaluate the following expressions, where A is 11111110 and B is 00000010, using the two’s complement: -(-A)

Is the two’s complement of a number always a negative number? Explain.

Convert the following real numbers to binary (five binary places): 0.50

Convert the following real numbers to binary (five binary places): 0.26

Convert the following real numbers to binary (five binary places): 0.10

Convert the following real numbers to octal (five octal places): 0.50

Convert the following real numbers to octal (five octal places): 0.26

Convert the following real numbers to octal (five octal places): 0.10

Can fractional values be visually converted between octal and binary and back? Explain.

How many bits would be needed to represent a character set containing 45 characters? Why?

How can the decimal number 175.23 be represented as a sign, mantissa, and exponent?

What is the main difference between the ASCII and Unicode character sets?

Given the following Huffman encoding table, decipher the bit strings that follow: 1101110001011

Given the following Huffman encoding table, decipher the bit strings that follow: 0110101010100101011111000

Given the following Huffman encoding table, decipher the bit strings that follow: 10100100101000010001000010100110110

Given the following Huffman encoding table, decipher the bit strings that follow: 10100010010101000100011101000100011

How do humans perceive sound?

Is a stereo speaker an analog device or a digital device? Explain.