ccc

 
 


   
 

Data is recorded as electronic signals indicator. The presence or absence of the signal in a specific circuit
represents data in the computer just as the presence or absence of punched holes on a punched card.

  
Number systems are systems or styles of notations that represent quantities or numbers. These include:

1.p    ë numbering system used by most people

ëp It is called the Base 10 system
ëp ses 10 different numeric symbols, 0 through 9 (0,1,2,3,4,5,6,7,8,9)
ëp
hen
e
rite a number, such as 3572, the digits have different values depending
on their position
*p 2 simply represents the number 2, because it is at the rightëmost end of the
number
*p 7 represents the number 70
*p 5 represents the number 500
*p 3 represents the number 3000 or
*p 3 thousands + 5 hundreds + 7 tens + 2 units
*p formally, because this is base 10, each digit is multiplied by the appropriate
po
er of 10
*p 3 x 103 = 3 x 1000 = 3000
2
*p 5 x 10 = 5 x 100 = 500
1
*p 7 x 10 = 7 x 10 = 70
*p 2 x 100 = 2 x 1 = 2
*p adding 3000 + 500 + 70 + 2 gives us 3572

In the decimal system, the value to the left of a number is al
ays ten times greater. Decimal, meaning a
number expressed in scale of tens.

  
 
  

nits 100 1
Tens 101 10
Hundreds 102 100
Thousands 103 1000

  !"#  $ %

p  å are simply an extension of the principals of the place value in each direction. If the
place value of the numbers increase as
e move to the left on the decimal point, the place value
becomes smaller, on the other hand, if
e move to the right.


 
 
  

1/10 10ë1 .1
1/100 10ë2 .01
1/1000 10ë3 .001

DATA REPRESENTATION
cLESSON 5 ETHEL V. FAJARDO
The value of the number 5.367 is expressed as follo
s

(5 x 10ë0) + (3 x 10ë1) + (6 x 10ë2) + (7 x 10ë3) or 5 x .1 = 5.

3 x .1 = .3
6 x .01 = .06
7 x .001 = .007
= 5.367

2.p     ë Latin
ord for t
o

ëp It is Base 2 numbering system
ëp Base 2 means that the value to the left of the previous number is al
ays t
o times
greater
ëp ses only 2 symbols, 0 and 1 this corresponds to the ͞ON͟ and ͞OFF͟. ͞ON͟ has a
value of 1
hile ͞OFF͟ has a value of 0.
ëp these symbols are called "bits",
hich is a contraction of nary "igits


  


20 1
21 2
22 4
23 8
24 16
25 32
26 64
27 128
28 256
29 512
210 1024

p 
&'

(

 

The process is basically a series of repeated division by the number of the base to
hich you
ish to
convert. T
o things to keep in mind:

1.p eep dividing until you reach zero quotients.

2.p The remainders should be
ritten in reverse order. (Starting from left to right)

EXAMPLE:

36 = 0100100
    
 &

2 36 0
2 18 0
2 9 1
2 4 0
2 2 0
2 1 1
2 0 0

DATA REPRESENTATION
ŒLESSON 5 ETHEL V. FAJARDO
 93=01011101

    
 &

2 93 1
2 46 0
2 23 1
2 11 1
2 5 1
2 2 0
2 1 1
2 0 0

p '
(
&


  


20 1
21 2
22 4
23 8
24 16
25 32
26 64
27 128
28 256
29 512
210 1024

EXAMPLE:

%p c)c *c+ŒŒ,)+Œc,c+Œ)

=4+0+1
=5
'%p cc)) *c+Œ£,c+ŒŒ,)+Œc,)+Œ)
=8+4+0+0
= 12

%p c))cc) *c+Œ ,)+Œ
,)+Œ£,c+ŒŒ,c+Œc,)+Œ)
= 32 + 0 + 0 + 4 + 2 + 0
= 38
%p cccccc *c+Œ ,c+Œ
,c+Œ£,c+ŒŒ,c+Œc,c+Œ)
= 32 + 16 + 8 + 4 + 2 + 1
= 63

DATA REPRESENTATION
£LESSON 5 ETHEL V. FAJARDO
 p 
&
 
