Slide #2

BACS1024
INTRODUCTION TO
COMPUTER SYSTEMS
Chapter 2: Digital Logic and Numerical Data Representation
1
Chapter Outline
2.1 Alphanumeric character data representation
2.2 Numbering systems frequent come out
2.3 Conversions between number systems

2.4 Arithmetic operations in different number systems most points
2
2.1 Alphanumeric Character Data Representation
 In the computing environment, computer uses alphanumeric character
data code / representation to map the data to strings of binary digits.
 Major types of alphanumeric character data representation used are:
EBCDIC ASCII
Extended Binary Coded Decimal American Standard Code for Info
Interchange Code Interchange
Founder IBM Other hardware manufacturer
Character set More Less

Letter order Random Linier
Compatibility Low High
3
2.2 Numbering Systems
 Numbering system is essential to illustrate how numbers work, the nature
of counting and the arithmetic computations performed,
 Human count and perform arithmetic using decimal (base 10 number)
while computer uses binary system (base 2).
 To represent a binary-coded values in computing and digital electronics,
octal numbers (base 8) and hexadecimal numbers (base 16) are used.
Binary Octal Decimal Hexadecimal

Base 2 8 10 16
10 - 16
Data range 0-1 0–7 0–9 0–9&A–F
Usage Computer Programmer User Programmer
4
2.1 Decimal numbers

 Base 10.
 Data range: 0 - 9.
 Each number is multiplied by 10 raised to a power corresponding to
that digit’s position.
 E.g.:
 7810 = (7 x 101) + (8 x 100)
 102410 = (1 x 103) + (0 x 102) + (2 x 101) + (4 x 100)
5
2.2 Binary numbers

 Base 2.
 1 = ON / TRUE.
 0 = OFF / FALSE.
 Bit: The fundamental building block of computer storage.
 Byte: A combination of 8 bits.
 Most significant bit (MSB) and Least Significant Bit (LSB)
0 1 0 0 0 0 0 1
MSB LSB
27 26 25 24 23 22 21 20
(0 x 27)+(1 x 26)+(0x25)+(0x24)+(0x23)+(0x22 )+(0x21)+(1x20 ) =6510
6
2.3 Octal numbers
Decimal Octal Binary
 Base 8.
0 0 000
1 1 001
 258
= (2x81) + (5x80) 2 2 010
= 2110 3 3 011
4 4 100
5 5 101
6 6 110
7 7 111
7
Base 10 Base 2 Base 8 Base 16
2.4 Hexadecimal numbers

 Base 16
 Data range: 0 - 9, A - F
 Computer works with binary
numbering system.
 How to handle Binary numbers?
10000001001010101010101
01101010101010101001011
11010101010101010101010
01111111110000010101010
8
2.4 Hexadecimal numbers

 A set of 4 bits in binary representing a digit
in hexadecimal number
 Why Hex is use?
 Conversion of Binary & Hexadecimal is
easier
 To solve the problem of numbers
written in binary which is tend to be
long and difficult to express.
 E.g.: R G B
8 13 2610
= 0000 1000 0000 1101 0001 10102
= 0 8 0 D 1 A16
9
2.3 Arithmetic Conversions
41(base 5) ---> dec 25d ---> binary
(source) (destination)
 Possible Conversions = (4x5^1) + (1x5^0) <-- 1m
= 20+1 /destination=/2
= 21d <-- 1m
2)25
A31o ---> dec 2)12-1
==> invalid 2) 6-0
Bin 2 ==> A is out of range in base 8 2) 3-0
1-1
Ans: 11001b
x Source 25d ---> oct

Oct 8 Dec 10 8)25
/ Destination 3-1
Ans: 31o
ex. 1001b ----> dec 25d ---> hex
= (1x2^3) + (0x2x2) + (0x2^1) + (1x2^0) 16)25
Hex 16 = 8+0+0+1 1-9
=9d Ans:19h
ex. 270 ---> dec 25d ---> base3
= (2x8^1) + (7x8^0) 3)25
= 16+7 3) 8-1
= 23d 2-2
ex. ABh ---> dec
Ans:221(base3)
10
= (10x16^1) + (11x16^0)
= 160 + 11
= 171d
 E.g.: Base 2  Base 10
