Dale - Computer Science Illuminated 108

# Dale - Computer Science Illuminated 108 - a four bits b...

This preview shows page 1. Sign up to view the full content.

Exercises 81 Multimedia pg. 52 Overflow pg. 60 Pixels pg. 76 Pulse-code modulation pg. 55 Radix point pg. 61 Raster-graphics format pg. 76 Reclock pg. 55 Resolution pg. 76 Run-length encoding pg. 68 Scientific notation pg. 62 Sign-magnitude representation pg. 57 Spatial compression pg. 78 Temporal compression pg. 78 Ten’s complement pg. 59 Vector graphics pg. 77 Video codec pg. 78 Exercises 1. What is data compression and why is it an important topic today? 2. What is the difference between lossless and lossy data compression? 3. Why do computers have difficulty with analog information? 4. Is a clock with a sweeping second hand an analog or a digital device? Explain. 5. What does it mean to digitize something? 6. What is pulse-code modulation? 7. How many things can be represented with:
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a. four bits. b. five bits. c. six bits. d. seven bits. 8. Although you have been computing simple arithmetic operations since the second grade, take the following small test to confirm that you thoroughly understand operations on signed integers. Evaluate the following expressions, where W is 17, X is 28, Y is ± 29, and Z is ± 13. a. X + Y b. X + W c. Z + W d. Y + Z e. W ± Z f. X ± W g. Y ± W h. Z ± Y 9. Use the base-ten number line to prove the solutions to the following operations, where A is 5 and B is ± 7. a. A + B b. A ± B c. B + A d. B ± A 10. Given a fixed-sized number scheme, where k in the formula for the ten’s complement is 6 (see page 59), answer the following questions....
View Full Document

## This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online