'
(
 
'
( 
 
&

 
  

.1 2ë1 ½ = .5
.01 2ë2 1/1 = .25
ë3
.001 2 1/8 = .125
.0001 2ë4 1/16 = .0625
.00001 2ë5 1/32 = .03125
.000001 2ë6 1/64 = .015625
ë7
.0000001 2 1/128 = .0078125
.00000001 2ë8 1/256 = .00390625
ë9
.000000001 2 1/512 = .001953125
.0000000001 2ë10 1/1024 = .0009765625

Decimal fraction may be converted to binary by repeatedly multiplying the fraction by 2, the base to

hich
e are converting. Multiplication continues until the products become 9 or until
e have as many
digits of precision as
e require.

EXAMPLE:

0.6875 = 1011

&' & 

 

- 
   
0.6875 2 1 0.375
0.375 2 0 0.75
0.75 2 1 0.5
0.5 2 1

0.358 = 010110

&' & 

 

- 
   
0.358 2 0 0.716
0.716 2 1 0.432
0.432 2 0 0.864
0.864 2 1 0.728
0.728 2 1 0.456
0.456 2 0 )%.cŒ
0.912 2 1 0.824
0.824 2 1 0.648
0.648 2 1 0.296
0.296 2 0 0.592

DATA REPRESENTATION

LESSON 5 ETHEL V. FAJARDO
 p '
(  

The follo
ing are the four basic rules in addition of binary numbers:

p 0+0=0
p 0+1=1
p 1+0=1
p 1 + 1 = 0 (Plus a carryëover of 1)

EXAMPLE:

BINARY CHEC DECIMAL

11 11 = 1X21 + 1X20 3
+ 100 =2+1 +4
111 =3 7
100 = 1X22 + 0X21 + 0X20
=4+0+0
=4
1010 1010 = 1X23 + 0X22 + 1X21 + 0X20 10
+ 1100 =8+0+2+0 + 12
10110 = 10 22
1100 = 1X23 + 1X22 + 0X21 + 0X20
=8+4+0+0
= 12
101011 101011 = 1X25 + 0X24+ 1X23 + 0X22 + 1X21 + 1X20 43
+ 110011 = 32 + 0 + 8 + 0 + 2 + 1 + 51
1011110 = 43 94
110011 = 1X25 + 1X24 + 0X23 + 0X22 + 1X21 + 1X20
= 32 + 16 + 0 + 0 + 2 + 1
= 51
10110 10110 = 1X2 +0X23 +1X22 + 1X21 + 0X20
4
22
+ 01011 = 16 + 0 + 4 + 2 + 0 + 11
100001 = 22 33
01011 = 0X2 + 1X23 + 0X22 + 1X21 + 1X20
4

=0+8+0+2+1
= 11

p '
( '
 

The follo
ing are the four basic rules in subtractions of binary numbers:

p 0å0=0
p 1å0=1
p 1å1=0
p 0 å 1 = 0 (With a borro
of 1)

DATA REPRESENTATION
LESSON 5
ETHEL V. FAJARDO
EXAMPLE:

BINARY CHEC DECIMAL

1010 1010 = 1X23 + 0X22 + 1X21 + 0X20 10
ë 100 =8+0+2+0 ë4
110 = 10 6
ë100 = 1X22 + 0X21 + 0X20
=4+0+0
=ë4
1111 1111 = 1X23 + 1X22 + 1X21 + 1X20 15
ë 1000 =8+4+2+1 ë8
111 = 15 7
ë 1000 = 1X2 + 0X22 + 0X21 + 0X20
3

=8+0+0+0
=ë8
101 101 = 1X2 + 0X21 + 1X20
2
5
ë 111 =4+0+1 ë7
010 =5 ë2
ë 111 = 1X2 + 1X21 + 1X20
2

=4+2+1
= ë7

p '
(& 
 

The binary multiplication table is:

p 0X0=0
p 1X0=0
p 0X1=0
p 1X1=1

EXAMPLE:

BINARY CHEC DECIMAL

111 111 = 1X22 + 1X21 + 1X20 7
X 101 =4+2+1 X5
111 =7 35
000 101 = 1X22 + 0X21 + 1X20
111 =4+0+1
100011 =5

p '
(  

In the binary division,
e
ill try to subtract the divisor from each excessive group of digits in the
dividend as
e
ork from left to right.
  
The complete table for binary division is:

p 0/1 = 0
p 1/1 = 1

DATA REPRESENTATION
ÑLESSON 5 ETHEL V. FAJARDO
  
 When doing binary division,
e need to remember some important rules:
1.p When the remainder is greater than or equal to the divisor,
rite a 1 in the quotient and
subtract.
2.p When the remainder is less than the divisor,
rite a 0 in the quotient and add another digit
from the dividend.
3.p If all the digits of the dividend have been considered and there is still a remainder, mark a
radix point in the dividend and append a zero. Remember that some fractions do not have an
exact representation in binary, so not all division problems
ill terminate.

EXAMPLE 1:

110 / 100001 = 101.1

1.p First,
e need to find the smallest part of the pppppppppppp

dividend that is greater than the divisor 1102. Since p
our divisor has three digits,
e begin by examining




p
the first three digits of the dividend. 1002 is less
than 1102 so
e need to add another digit from
our dividend.
2.p Next
e try the first four digits of the dividend. p
Since 10002 is greater than 1102
e kno

e can ppppppppppp
do our division




p
p
3.p 1102 divides 10002 one time, so
e
rite a 1 as the p
first digit of our quotient, copy the divisor belo
pppppppp pp
the dividend, and subtract using the borro
p




p
method. pppppp
p
ppppppp
p
4.p No

e bring do
n the next digit of our dividend p
and
rite it beside our remainder. Then
e check pppppppp pp
to see if this ne
number is greater than or equal p




p
to our divisor. pppppp
p
ppppppp

p
5.p 1002 is less than 1102 so
e
rite a 0 in the p
quotient and add another digit to our reminder. pppppppp
pp
p




p
pppppp
p
ppppppp

p
6.p 10012 is greater than 1102 so
e
rite a 1 in the p
quotient and subtract 1102 from 10012. pppppppp
p
p




p
pppppp
p
ppppppp

p
pppppppp
p
ppppppppp p
p

DATA REPRESENTATION
èLESSON 5 ETHEL V. FAJARDO
 7.p Note that
e still have a remainder after ppppp
pp
considering all the digits of the dividend. This p





p
means our ans
er
ill include a fraction. To pppppp
p
finish our problem
e need to mark the radix ppppppp

p
point and append a zero to the dividend. pppppppp
p
cc
8.pNo

e bring do
n the extra zero and p
compare the remainder
ith our divisor. pppppppp
 p
Notice
e ignore the radix point in our p





p
comparison. 1102 equals 1102 so
e
rite pppppp
p
ppppppp

p
another 1 in the quotient and subtract. This
pppppppp
p
completes our division because
e have no
ppppppppp
p
more digits in the dividend and no ppppppppp
p
remainder. ppppppppppp
p

EXAMPLE 2:
101 / 1111 = 11 ___11
101 | 1111
101
101
101
000

3.      /It has a base or radix of 8.

ëp Radix has been chosen because it stands in direct proportion to the binary,
hose
digits increase, by po
ers of t
o.
ëp In base 8, there are 8 numeric symbols; 0, 1, 2, 3, 4, 5, 6, 7

p 
&0



 

When converting from decimal to octal,
e divide the decimal number by eight and note the remainders
after each division. This technique is called the remainder method.

        

1 1 11 13 30 36
2 2 12 14 40 50
3 3 13 15 50 62
4 4 14 16 60 74
5 5 15 17 70 106
6 6 16 20 80 120
7 7 17 21 90 132
8 10 18 22 100 144
9 11 19 23 500 764
10 12 20 24 1000 1750

DATA REPRESENTATION
ÿLESSON 5 ETHEL V. FAJARDO
 EXAMPLE:

DIVISIONS REMAINDERS
Given 18
18/8 = 2 2
2/8 = 0 2
Therefore: 1810 = 228
Given 255
255/8 = 31 7
31/8 = 3 7
3/8 = 0 3
Therefore: 25510 = 3778
Given 3965
3965/8 = 495 5
495/8 = 61 7
61/8 = 7 5
7/8 = 0 7
Therefore 396510 = 75758

p 
0
&

 

In the octal number system each digit corresponds to a po
er of 8. To convert from octal to decimal,
multiply each octal digit by its position value and add the resulting products.

- 
&
 123ÿ  
810 1073741824
89 134217728
88 16777216
87 2097152
86 262144
85 32768
84 4096
83 512
82 64
81 8
80 1
8ë1 1/8 = 0.125
8ë2 1/64 = 0.015625
8ë3 1/512 = 0.001953125
8ë4 1/4096 = 0.000244140625
8ë5 1/32768 = 0.00003051757813
8ë6 1/262144 = 0.000003814697265625

EXAMPLE:

p 4608 = 4X82 + 6X81 + 0X80

= 256 + 48 + 0
= 30410
Therefore 4608 = 30410
DATA REPRESENTATION
.LESSON 5 ETHEL V. FAJARDO
 p 17.268 = 1x81 + 7x80 + 2x8ë1 + 6x8ë2
= 8 + 7 + 2/8 + 6/64
= 15.34375

p 

 

When converting decimal fractions to octal fractions multiply the decimal number by eight and note the
carry into the integer position.

EXAMPLE:

M LTIPLICATION CARRY OVER

0.2484 X 8 = 1.9872 1
0.9872 X 8 = 7.8976 7
0.8976 X 8 = 7.1808 7
0.1808 X 8 = 1.4464 1
0.4464 X 8 = 3.5712 3
Therefore: 0.248410 = 0.177138
Note that the carries taken in a for
ard order (as sho
n by the arro
) gives the octal fraction. We
terminated after five places. If more accuracy is required, just continue multiplying to obtain more
octal digits.

p 
0'
(

 

The most important use of octal numbers lies in octalëbinary conversions.

BINARY N MBER 000 001 010 011 100 101 110 111
OCTAL N MBER 0 1 2 3 4 5 6 7

EXAMPLE:

7328 = (?)2 78 = 1112

38 = 0112
28 = 0102
Therefore 7328 = 111 011 0102
215.378 = (?)2 28 = 0102
18 = 0012
58 = 1012
38 = 0112
78 = 1112
Therefore 215.378 = 010 001 101. 011 111

DATA REPRESENTATION
c)LESSON 5 ETHEL V. FAJARDO
 p '
(0


 

Converting from binary to octal is the reverse of the procedure. It is important to group the bits in threes,
starting at the binary point,
orking both
ays, and then converting each group of three to its octal
equivalent. Zeroes are added to each and to make a complete group.

Grouping the bits into threes:

111101002 = (?)8 = 011 110 1002 or 3648
Grouping bits into threes:
11001011.1100102 = (?)8 =011 001 011. 110 0102 = 313.628

p

p 24"   /It is a Base 16 numbering systemp
pThere are 16 numeric symbols, 0 1 2 3 4 5 6 7 8 9 A B C D E F

PLACE VAL E DECIMAL EQ IVALENT

160 1
161 16
162 256
163 4096
164 65536

BINARY HEXADECIMAL DECIMAL BINARY HEXADECIMAL DECIMAL

0000 0 0 10000 10 16
0001 1 1 10001 11 17
0010 2 2 10010 12 18
0011 3 3 10011 13 19
0100 4 4 10100 14 20
0101 5 5 10101 15 21
0110 6 6 10110 16 22
0111 7 7 10111 17 23
1000 8 8 11000 18 24
1001 9 9 10001 19 25
1010 A 10 11010 1A 26
1011 B 11 11011 1B 27
1100 C 12 11100 1C 28
1101 D 13 11101 1D 29
1110 E 14 11110 1E 30
1111 F 15 11111 1F 31

p 
&02+
&


 

5

1.p Divide the decimal number by 16. Treat the division as an integer division.
2.p Write do
n the remainder (in hexadecimal).
3.p Divide the result again by 16. Treat the division as an integer division.
4.p Repeat step 2 and 3 until result is 0.
5.p The hex value is the digit sequence of the remainders from the last to first.

 5 a remainder in this topic refers to the left over value after performing an integer division.

DATA REPRESENTATION
ccLESSON 5 ETHEL V. FAJARDO
4c
Convert the number ccŒÿ DECIMAL to HEXADECIMAL

   
  &
32+
&
Start by dividing the number by 16.

In this case, 1128 divided by 16 is 70.5. So the integer

division result is 70 (thro
out anything after the decimal
1128 / 16 70 ÿ
point).

The remainder is (70.5 ë 70) multiplied
ith 16; or (0.5

times 16),
hich is 8.
Then, divide the result again by 16

(the number 70 on the DIVISION column comes from the

previous RES LT).
70 / 16 4 Ñ
In this case, 70/16=4.375. So the integer division result is
4 (thro
out anything after the decimal point)

The remainder is (0.375 multiplied
ith 16,
hich is 6.

Repeat. Note here that 4/16=0.25. So the integer
division result is 0.
4 / 16 0

The remainder is (0.25ë0) multiplied
ith 16,
hich is 4.
Stop because the result is already 0 (0 divided by 16
ill
al
ays be 0)
Well, here is the ans
er. These numbers come from the
468
REMAINDER column values (read from bottom to top)

Side note: You can get the remainder of a division using the &" or 6 operator. Ie: 1128%16=8.

4Œ
Convert the number Œ Ñ DECIMAL to HEXADECIMAL

  
  &
32+
256 / 16 16 0
16 / 16 1 0
1 / 16 0 1
ANSWER 100

DATA REPRESENTATION
cŒLESSON 5 ETHEL V. FAJARDO
4£
Convert the number .Œc DECIMAL to HEXADECIMAL

  
  &
32+
921 / 16 57 9
57 / 16 3 9
3 / 16 0 3
ANSWER 399

4

Convert the number cÿÿ DECIMAL to HEXADECIMAL

  
  &
32+
188 / 16 11 C (12 decimal)
11 / 16 0 B (11 decimal)
ANSWER BC

Note that here; the ans
er
ould not be 1112, but BC. Remember to
rite do
n the remainder in hex, not decimal.

4 
Convert the number .) DECIMAL to HEXADECIMAL

  
  &
32+
590 / 16 36 E (14 decimal)
36 / 16 2 4 (4 decimal)
2 / 16 0 2 (2 decimal)
ANSWER 24E

p 2+
&0
&


 

p 5

1.p Get the last digit of the hex number; call this digit the   .
2.p Make a variable, let's call it #. Set the value to 0.
3.p Multiply the  "
ith (16^#), store the result.
4.p Increment # by 1.
5.p Set the   to the previous digit of the hex number%
6.p Repeat from step 3 until all digits have been multiplied.
7.p Sum the result of step 3 to get the ans
er number.

DATA REPRESENTATION
c£LESSON 5 ETHEL V. FAJARDO
4c
Convert the number ccŒÿ HEXADECIMAL to DECIMAL

& 
 
 

Start from the last digit of the number. In this case, the number is 112ÿ.
8 x (16^0) 8 The last digit of that number is ÿ. Note that the po
er of 0 of any
number is al
ays 1
Process the previous,
hich is Œ. Multiply that number
ith an increasing
2 x (16^1) 32
po
er of 16.
1 x (16^2) 256 Process the previous digit,
hich is c, note that 16^2 means 16 x 16
1 x (16^3) 4096 Process the previous digit,
hich is c, note that 16^3 means 16 x 16 x 16
Here,
e stop because there's no more digit to process
This number comes from the  of the RES LTS
ANSWER 4392
(8+32+256+4096)=4392

Once discerned, notice that the above process is essentially performing this calculation:

c43cÑ
£ ,c43cÑ
Œ ,Œ43cÑ
c ,ÿ43cÑ
) 

When doing this by hand, it is easier to start back
ard is because:

p Counting the number of digits takes extra time, and you might count
rongly.
p If you don't remember
hat a particular value of a po
erëofë16 is, it's easier to calculate it from the previous
po
er value. For instance, if you don't remember
hat the value of 16^3 is, then just multiply the value of
16^2 (
hich you'll likely already have if you started back
ard)
ith 16.

4Œ
Convert the number ÿ. HEXADECIMAL to DECIMAL

& 
 
 
9 x (16^0) 9
8 x (16^1) 128
5 x (16^2) 1280
ANSWER 1417

If you
ant to be a speed counter, it's beneficial to memorize the values of the smaller po
er of 16s, such as in this table

-cÑ  

16^0 1
16^1 = 16 16
16^2 = 16x16 256
16^3 = 16x16x16 4096
16^4 = 16x16x16x16 65536

DATA REPRESENTATION
c
LESSON 5 ETHEL V. FAJARDO
4£
Convert the number c £c HEXADECIMAL to DECIMAL
(This time, let's use the table of the po
erëofë16s above.)

& 
 
 
1x1 1
3 x 16 48
5 x 256 1280
1 x 4096 4096
ANSWER 5425

4

Convert the number ÿ HEXADECIMAL to HEXADECIMAL

& 
 
 
8x1 8
A x 16 (remember that hex A=decimal 10) 160
F x 256 (remember that hex F=decimal 15) 3840
ANSWER 4008

4 
Convert the number ÿ HEXADECIMAL to DECIMAL

& 
 
 
Fx1 15
8 x 16 128
ANSWER 143

4Ñ
Convert the number £
£Œ HEXADECIMAL to DECIMAL

= 2x (16^0) + 3x (16^1) + 4x (16^2) + 5x (16^3) + 3x (16^4)

= 2 + 3x16 + 4*256 + 5*4096 + 3*65536
= 2 + 48 + 1024 + 20480 + 196608
= 218162

DATA REPRESENTATION
c LESSON 5
ETHEL V. FAJARDO
 p 2+
&0'
(

 


 
Converting hex number to binary number is very easy, it's almost trivial. The only requirement is that
you kno
the equivalent binary value of each hexadecimal "digit" (0 to F); or if not, you must kno
ho

to convert them by hand. Belo
is a table that sho
s each hexadecimal digit
ith its corresponding
binary number.

Note that every binary number on this table consists of four digits. This is necessary because the
maximum hexadecimal digit value is F or 15,
hich translates to fourëdigitsëbinary 1111.

HEX BINARY
0 0000
1 0001
2 0010
3 0011
4 0100
5 0101
6 0110
7 0111
8 1000
9 1001
A 1010
B 1011
C 1100
D 1101
E 1110
F 1111

(Technically, any trailing 0 at the beginning of a number doesn't mean anything. So, binary 0010 is the same as
binary 10, but for conversion purpose, include the trailing 0s.)

To convert a hexadecimal number to binary. Just
rite do
n the binary value of each hex digit.

4c5
To convert hexadecimal F8 to binary,
rite do
n the binary for F first, then the binary for 8.
F 8
1111 1000
So, the ans
er is 11111000.
This seems too easy, and it is. se a calculator to convince yourself.

DATA REPRESENTATION
cÑLESSON 5 ETHEL V. FAJARDO
 45
Convert hex number 1A to binary.
1 A
0001 1010
So, the ans
er is 00011010. (Note: Once you got the ans
er, you can ignore the zeros at the beginning, so this can
be also
ritten as 11010.)

&45
hex D C C
bin 1101 1100 1100

hex 1 0 0 3
bin 0001 0000 0000 0011

hex F 3 A 2
bin 1111 0011 1010 0010

' 2445

This time, let's assume
e have a binary number that needs to be converted to hex. For example, the binary number
11010. In this case because the number of digits is not a multiple of 4, insert 0s at the beginning to make the number
multiple of four. So it becomes 00011010. We then separate each fourëdigit pair and get their corresponding hex
values.

0001 1010
1 A
So, the ans
er is 1A.

&7 8


I don't recommend memorizing the binary number of each hex digit. Also, if you don't kno

here those 0s and 1s
comes from, it's easy to make mistakes and not kno
ing it, or even forget. I recommend that you kno

here they
come from, and you
on't have to
orry much about forgetting. For example, kno
that 4 is 2^2, so the binary of 4
must be 0100. Why? Let's convert it systematically:

DIVISION RES LT REMAINDER

4/2 2 0
2/2 1 0
1/2 0 1

The ans
er is the remainders being read back
ard,
hich is 100.

4 = (0)*2^3 + (1)*2^2 + (0)*2^1 + (0)*2^0

Realize that this is the only
ay the number 4 in binary can be represented.

DATA REPRESENTATION
cèLESSON 5 ETHEL V. FAJARDO
A Number = (b1)*(2^3) + (b2)*(2^2) + (b3)*(2^1) + (b4)*(2^0)
or
A Number = (b1)*8 + (b2)*4 + (b3)*2 + (b4)*1

here b1, b2, b3, b4 must be either 1 or 0.

So, let's say
e're looking for the binary of 9. What sequence of bs
ill sum to 9? There's al
ays one unique ans
er:

9 = (1)*8 + (0)*4 + (0)*2 + (1)*1

b1=1
b2=0
b3=0
b4=1
so the binary of 9 is 1001.

Ho
about the binary of 7. What sequence of bs
ill sum to 7? Again, there's only one ans
er:

7 = (0)*8 + (1)*4 + (1)*2 + (1)*1

b1=0
b2=1
b3=1
b4=1
so the binary of 7 is 0111.

I've added a decimal column to the table; it's sho
n belo
. See Converting Binary.
HEX DECIMAL BINARY
0 0 = 0+0+0+0 0000
1 1 = 0+0+0+1 0001
2 2 = 0+0+2+0 0010
3 3 = 0+0+2+1 0011
4 4 = 0+2+0+0 0100
5 5 = 0+4+0+1 0101
6 6 = 0+4+2+0 0110
7 7 = 0+4+2+1 0111
8 8 = 8+0+0+0 1000
9 9 = 8+0+0+1 1001
A 10 = 8+0+2+0 1010
B 11 = 8+0+0+1 1011
C 12 = 8+4+0+0 1100
D 13 = 8+4+0+1 1101
E 14 = 8+4+2+0 1110
F 15 = 8+4+2+1 1111

DATA REPRESENTATION
cÿLESSON 5 ETHEL V. FAJARDO