1112 = (1 x 22) + (1 x 21) + (1 x 20)

=4+2+1
= 710
110012 = (1 x 24) + (1 x 23) + (0 x 22) + (0 x 21) + (1 x 20)

= 16 + 8 + 1
= 2510
11
178 = (1 x 81) + (7 x 80)

=8+7
= 1510
72638 = (7 x 83) + (2 x 82) + (6 x 81) + (3 x 80)

= 3584 + 128 + 48 + 3
= 376310
12
670416 = (6 x 163) + (7 x 162) + (0 x 161) + (4 x 160)

= 24576 + 1792 + 0 + 4
= 2637210
2C16 = (2 x 161) + (C x 160)

= (2 x 161) + (12 x 160)
= 4410
13
1112 = 78
101 11002 = 01 011 1002

= 1348
14
1112 = 01112
= 716
101 11002 = 0101 11002

= 5C16
15
1616 = 0001 01102
CAD16 = 1100 1010 11012
16
168 = 001 1102
7258 = 111 010 1012
17
3510
2) 35
2) 17 – 1
2) 8 – 1
2) 4 – 0
2) 2 – 0
1–0 3510 = 1000112
18
13510
8) 135
8) 16 – 7
2–0
13510 = 2078
19
815110
16) 8151
16) 509 – 7
16) 31 – 13 (D)
1 – 15 (F) 815110 = 1FD716
20
2.4 Arithmetic Operations
Binary Addition
Binary addition Table 12

0 1 0 1 12 12
+ 0 0 1 1 02 02 12 12 12 12
0 1 1 10 + 02 + 12 + 02 + 12 + 12 + 12
02 12 12 102 112 1002
21
Octal Addition
28
28 58
08 28 58 78
+ 78 + 78 + 78 + 38
78 118 168 218
22
Hexadecimal Addition
B16
216 A16
116 716 A16 C16
+ C16 + 716 + 716 + 116
D16 E16 1316 2216
23
Binary Subtraction
Remaining value after borrowed to right Borrowed: 2 + 0 = 2
02 0 2
112 102 1012
- 12 - 12 - 112
102 12 102
24
Octal Subtraction
0 8
78 128 7058
- 18 - 78 - 2138
68 38 4728
25
Hexadecimal Subtraction
0 16
1F16 1716 102416

- C16 - C16 - BAC16
1316 B16 47816
26
Binary Multiplication
102 10112 10112

x 12 x 1112 x 1012
102 1011 1011
1011 10110
1011 1101112
10011012
27
Octal Multiplication
78 128 3158
x 58 x 58 x 228
438 51 1010 6 2 1010
= 6 28 6 2 1010
61 81 121 1010
= 7 1 5 28
28
Hexadecimal Multiplication
1216 1716 1716

x 516 x C16 x C16
5A16 11416 125 8410
11 4 16
29
2.5 Signed and unsigned number representation
2.5.1 Integer Numbers

 Unsigned integer
 Hold a positive value, and no negative value
 Uses the most significant bit (MSB) as a part of the value
 E.g.: Unsigned integer: 1111 11112 = +25510
 Signed integer
 hold both positive and negative numbers
 uses the most significant bit (MSB) to identify if the number is
positive or negative. 0 indicates a positive while 1 indicates a
negative.
 E.g.: Signed integer: 0111 11112 = +12710
1111 11112 = - 12710  Is it true?
30
2.5.2 Signed-and-magnitude representation
1 001 00112
sign bit (MSB) Magnitude bits
 Example using 8 bits:

 Unsigned : 1111 1111b = + 255d
 Signed : 0111 1111b = + 127d
: 1111 1111b = - 127d  Is it true? No.
Consequence: Calculations are difficult (the change of sign at MSB
does not reflect the whole value.)
31
2.5.2 Signed-and-magnitude representation

 In signed integer: 0111 11112 = 26 + 25 + 24 + 23 + 22 + 21 + 20
