Dale - Computer Science Illuminated 83

# Dale - Computer Science Illuminated 83 - bits Three bits...

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

56 Chapter 3 Data Representation Figure 3.4 Bit combinations 1 Bit 0 1 2 Bits 00 01 10 11 3 Bits 000 001 010 011 100 101 110 111 4 Bits 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 5 Bits 00000 00001 00010 00011 00100 00101 00110 00111 01000 01001 01010 01011 01100 01101 01110 01111 10000 10001 10010 10011 10100 10101 10110 10111 11000 11001 11010 11011 11100 11101 11110 11111 sometimes the mapping can be meaningful and important, as we discuss in later sections of this chapter. If we want to represent more than four things, we need more than two
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: bits. Three bits can represent eight things because there are eight combina-tions of 0 and 1 that can be made from three bits. Likewise, four bits can represent 16 things, five bits can represent 32 things, and so on. See Figure 3.4. Note that the bit combinations are simply counting in binary as you move down a column....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online