Chapter 2

Topic to be covered
Number system
Integer arithmetic
Floating point arithmetic
Number Base Conversions

Evaluate
Magnitude
Octal
(Base 8)

Evaluate
Magnitude
Decimal Binary
(Base 10) (Base 2)

Hexadecimal
(Base 16)
Evaluate
Magnitude
 Decimal (Integer) to Binary Conversion

 Divide the number by the ‘Base’ (=2)

 Take the remainder (either 0 or 1) as a coefficient
 Take the quotient and repeat the division

Example: (13)10
Quotient Remainder Coefficient
13/ 2 = 6 1 a0 = 1
6 /2= 3 0 a1 = 0
3 /2= 1 1 a2 = 1
1 /2= 0 1 a3 = 1
Answer: (13)10 = (a3 a2 a1 a0)2 = (1101)2

MSB LSB
 Convert the following decimal to
 A)81 B)511 C)1,024 D)3,403

 i)Binary
 ii)Octal
 iii)Hexadecimal
 Decimal (Fraction) to Binary Conversion

 Multiply the number by the ‘Base’ (=2)

 Take the integer (either 0 or 1) as a coefficient
 Take the resultant fraction and repeat the division

Example: (0.625)10
Integer Fraction Coefficient
0.625 * 2 = 1 . 25 a-1 = 1
0.25 * 2 = 0 . 5 a-2 = 0
0.5 *2= 1 . 0 a-3 = 1
Answer: (0.625)10 = (0.a-1 a-2 a-3)2 = (0.101)2

MSB LSB
Decimal to Octal Conversion
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 a0 = 7
21 / 8 = 2 5 a1 = 5
2 /8= 0 2 a2 = 2
Answer: (175)10 = (a2 a1 a0)8 = (257)8

Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 a-1 = 2
0.5 *8= 4 . 0 a-2 = 4
Answer: (0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8
 Binary − Octal Conversion
Octal Binary
 8 = 23
 Each group of 3 bits represents an 0 000
octal digit 1 001
2 010
Assume Zeros
Example: 3 011

( 1 0 1 1 0 . 0 1 )2 4 100
5 101
6 110
( 2 6 . 2 )8 7 111

Works both ways (Binary to Octal & Octal to

Binary)
 Binary − Hexadecimal Conversion
Hex Binary
 16 = 24 0 0000
1 0001
 Each group of 4 bits represents a
2 0010
hexadecimal digit 3 0011
4 0100
5 0101
Assume Zeros 6 0110
Example: 7 0111
8 1000
( 1 0 1 1 0 . 0 1 )2 9 1001
A 1010
B 1011
C 1100
D 1101
(1 6 . 4 )16 E 1110
F 1111

Works both ways (Binary to Hex & Hex to

Binary)
Octal − Hexadecimal Conversion
 Convert to Binary as an intermediate step

Example:
( 2 6 . 2 )8

Assume Zeros Assume Zeros

( 0 1 0 1 1 0 . 0 1 0 )2

(1 6 . 4 )16

Works both ways (Octal to Hex & Hex to Octal)

Decimal, Binary, Octal and Hexadecimal
Decimal Binary Octal Hex
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 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
Example

7248 => 4 x 80 = 4
2 x 81 = 16
7 x 82 = 448
46810
Example

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

B x 161 = 11 x 16 = 176
A x 162 = 10 x 256 = 2560
274810
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

 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

 Technique
 Convert each 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

 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

 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

 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

 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

 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

 Technique
 Use binary as an intermediary
Example

1F0C16 = ?8

1 F 0 C

0001 1111 0000 1100

1 7 4 1 4

1F0C16 = 174148
Common Powers (1 of 2)

 Base 10
Power Preface Symbol Value
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)

 Base 2
Power Preface Symbol Value
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
 Binary Addition

 Column Addition

1 1 1 1 1 1
1 1 1 1 0 1 = 61
+ 1 0 1 1 1 = 23

1 0 1 0 1 0 0 = 84

≥ (2)10
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”

pp. 36-38
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

 Borrow a “Base” when needed

1 2 = (10)2
0 2 2 0 0 2
1 0 0 1 1 0 1 = 77
− 1 0 1 1 1 = 23

0 1 1 0 1 1 0 = 54
 Binary Multiplication

 Bit by bit

1 0 1 1 1
x 1 0 1 0
0 0 0 0 0
1 0 1 1 1
0 0 0 0 0
1 0 1 1 1

1 1 1 0 0 1 1 0
Multiplication (2 of 3)

 Binary, two 1-bit values

A B A B
0 0 0
0 1 0
1 0 0
1 1 1
Multiplication (3 of 3)

 Binary, two n-bit values

 As with decimal values
 E.g.,

1110
x 1011
1110
1110
0000
1110
10011010
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

pp. 46-50
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
1.33056
11.001001... etc.

p. 50
 1.5 Complements
 There are two types of complements for each base-r system: the radix
complement and diminished radix complement.
 Diminished Radix Complement - (r-1)’s Complement
 Given a number N in base r having n digits, the (r–1)’s complement
of N is defined as:
(rn –1) – N
 Example for 6-digit decimal numbers:
 9’s complement is (rn – 1)–N = (106–1)–N = 999999–N
 9’s complement of 546700 is 999999–546700 = 453299
 Example for 7-digit binary numbers:
 1’s complement is (rn – 1) – N = (27–1)–N = 1111111–N
 1’s complement of 1011000 is 1111111–1011000 = 0100111
 Observation:
 Subtraction from (rn – 1) will never require a borrow
 Diminished radix complement can be computed digit-by-digit
 For binary: 1 – 0 = 1 and 1 – 1 = 0
Complements
 1’s Complement (Diminished Radix Complement)
 All ‘0’s become ‘1’s
 All ‘1’s become ‘0’s

Example (10110000)2
 (01001111)2
If you add a number and its 1’s complement …

10110000
+ 0100111
1
11111111
Complements

 Radix Complement
The r's complement of an n-digit number N in base r is defined
as
rn – N for N ≠ 0 and as 0 for N = 0. Comparing with the (r  1) 's
complement, we note that the r's complement is obtained by
adding 1 to the (r  1) 's complement, since rn – N = [(rn  1) –
N] + 1.
 Example: Base-10
The 10's complement of 012398 is 987602
The 10's complement of 246700 is 753300

 Example: Base-2

The 2's complement of 1101100 is 0010100

The 2's complement of 0110111 is 1001001
Complements
 2’s Complement (Radix Complement)
Take 1’s complement then add 1
 Toggle all bits to the left of the first ‘1’ from the right
OR
Example:
Number:
1’s Comp.:
10110000 10110000
01001111
+ 1
01010000 01 010000
Complements

 Example 1.5
 Using 10's complement, subtract 72532 – 3250.

 Example 1.6
 Using 10's complement, subtract 3250 – 72532.
There is no end
carry.

Therefore, the answer is – (10's complement of 30718) =  69282.

Complements

 Example 1.7
 Given the two binary numbers X = 1010100 and Y = 1000011,
perform the subtraction (a) X – Y ; and (b) Y  X, by using 2's
complement.

There is no end carry.

Therefore, the answer is
Y – X =  (2's
complement of 1101111)
=  0010001.
 Complements

 Subtraction of unsigned numbers can also be done by means of the (r

 1)'s complement. Remember that the (r  1) 's complement is one
less then the r's complement.
 Example 1.8
 Repeat Example 1.7, but this time using 1's complement.

There is no end carry,

Therefore, the answer is
Y – X =  (1's complement
of 1101110) =  0010001.