= +12710
1111 11112 = - 27 + 26 + 25 + 24 + 23 + 22 + 21 + 20
= - 110
≠ - 12710
 Solution: Two’s Complement
32
2.5.3 Two's Complement
 Objective:
 To represent negative value
 To perform subtraction
 Characteristics: The sign of the number is a natural result of the method.
Therefore, it does not need to be handled separately.
 Steps:
1. One’s complement: Perform inversion. i.e. change 1’s to 0’s and 0’s
to 1.
2. Adding 1 to the result of One’s complement.
 As the computer stores data in byte basis, therefore 8 bit system is
normally used.
33
2.5.3 Two's Complement
 E.g.:
1010 = 0000 10102
One’s complement = 1111 01012
Add 12 = 12 +
Two’s complement = 1111 01102
= - 27 + 26 + 25 + 24 + 22 + 21
= - 1010
34
2.5.3 Two's Complement Continued:

 E.g.: 3010 – 1010 Decimal Binary
= 3010 + (–1010) 3010 0001 11102
+ (-10)10 +1111 01102
3010 = 0001 11102
2010 (1)0001 01002
1010 = 0000 10102
One’s complement = 1111 01012
add 12 = 12 + To verify the answer
Two’s complement = 1111 01102 = 0001 01002
= - 1010 = 24 + 22
= 2010
35
2.5.4 Overflow Flag & Carry Flag
 Overflow
❑ Occurs when the result of an arithmetic operation does not fit into the
fixed number of bits available for the result.
❑ Occur only when both operands have the same sign.
❑ Detected by the fact that the sign of the result is opposite of both
operands.
❑ Stored in overflow flag (OF)
 Carry
❑ Occurs when the result of an arithmetic operation exceeds the fixed
number of bits allocated, without regard to the sign.
❑ The carry bit is ignored in single precision 2’s complement addition and
subtraction.
❑ Detected when extra ‘1’ bit is generated.
❑ Stored in carry flag (CF) 36
 Overflow
❑ E.g.:
6410 0100 00002
+ 6510 + 0100 00012
12910 1000 00012 = -12810 + 110 = 12710
 In 8 bit system, data ranges from-128 to +127.

6410 + 6510 = 12910 which is > 127.
i.e. 129 does not fit into the number of bits available. Therefore,
OVERFLOW occur.
Since 12910 ≠ -12710 , this is invalid.
37
2.5.4 Overflow Flag and Carry Flag
 Carry
 E.g.:
10610 0110 10102
+ (- 2)10 + 1111 11102
10410 (1)0110 10002
= 0110 10002
= 10410
In 8 bit system, extra 1 bit is generated. Carry occur.
Carry ignore
38
 Example: Addition of 4-bit 2's complement
Dec (+4) + (+2) (-4) + (-2) (+4) + (+6) (-4) + (-6)

= +6d = -6d = +10d = -10d
Bin 0100 1100 0100 1100
+ 0010 + 1110 + 0110 + 1010
0110 11010 1010 10110
+6 d -6 d -6 d +6 d
OF NO NO YES YES
CF NO YES NO YES
Result correct Correct Incorrect Ignoring the carry.
The result is
incorrect
39
2.6 Floating-point number representation & standard
2.6.1 Floating Point Numbers

 Also known as real number / scientific notation / exponential notation /
sign magnitude notation.
 Used in the computer when the number:
 Is outside the integer range of the computer ( too large or too small)
 Contains a decimal fraction
 E.g.:
12345
= 12345 x 100
= 0.12345 x 105
= 0.0012345 x 107
= 123450000 x 10-4
40

 A number is represented by the combination of 6 specifications.
 E.g.: To represent 1234510
±0 . 12345 x 10 ±5
Sign
location Magnitude Base sign of Exponent
of decimal point / Mantissa exponent
41
2.6.2 Floating Point Numbers Conversion

 E.g.: Convert of fraction number
 16.510  base 2
