Transforming Data into Information

(Chapter 2)
How Computers Represent Data
 Bits and bytes
 Binary numbers are made of bits
 Bit represents a switch
A byte is 8 bits
 Byte represents one character
How Computers Represent Data

 Number systems
A manner of counting
 Several different number systems exist
 Decimal number system
 Used by humans to count
 Contains ten distinct digits
 Digits combine to make larger numbers
How Computers Represent Data

Binary number system

Used by computers to count
Two distinct digits, 0 and 1
0 and 1 combine to make numbers
How Computers Represent Data
 Text based data
 Converts letters into binary
 Standard codes necessary for data transfer
 ASCII
American English symbols
 Extended ASCII
Graphics and other symbols
 Unicode
All languages on the planet
Up to 4 byte representation Page 54
Coding systems for other types of data
 Graphics data
 Most common: bitmap image
 Grid of dots: pixels
 Bits per pixel
 Audio Data
 Samples per second
 Most common: MP3 format
 Bits per sample
 Video Data
 Frames per second
Common Number Systems

Used by Used in
System Base Symbols humans? computers?
Decimal 10 0, 1, … 9 Yes No
Binary 2 0, 1 No Yes
Octal 8 0, 1, … 7 No No
Hexa- 16 0, 1, … 9, No No
decimal A, B, … F
Quantities/Counting (1 of 3)
Hexa-
Decimal Binary Octal decimal
0 0 0 0
1 1 1 1
2 10 2 2
3 11 3 3
4 100 4 4
5 101 5 5
6 110 6 6
7 111 7 7
Quantities/Counting (2 of 3)
Hexa-
Decimal Binary Octal decimal
8 1000 10 8
9 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F
Quantities/Counting (3 of 3)
Hexa-
Decimal Binary Octal decimal
16 10000 20 10
17 10001 21 11
18 10010 22 12
19 10011 23 13
20 10100 24 14
21 10101 25 15
22 10110 26 16
23 10111 27 17
Conversion Among Bases

 The possibilities:

Decimal Octal

Binary Hexadecimal
Quick Example

2510 = 110012 = 318 = 1916

Base
Binary to Decimal

Decimal Octal

Binary Hexadecimal
Binary to Decimal

 Technique


Multiply each bit by 2n, where n is the “weight” of the
bit
 The weight is the position of the bit, starting from 0 on
the right
 Add the results
Example
Bit “0”

1010112 => 1 x 20 = 1
1 x 21 =
2
0 x 22 =
0
1 x 23 =
8
0 x 24 =
0
1 x 25 =
32
Octal to Decimal

Decimal Octal

Binary Hexadecimal
Octal to Decimal

 Technique


Multiply each bit by 8n, where n is the “weight” of the
bit
 The weight is the position of the bit, starting from 0 on
the right
 Add the results
Example

7248 => 4 x 80 = 4
2 x 81 = 16
7 x 82 = 448
46810
Hexadecimal to Decimal

Decimal Octal

Binary Hexadecimal
Hexadecimal to Decimal

 Technique
 Multiply n
each bit by 16 , where n is the
“weight” of the bit
 Theweight is the position of the bit, starting
from 0 on the right
 Add the results
Example

ABC16 => C x 160 = 12 x 1 = 12

B x 161 = 11 x 16 = 176
A x 162 = 10 x 256 = 2560
274810
Decimal to Binary

Decimal Octal

Binary Hexadecimal
Decimal to Binary

 Technique
 Divide by two, keep track of the remainder
 First remainder is bit 0 (LSB, least-significant
bit)
 Second remainder is bit 1
 Etc.
Example
12510 = ?2

2 125
2 62 1
2 31 0
2 15 1
2 7 1
2 3 1
2 1 1
0 1

12510 =
11111012
Octal to Binary

Decimal Octal

Binary Hexadecimal
Octal to Binary

 Technique
 Convert each octal digit to a 3-bit equivalent
binary representation
Example
7058 = ?2

7 0 5

111 000 101

7058 = 1110001012
Hexadecimal to Binary

Decimal Octal

Binary Hexadecimal
Hexadecimal to Binary

 Technique
 Converteach hexadecimal digit to a 4-bit
equivalent binary representation
Example
10AF16 = ?2

1 0 A F

0001 0000 1010 1111

10AF16 = 00010000101011112
Decimal to Octal

Decimal Octal

Binary Hexadecimal
Decimal to Octal

 Technique
 Divide by 8
 Keep track of the remainder
Example
123410 = ?8

8 1234
8 154 2
8 19 2
8 2 3
0 2
123410 = 23228
Decimal to Hexadecimal