22 21 20 2-1 2-2 2-3

4 2 1 1/2 1/4 1/8
16.510 = 1610 + 0.510
= 100002 + 0.12
= 10000.12
42

 16.510  base 2
22 21 20 2-1 2-2 2-3

4 2 1 1/2 1/4 1/8
16.510 = 1610 + 0.510

= 100002 + 0.12 OR,
0.55x 2 = 1.00
= 10000.12
(Reading the integer only, in top-down
direction)
43
x 2 because it needs to be  E.g.: Convert of fraction number

changed to base 2.  0.82812510  base 2
Since it is multiplied using
fractional numbers, therefore 0.828125 x 2 = 1.656250
it must add 0. in front of the 0.656250 x 2 = 1.312500
answer. 0.1101012
0.312500 x 2 = 0.625000
0.625000 x 2 = 1.250000
0.250000 x 2 = 0.500000
0.500000 x 2 = 1.000000
Therefore, 0.82812510 = 0.1101012
44

 0.82812510  base 2
 To validate it:
20 2-1 2-2 2-3 2-4 2-5 2-6
Decimal 0 1/2 1/4 1/8 1/16 1/32 1/64
0 0.5 0.25 0.125 0.0625 0.03125 0.015625
Binary 0 1 1 0 1 0 1
Therefore, 0.82812510 = 0.1101012
45

 11.1100112  base 10
 To validate it:
Binary 1 1 . 1 1 0 0 1 1
21 20 . 2-1 2-2 2-3 2-4 2-5 2-6
2 1 . 1/2 1/4 1/8 1/16 1/32 1/64
Decimal
2 1 . 0.5 0.25 0.125 0.0625 0.03125 0.015625
3.79687510
Therefore, 11.1100112 = 3.79687510
46

 10011.101112  base 16
10011.101112
0001 0011 . 1001 10002
1 3. 9 8 16
Additional Zero added
47

 39.B816  base 10
= (3 x 161) + (9 x 160) + (B x 16-1) + (8 x 16-2)
= 4810 + 910 + 0.687510 + 0.0312510
= 57.7187510
48

 4F5.0916  base 2
4 F 5. 0 916
0100 1111 0101 . 0000 10012
Additional Zero added
49
2.6.3 Floating Point Representations

 Floating point numbers will be stored and manipulated in the computer
using standard predefined format, usually in 8 bits basis.
 There are 2 key format applied: SEEMMMMM and IEEE754 notation
 The base of exponent and location of the binary point are standardize as
part of the format. Therefore, they are not required to be stored at all.
50
 Floating Point Representation - SEEMMMMM
 In SEEMMMMM format
 1 digit for sign.
 2 digits for exponent.
 5 digits for mantissa, the decimal point location is assumed to be
located at the beginning of mantissa.
Excess -48 -49 50 51 52
Exponent -2 -1 0 1 2
 Excess-N notation
 N is the chosen middle value.
 E.g.: Excess-50 allow a magnitude ranges as follow:
0.00001 x 10-50 < Number < 0.99999 x 1049
51

❑ Conversion:
Excess -48 -49 50 51 52
Exponent -2 -1 0 1 2
 The base is 10.
 The implied decimal point is at the beginning of the mantissa.
 Assume that:
 Excess-50 is applied.
 A 0 represents positive and 5 represents negative.
05324567 = 0.24567 x 103 = 245.67
54810000 = - 0.10000 x 10-2 = - 0.00100000
55555555 = - 0.5555 x 105 = - 55555
52

❑ Normalization
 Shift number left by increasing the exponent until leading zeros are
eliminated.
❑ Steps: (Convert decimal number into SEEMMMMM format)
1. Provide number with exponent (0 if not yet specified)
2. Increase / decrease exponent to shift decimal point to proper
position.
3. Decrease exponent to eliminate leading zeros on mantissa.
4. Correct precision by adding 0’s or discarding / rounding least
significant digits
53
❑ Normalization and formatting
❑ E.g.: Given 246.8035, normalize it and represent it in SEEMMMMM format.
Assume that:
 Excess-50 is applied.
 A 0 represents positive and 5 represents negative.
❑ Steps:
1. Add exponent : 246.8035 x 100
2. Position decimal point : 0.2468035 x 103
3. Already normalized, no adjustment is required.
4. Trim mantissa to 5 digits : 0.24680 x 103
5. Convert the number : 05324680
54
❑ Normalization and formatting
❑ E.g.: Given -1255 x 10-3, normalize it and represent it in SEEMMMMM format.
Assume that:
❑ Steps:
1. The number is already in exponential form.
2. Position decimal point : - 0.1255 x 101
3. Already normalized, no adjustment is required.
4. Trim mantissa to 5 digits : -0.12550 x 101
5. Convert the number : 55112550
55

❑ Addition and subtraction
 Exponent and mantissa treated separately.
 Exponents of numbers must agree.
 Align decimal points
 Least significant digits may be lost
 Overflow of the most significant digit may occurs.
 Number must be shifted right and the exponent incremented to
accommodate overflow.
56
Assume that:
 E.g.: Add the 2 floating-point numbers.
05199520
+ 04967850
Align exponents = 05199520
By adding 2 zeros in front to mantissa = 0510067850 +
Add mantissa, (1) indicates a carry = (1)0019850
Carry requires right shift of exponent = 05210019(850)
Round = 05210020
57
Assume that:
 E.g.: Check result
05199520
+ 04967850
05199520 = 0.99520 x 101 = 9.520
04967850 = 0.67850 x 10-1 = 0.067850 + 10.019850
In sign-magnitude form = 0.1001985 x 102
58
❑ Multiply and divide
 Mantissa: Multiplied or divided
 Exponent: Added or subtracted and adjusted excess value since added trice
Assume that:
 E.g.:
 Assume that two number with exponent 3, each representing 53.
 Adding the two exponent: 53 + 53 = 106
 Since 50 (excess-50) is added twice, subtract: 106 – 50 = 56
 Normalization necessary to:
 Restore location of decimal point
 Maintain precision of the result.
59
Assume that:
 E.g.: multiply two floating pint numbers
05220000
x 04712500
Add exponent, subtract offset = 75 + 47 – 50 = 49
Multiply mantissa = 0.20000 x 0.12500
= 0.025000000
Normalized the result = 04825000
60

 E.g.: Check result
Assume that:
05220000 = 0.20000 x 102 = 20

04712500 = 0.12500 x 10-3 = 0.000125
Multiply = 20 x 0.000125
= 0.025000000 x 10-1
Normalizing and rounding = 0.25000 x 10-2
61
 Floating Point Representation – IEEE754
❑ Typical floating point format in computer
 Consists of 32 bits, divided into:
 1 bit of sign
 8 bits of exponent, excess-127 notation, base 2
 23 bits of mantissa
bit 0 1 89 31
S E … E M … M
Sign Exponent Mantissa
62
▪ Floating Point Representation – IEEE754
❑ E.g.: Convert 253.7510 to binary floating point form.
253. 7510
= 1111 1101. 112
Therefore, 253.1110 = 1111 1101.112
= 1.111 110111 x 2+7
0 10000110 11111011100..
Sign Exponent Mantissa

1 8 23 bits
63
2.7 Bitwise Logical Operations
 Bitwise logical operations are including:

Logical operation Symbol Example
AND= Yield TRUE if both operands are TRUE (•) , (^) A•B A^B
OR = Yield TRUE if either/both operand (+) , (ν) A+B AνB
is/are TRUE
NOT = Inverts the value of its operand (’) , (¬) A’ ¬A
XOR = exclusive disjunction (⊕) , (∨) A⊕B A∨B
 Bitwise Operator precedence Use these symbols
Expression Order of Operations
A + B’ NOT, then OR
(A + B)’ OR, then NOT
A + (B • C) AND, then OR
64
 Bitwise logical operations

 E.g.: AND