Decimal Octal

Binary Hexadecimal
Decimal to Hexadecimal

 Technique
 Divide by 16
 Keep track of the remainder
Example
123410 = ?16

16 1234
16 77 2
16 4 13 = D
0 4

123410 = 4D216
Binary to Octal

Decimal Octal

Binary Hexadecimal
Binary to Octal

 Technique
 Group bits in threes, starting on right
 Convert to octal digits
Example

10110101112 = ?8

1 011 010 111

1 3 2 7

10110101112 = 13278
Binary to Hexadecimal

Decimal Octal

Binary Hexadecimal
Binary to Hexadecimal

 Technique
 Group bits in fours, starting on right
 Convert to hexadecimal digits
Example

10101110112 = ?16

10 1011 1011

2 B B

10101110112 = 2BB16
Octal to Hexadecimal

Decimal Octal

Binary Hexadecimal
Octal to Hexadecimal

 Technique
 Use binary as an intermediary
Example
10768 = ?16

1 0 7 6

001 000 111 110

2 3 E

10768 = 23E16
Hexadecimal to Octal

Decimal Octal

Binary Hexadecimal
Hexadecimal to Octal

 Technique
 Use binary as an intermediary
Example
1F0C16 = ?8

1 F 0 C

0001 1111 0000 1100

1 7 4 1 4

1F0C16 = 174148
Exercise – Convert ...
Hexa-
Decimal Binary Octal decimal
33
1110101
703
1AF

Don’t use a calculator!

Skip answer Answer

Exercise – Convert …
Answer

Hexa-
Decimal Binary Octal decimal
33 100001 41 21
117 1110101 165 75
451 111000011 703 1C3
431 110101111 657 1AF
Common Powers (1 of 2)

 Power Preface Symbol Value

Base 10
10-12 pico p .000000000001

10-9 nano n .000000001

10-6 micro  .000001

10-3 milli m .001

103 kilo k 1000

106 mega M 1000000

109 giga G 1000000000

1012 tera T 1000000000000
Common Powers (2 of 2)

Power Preface Symbol Value

 Base 2
210 kilo k 1024

220 mega M 1048576

230 Giga G 1073741824

• What is the value of “k”, “M”, and “G”?

• In computing, particularly w.r.t. memory,
the base-2 interpretation generally applies
Fractions

 Binary to decimal
10.1011 => 1 x 2-4 = 0.0625
1 x 2-3 = 0.125
0 x 2-2 = 0.0
1 x 2-1 = 0.5
0 x 20 = 0.0
1 x 21 = 2.0
2.6875
Fractions
 Decimal to binary .14579
x 2
3.14579 0.29158
x 2
0.58316
x 2
1.16632
x 2
0.33264
x 2
0.66528
x 2
11.001001...
1.33056
Exercise – Convert ...
Hexa-
Decimal Binary Octal decimal
29.8
101.1101
3.07
C.82
Don’t use a calculator!

Skip answer Answer

Binary addition &
subtraction
Binary Addition (1 of 2)

 Two 1-bit values

A B A+B
0 0 0
0 1 1
1 0 1
1 1 10
“two”
Binary Addition (2 of 2)

 Two n-bit values

 Add individual bits
 Propagate carries
 E.g.,
1 1
10101 21
+ 11001 + 25
101110 46
Binary Subtraction
 Just like subtraction in any other base
 10110
 - 10010
 Difference 00100
 And when a borrow is needed. Note that the borrow
gives us 2 in the current bit position.
And a full example
 And more ripple -
In General

 When there is no borrow into the msb position, then the

subtrahend in not larger than the minuend and the result
is positive and correct.

 If a borrow into the msb does occur, then the subtrahend

is larger than the minuend.
Consider

 Now do the operation 4 – 6

 Correct difference is -2 or -0010

Two’s compliment

 But how do you represent a minus sign electronically in a

computer?
 How can you represent it such that arithmetic operations
are manageable?
 For base 2: have 2’s complement and 1’s complement
1’s Complement

 Example: 1’s compliment of 1011001

 is 0100110
2’s complement

 The 2’s complement is defined as adding 1 to the

1’s complement of a number.
 For 6 = 0110
 The 1’s complement is 1001
 The 2’s complement is 1010
Operation with 2’s complement

 Add 4 and -6
 Will use the 2’s complement of -6 or 1010
 4 0100
 -6 1010
 1110
 And taking the 2’s complement of 1110 get
0001 + 1 = 0010
A 2’s complement table for 4 bits

 Listing the values

represented.