1 1 0 0
AND 1 0 1 0
1 0 0 0
 E.g.: OR
1 1 0 0
OR 1 0 1 0
1 1 1 0
65
 Bitwise logical operations

 E.g.: NOT
NOT 1 0
0 1
 E.g.: XOR
1 1 0 0
XOR 1 0 1 0
0 1 1 0
66
Chapter 2: Digital Logic & Numerical Data Representation
Self-Review
-EBCOIC
-ASCII
2.1 Alphanumeric character data representation 2.5 Signed and unsigned number representation
-Conversion
2.2 Numbering Systems -Competion 2.5.1 Integer Representation
2.2.1 Decimal numbers 2.5.2 Sign-and-magnitude Representation
2.2.2 Binary Numbers 2.5.3 Two's complement
2.2.3 Octal Numbers 2.5.4 Overflow Flag and Carry Flag

2.2.4 Hexadecimal Numbers
-Conversion
2.3 Conversion between number systems -Notation
2.4 Arithmetic operations in different number
systems
2.7 Bitwise logical operations
2.4.1 Addition 2.7.1 AND
2.4.2 Subtraction 2.7.2 OR
2.7.3 NOT
2.4.3 Multiplication 2.7.4 XOR
67

Slide #2

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Slide #2

Uploaded by

Copyright:

Available Formats

BACS1024

2.3 Conversions between number systems

Character set More Less

Binary Octal Decimal Hexadecimal

2.1 Decimal numbers

2.2 Binary numbers

2.4 Hexadecimal numbers

2.4 Hexadecimal numbers

x Source 25d ---> oct

 E.g.: Base 2  Base 10

1112 = (1 x 22) + (1 x 21) + (1 x 20)

110012 = (1 x 24) + (1 x 23) + (0 x 22) + (0 x 21) + (1 x 20)

 E.g.: Base 8  Base 10

178 = (1 x 81) + (7 x 80)

72638 = (7 x 83) + (2 x 82) + (6 x 81) + (3 x 80)

 E.g.: Base 16  Base 10

670416 = (6 x 163) + (7 x 162) + (0 x 161) + (4 x 160)

2C16 = (2 x 161) + (C x 160)

 E.g.: Base 2  Base 8

101 11002 = 01 011 1002

101 11002 = 0101 11002

 E.g.: Base 16  Base 2

1616 = 0001 01102

CAD16 = 1100 1010 11012

 E.g.: Base 8  Base 2

168 = 001 1102

7258 = 111 010 1012

 E.g.: Base 10  Base 2

 E.g.: Base 10  Base 8

 E.g.: Base 10  Base 16

Binary addition Table 12

1F16 1716 102416

102 10112 10112

1216 1716 1716

2.5.1 Integer Numbers

2.5.2 Signed-and-magnitude representation

sign bit (MSB) Magnitude bits

 Example using 8 bits:

2.5.2 Signed-and-magnitude representation

2.5.3 Two's Complement Continued:

 In 8 bit system, data ranges from-128 to +127.

In 8 bit system, extra 1 bit is generated. Carry occur.

Dec (+4) + (+2) (-4) + (-2) (+4) + (+6) (-4) + (-6)

2.6.1 Floating Point Numbers

2.6.1 Floating Point Numbers

2.6.2 Floating Point Numbers Conversion

22 21 20 2-1 2-2 2-3

2.6.2 Floating Point Numbers Conversion

22 21 20 2-1 2-2 2-3

16.510 = 1610 + 0.510

2.6.2 Floating Point Numbers Conversion

x 2 because it needs to be  E.g.: Convert of fraction number

2.6.2 Floating Point Numbers Conversion

Therefore, 0.82812510 = 0.1101012

2.6.2 Floating Point Numbers Conversion

2.6.2 Floating Point Numbers Conversion

Additional Zero added

2.6.2 Floating Point Numbers Conversion

2.6.2 Floating Point Numbers Conversion

Additional Zero added

2.6.3 Floating Point Representations

2.6.3 Floating Point Representations

2.6.3 Floating Point Representations