Chapter 6

Number System and Arithmetic Operation

Definition: Number system is the way to represent a

number in different forms.
Types of Common Number system:
1. Decimal Number System: It is system with
base value 10 means it has 10-digits to
represent the data. The digits
are(0,1,2,3,4,5,6,7, 8,9). Eg. 100,16,62,73,400,
………
2. Binary Number System: It is the number
system with base value 2 means it has only two
digits to represent the data. The digits are (0,
1). E.g. 00,01,10,11,100….
3. Octal Number System: It is the number system
with base value 8 means it has 8 digits to
 represent the data. The digits are (
0,1,2,3,4,5,6,7). E.g. 765,36,326,…….
4. Hexadecimal Number System : It is the
number system with base value 16 means it
has 16 digits to represent the data. The digits
are 0,1,2,3…….,9,A,B,C,D,E,F. E.g A49,FD2..

- A number expressed in base(radix)-r system has

coefficients multiplied by powers of r:
[Link] + [Link]-1 + . . . + a2. r2 + a1. r + a0 +a-1.r-1
+ a-2.r-2+ . . . + a-m.r-m
where base (radix) r = 2,3,4... 8,9,10, ...16...

System Radix Allowable Digits

Binary 2 0,1
Octal 8 0,1,2,3,4,5,6,7
Decimal 10 0,1,2,3,4,5,6,7,8,9
Hexadecimal 16 0,1,2,3,4,5,6,7,8,9,A, B,C, D, E, F

2
 - (4021.2)5=4 x 53 + 0 x 52 + 2 x 51 + 1 x 50 + 2 x
5-1 = (511.4)10
4 x 125 + 0 + 10 + 1 + 2 x (1/5)
500 + 11 + .4
- (B65F)16 = 11 x 163 + 6 x 162 + 5 x 161 + 15
x 160 = (46687)10
11 x 4096 + 6 x 256 + 5 x 16 + 15
45056 + 1536 + 80 + 15

Augend:101101 minuend:101101 multiplicand:1011

Addend: +100111 subtrahend: -100111 multiplier:x 101

1010100 000110
110111
Decimal numbers Binary Number Hexadecimal
Number
0 00 0
1 01 1
2 10 2
3 11 3
4 100 4
5 101 5
6 110 6
 7 111 7
8 1000 8
9 1001 9
10 1010 A
11 1011 B
12 1100 C
13 1101 D
14 1110 E
15 1111 F

Bits & Bytes:

1 bit(binary digit) = 1 digit. For example: 1
1 byte = 8-bits
1 kilo byte= 210 = 1024 bytes
1 mega byte = 210 * 210 = 220 = 1024 kilo bytes
1 giga byte= 230= 1024 mega bytes
1 tera byte= 240= 1024 giga bytes

6.1 The Decimal Number System:

The Decimal number system is a number system of
base or radix equal to 10, which means that there are
10, called Arabic numerals, symbols used to

4
represent number : 0, 1, 2, 3,…….,9 , which are used
for counting.

To represent more than nine units, we must either

develop additional symbols or use those we have in
combination. When used in combination, the value of
the symbol depends on its position in the position in
the combination of symbols. We refer to this as
positional notation and refer to the position as having
a weight designated as units, tens, hundreds,
thousands, and so on

The units symbol occupies the first position to the left

of the decimal point is represented as 100. The
second position is represented as 101, and so forth.
To determine what the actual number is in each
position, take the number that appears in the position,
and multiply it by 10X, where x is the power
representation.
This is expressed mathematically of the first five positions as
4 3 2 1 0
10 10 10 10 10
Ten thousands thousands hundreds tens units
 For example the value of the combination of symbols
435 is determined by adding the weight of each
position as
2 1 o
4  10 + 3  10 + 5  10
Which can be written as
4  100 + 3  10 + 5  1
Or 400 + 30 + 5 = 435

The position to the right of the decimal point

carry a positional notation and corresponding weight as
well. The exponents to the right of the decimal point
are negative and increase in integer steps starting
with-1. This is expressed mathematically for each of
the first four positions as;
-1 -2 -3 -4
weight 10 10 10 10
Tenths hundredths thousandths ten thousandths
For example the value of the combination of symbols,
249.34 determined by adding the weight of each
position as
2 1 -1 -2
2  10 + 4  10 + 9  10° + 3  10 + 4  10 = 249.34

6.2 The Binary Number System

6
The binary number system is a number system of
base or radix equal to 2, which means that there are
two symbols used to represent number : 0 and 1 [2].
The symbols of the binary number system are used to
represent number in the same way as in the decimal
system symbol is used individually; then the symbols
are use combination. Since there are only two
symbols, we can represent two numbers, 0 and 1,
with individual symbols. The position of the 1 or 0 in a
binary number system indicates its weight or value
within the number. We then combine the 1 with 0 and
with itself to obtain additional numbers.
The type of positional weighted system is used
with binary numbers as in the decimal system; the
base 2 is raised to power equal to the number of
positions away from the binary point the weight and
designation of the several positions are as follows[3]:
Power equal to position Base

weight 2 1 0 -1 -2
positional notation 2 2 2 2 2
 (decimal value) 4 2 1 0.5 0.25
Since programmer count only in the decimal
input and output, it is only natural that we think in
terms of the decimal equivalent value when we see a
binary number. The conversion process is straight
forward and is done as follows: Multiply binary digit (1
or 0) in each position by the weight of the position
and add the results.

When the symbols 0 and 1 are used to

represent binary number, each symbol is called a
binary digit or a bit. Thus the binary number 1010 is a
four-digit binary number or a 4-bit binary number.
6.3 Binary-to-Decimal Conversion:
Example 1: Convert the following binary number to their
decimal equivalent. (a) 1101 (b) 1001
Solution

3 2 1 o
(a) 1101 = (1  2 ) + (1  2 ) + (0  2 ) + (1  2 )
= 8 + 4 + 0 + 1 = 13
3 2 1 0
(b) 1001 = (1  2 ) + (0  2 ) + (0  2 )+(1  2 )
=8+0+0+1=9

8
 Example 2: Convert the following binary numbers to their
decimal
equivalent. (a) 0.011 (b) 0.111
Solution:
-1 -2 -3
(a) 0.011 = (0  2 ) + (1  2 ) + (1  2 )
= 0 + 1/4 + 1/8
= 0.25 + 0.125 = 0.375
-1 -2 -3
(b) 0.111 = (1  2 ) + (1  2 ) + (1  2 )
=1/2 + 1/4 + 1/8
=0.5 + 0.25 + 0.125 = 0.875
Example 3: Convert the binary number 110.011 to its
decimal equivalent.
Solution:
2 1 -1 -2
110.011 = (1  2 ) + (1  2 ) + (0  2°) + (0 2 )+(1  2 ) + (1 
-3
2 )
= 4 + 2 + 0 + 0 + 1/4 + 1/8
= 4 + 2 + 0.25 + 0.125 = 6.375

6.4 Decimal-to-Binary Conversion:

It is frequently necessary to convert decimal
numbers to equivalent binary numbers. The two most
frequently used methods for making the conversion
are the
- Repeated division-by-2 or multiplication-by-2

method. Which is discussed below:

Repeated Division-by-2 or Method:

To convert a decimal whole number to an

equivalent number in a new base, the decimal number
is repeatedly divided by the new base. For the case of
interest here, the new base is 2, hence the repeated
division by
Repeated division by 2 means that the original
number is divided by 2, the resulting quotient is
divides by 2, and each resulting quotient thereafter is
divided by 2 until the quotient is 0. The remainder
resulting from each division forms binary number. The
first remainder to be produced is called the least
significant bit (LSB) and the last remainder is called
most significant bit (MSB).

When converting decimal fraction to binary,

multiply repeatedly by 2 any fractional part. The
equivalent binary number is formed from the 1 or 0 in

10
the units position. The following examples illustrate
the procedure[4]
Example 4: Convert the decimal number 17 to binary.

Solution:

2 17

2 8 1 L.S.B.

2 4 0

2 2 0

2 1 0

0 1 M.S.B.
Therefore, 17 =10001
Example 5: Convert the decimal number 0.625 to
binary.
Solution:

0.625  2 =1.250 1 (M S B)
 0.250  2 = 0.500 0
0.500  2 = 1.00 1 (L S B)
Therefore, 0.625 = 0.101

Note: Any further multiplication by 2 in example 5 will

equal to 0; therefore the multiplication can be

terminated. However, this, is not so. Often it will

be necessary to terminate the multiplication

when an acceptable degree of accuracy is

obtained. The binary number obtained will then

be an approximation[5]

Example 6: Convert the number 0.6 to binary:

Solution: Carry

0.6  2 =1.2 1 (M S B)
0.2  2 = 0.4 0
0.4  2= 0.8 0
0.8  2 = 1.6 1

12
 0.6  2 = 1.2 1 (LSB)
0.6 =0.10011

6.5 Double-Dibble Technique:

To convert a binary integer to a decimal integer

we make use of double-dibble technique. The verb
dibble is a neologism (i.e., a made-up-word) which
has found wide spread acceptance among
programmer's and other computer-oriented persons.
To dibble a number is to double it and then add 1.
The double-dibble technique for converting a binary
integr (whole-number) goes a follows:

Begin by setting the first 'results equal to 1. If

the second digit of the binary number is a zero then
double this 1 (= 2) and if the second binary digit is a
1, then dibble this 1 (= 3) to obtain the second result;
continue to double or dibble the successive results
according to whether the successive binary digits are
0 or 1; the result corresponding to the last binary digit
is the decimal equivalent of the binary integer
Example 7: Convert 110101101 to a decimal number.
Solution:

Binary digits 1 1 0 1 0 1 1 0 1

double 6 26 214

Results 1
dibble 3 13 53 107 429

110101101 =
Thus 429

6.6 The Octal Number System:

The octal number system is used extensively in digital

work because it is easy to convert from octal to
binary, vice versa. The octal system has a base; or
radix, of 8, which means that there are eight symbols
which are used to form octal numbers. Therefore, the
single-digit numbers of the octal, number system are

0 1, 2, 3, 4, 5, 6, 7

14
To count beyond 7, a 1 is carried to the next higher-
order column and combined with each of the other
symbols, as in the decimal system. The weight of the
different positions far the octal system is the base
raised to the appropriate power, as shown below

weight 3 2 1 0 -1 -2
positional notation 8 8 8 8 8 8
(decimal value) 512 64 8 1 1 1
8 64

Octal numbers look just like decimal numbers

except that the symbols 8 and 9 are not used. To
distinguish between octal and decimal numbers, we
must subscript the numbers with their base. For
example, 208 = 1610.

6.7 Octal-to-Decimal Conversion:

Octal numbers are converted to their decimal
equivalent by multiplying the weight of each position
by the digit in that position and adding the products.
This is illustrated in the following examples.
Example 8: Convert the following octal numbers to their
decimal, equivalent.

Solution: (a) 358(b) 1008 (c) 0.248

1 o
(a) 358 = (3  8 ) + ( 5  8 )
= 24 + 5 = 29
2 1 o
(a) 1008 = (1  8 ) + (0  8 ) + (0  8 )
= 64 +0 + 0 = 6410
-1 -2
(b) 0.248 = (2  8 ) +(4 8 )
2 4
= 8 + 64
= 0.312510

6.8 Decimal-to-Octal Conversion:

To convert decimal numbers to their octal
equivalent, the following procedures are employed:
- Whole-number conversion: Repeated division-by-
8.
- Fractional number conversion: Repeated multipli-
cation-by-8.
Repeated Division-by-8 Method:
The repeated-division by 8 method of
converting decimal to octal applies only to whole

16
numbers. The procedure is illustrated in the following
example.
Example 8: Convert the following decimal
numbers to their octal
equivalent:
(a) 245 (b) 175

Solution:

8 245 8 175

8 30 – 5 (LSD) 8 21 – 7

8 3– 6 8 2–5

0– 3 0–2
(MSD)

Therefore, 24510 = 3658, 17510 = 2578

Repeated Multiplication-by-8 Method:

To convert decimal fractions to their octal
equivalent requires repeated Multiplication by 8, as
shown in the following example.
Example 9: Convert the decimal fraction 0.432 to
octal equivalent.
Solution: Carry
 0.432  8 = 3.456 3(MSD)
0.456 8 = 3.648 3
0.648  8 5.184 5
0.184  8 = 1.472 1 (LSD)

Therefore, 0.43210 = 0.33518

The conversion to octal is not precise, since
there is a remainder. If greater accuracy is required,
we simply continue multiplying by 8 to obtained more
octal digits[6]
6.9 Octal-to-Binary-Conversion:
The primary reason for our interest in octal
numbers lies in entering and outputting computer data
and because of the ease of octal-to-binary
conversion. Computers recognize only binary
information and may be programmed using only, 1’s
and O’s.
Converting numbers from octal to binary can be
done essentially by inspection. Since there are eight
symbols used for counting in the octal system and
eight combinations of three binary digits that

18
corresponds to these single-digit octal numbers, we
can assign a binary three-digit combination to each
single-digit octal number as shown in the Table given
below:
Octal Binary
0 000
1 101
2 010
3 011
4 100
5 101
6 110
7 111

To convert from octal to binary, simply replace

each octal digit with the corresponding thee-digit
binary number, as illustrated in the following example
Example 10: Convert the following octal numbers to their
binary equivalent.

50
(a) 2478 (b) 18
Solution:
(a) 2 4 7 Octal
010 100 111 binary
 Thus, 2478 = 0101001112
(b) 5 0 1 octal
101 000 001 binary
Thus, 5018 = 1010000012
6.10 Binary-to-Octal Conversion:
In printing out octal numbers, the modern
electronic digital computer performs a binary-to-octal
conversion. The binary number is divided into groups
to three bits, counting to the right and to the left from
the binary point and then each group of three is
interpreted as an octal digit; as shown in above
table[10]

Example 11: Convert 11010101 . 01101 to an octal-number.

Solution: 011 010 101 . 011 10
01 01
011 0 101 1 010
3 2 5 3 2
11010101.011012 =
Therefore 325.328

20
6.11 Hexadecimal Numbers

Hexadecimal numbers are digital systems with base

16. In which each digit position represents a power of
16. For any number base greater than ten, a problem
occurs because there are more than ten symbols
needed to represent the numerals for that number
base. It is customary in these cases to use the ten
decimal numerals followed by the letters of the
alphabet beginning with A to provide the needed
numerals. Since the hexadecimal system is base 16,
there are sixteen numerals required. The following are
the hexadecimal numerals:
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F
The following are some examples of hexadecimal
numbers:
1016 4716 3FA16 A03F16
The reason for the common use of hexadecimal
numbers is the relationship between the numbers 2
and 16. Sixteen is a power of 2 (16 = 24). Because
of this relationship, four digits in a binary number can
be represented with a single hexadecimal digit. This
makes conversion between binary and hexadecimal
numbers very easy, and hexadecimal can be used to
write large binary numbers with much fewer digits.
When working with large digital systems, such as
computers, it is common to find binary numbers with
8, 16 and even 32 digits. Writing a 16 or 32 bit binary
number would be quite tedious and error prone. By
using hexadecimal, the numbers can be written with
fewer digits and much less likelihood of error.

To convert a binary number to hexadecimal, divide it

into groups of four digits starting with the rightmost
digit. If the number of digits isn’t a multiple of 4, prefix
the number with 0’s so that each group contains 4
digits. For each four digit group, convert the 4 bit
binary number into an equivalent hexadecimal digit.
For example: Convert the binary number 10110101
to a hexadecimal number

22
Divide into groups for 4 digits 1011 0101
Convert each group to hex digit B 5
B516
Another example: Convert the binary number
0110101110001100 to hexadecimal
Divide into groups of 4 digits 0110 1011 1000
1100
Convert each group to hex digit 6 B 8 C
6B8C16

- Conversion from binary to Hexadecimal:

A hexadecimal number is converted to a binary

number, by converting each hexadecimal digit into
a group of 4 binary digits.

(0010 1100 0110 1011. 1111 0000 0110) 2 =

(2 C 6 B. F 0 6) 16
= (2C6B.F06) 16

Example: Convert the hex number 374F into binary

 3 7 4 F
Convert the hex digits to binary 0011 0111 0100 1111

= 00110111010011112

- Conversion from Hexadecimal to binary:

(306.D) 16 = (0011 0000 0110. 1101) 2

- Conversion from Hexadecimal to Decimal:

(37B) 16 = 3 x 162 + 7 x 161 + 11 x 160

= 3 x 256 + 7 x 16 + 11 x 1
= 768 + 112 +11 = (891) 10

Hexadecimal Addition: Evaluate: (B A 3)16 +

(5 D E)16

Solution: We note from the table that

3 + E = 11

A + D = 17

17 + 1 (carry) = 18

24
 B + 5 = 10

10 + 1 (carry) = 11

1 1 carry

BA3

5DE

1181
The required sum is 1181 in hexadecimal.
Hexadecimal subtraction: Find Subtraction of E68D
and 74E using 16's complement method

E68D - 074E = ??? using 16's Complement

16's Complement of 074E = F8B2
1 1
E 6 8 D
+ F 8 B 2

1 D F 3 F

Ignore carry... Final answer = DF3F

6.12 Binary Arithmetic:
Binary arithmetic includes the basic arithmetic
operations of addition, subtraction, multiplication and
division. The following sections present the rules that
apply to these operations when they are performed on
binary numbers
Binary Addition:
Binary addition is performed in the same way as
addition in the decimal-system and is, in fact, much
easier to master. Binary addition obeys the following
four basic rules:

0 0 1 1
+0 +1 +0 +1
0 1 1 10

When adding more than single-digit binary

number, carry into, higher order columns as is done
when adding decimal numbers. For example 11 and
10 are added as follows:
11
+ 10
101

26
 In the first column (L S C or 2°) '1 plus 0 equal
1. In the second column (21) 1 plus 1 equals 0 with a
carry of 1 into the third column (22).
When we add 1 + 1 + 1 (carry) produces 11,
recorded as 1 with a carry to the next column.

Example 12: Add (a) 111 and 101 (b) 1010, 1001
and 1101.
Solution:

(2) (1) (1) (1)

(1) (1) 1 01 0
111 1 00 1
101 1 10 1
(a) (b)
1100 1 0 00 0

Binary Subtraction:
There are 3 representations for negative binary
number, Signed Magnitude, 1’s Complement and 2’s
Complement

Using 7 bits to represent each number, write the

representations of 23 and -23 in signed magnitude
and 2's complement integers
 Signed magnitude : This extra bit is called the
SIGN BIT and is placed before the magnitude of the
number to be represented. Generally, the MSB is
the sign bit and the convention is that when the sign
bit is 0, the number represented is positive and
when the sign bit is 1, the number is negative.

Signed Magnitude 1's Complement 2's Complement

23 0010111 0010111 0010111
-23 1010111 1101000 1101001

Binary subtraction is performed through addition

circuits by using complement method. In this chapter,
28
2’s complement method will be used to subtract two
binary numbers

The operation is carried out by means of the following

steps:

(i) At first, 2’s complement of the subtrahend is found.

(ii) Then it is added to the minuend.

(iii) If the final carry over of the sum is 1, it is dropped

and the result is positive.

(iv) If there is no carry over, the two’s complement of

the sum will be the result and it is negative.

Evaluate:

(i) 110110 - 10110

Solution:

The numbers of bits in the subtrahend is 5 while that

of minuend is 6. We make the number of bits in the
subtrahend equal to that of minuend by taking a `0’ in
the sixth place of the subtrahend.
Now, 2’s complement of 010110 is (101101 + 1)
i.e.101010. Adding this with the minuend.

1 10110 Minuend

1 01010 2’s complement

of subtrahend

Carry over 1 1 00000 Result of

addition

After dropping the carry over we get the result of

subtraction to be 100000.

(ii) 10110 – 11010

Solution:

2’s complement of 11010 is (00101 + 1) i.e. 00110.

Hence

Minued - 10110

2’s complement of subtrahend - 00110

Result of addition - 11100

30
As there is no carry over, the result of subtraction is
negative and is obtained by writing the 2’s
complement of 11100 i.e.(00011 + 1) or 00100.

Hence the difference is – 100.

(iii) 1010.11 – 1001.01

Solution:

2’s complement of 1001.01 is 0110.11. Hence

Minued - 1010.11

2’s complement of subtrahend - 0110.11

Carry over 1 0001.10

After dropping the carry over we get the result of

subtraction as 1.10.

(iv) 10100.01 – 11011.10

Solution:

2’s complement of 11011.10 is 00100.10. Hence

 Minued - 10100.0
1

2’s complement of subtrahend - 01100.1

0

Result of addition - 11000.1

1

As there is no carry over the result of subtraction is

negative and is obtained by writing the 2’s
complement of 11000.11.

Hence the required result is – 00111.01.

Binary multiplication:

Binary multiplication is performed in the same

manner as decimal multiplication. It is much easier,
since there are only two possible results of multiplying
two bits. The Binary multiplication obeys the four basic
rules.

32
 00=0
01=0
10=0

11=1

Example 15: Multiply the following binary numbers.

(a) 101  1 1 (b) 1101  10
(c) 1010  l 0 1 (d) 101l1010
Solution:
101 (b) 11101
(a) 11 10 
101 0000
101 1101
1111 11010

(c) 1010 (d) 1011

101  1010 
1010 0000
0000 1011
1010 0000
110010 1011
1101110

Multiplication of fractional number is performed

in the same way as with fractional numbers in the
decimal numbers.
Example 16: Perform the binary multiplication 0.01  11.
Solution:
0.01
11
01
01
0.11

Binary Division:
Division in the binary number system is
employed the same procedure as division in the
decimal system, as will be seen in the following
examples.

Example 17: Perform the following binary division.

(a) 110 ÷ 11 (b) 1100 ÷ 11

Solution:
(a) 10 (b) 100
11 110 11 11000
11 11
00 00
00 0 0_
00 00
00
00

34
 Binary division problems with remainders are
also treated the same as in the decimal system, as
illustrates the following example.

Example 18: Perform the following binary division:

(a) 1111 ÷ 110 (b) 1100 ÷ 101

Solution:
(a) 10. 1 (b) 10. 011

110 1 11 1.00 110 1 100.00

1 01
1 10
100
1 10
000
1 10
1000
000
101
110
101
1
(reminder)

6.13 Addition of octal numbers:

Addition of octal numbers is carried out by the same
principle as that of decimal or binary numbers.
An addition table for octal numbers is given below:
+ 0 1 2 3 4 5 6 7
0 0 1 2 3 4 5 6 7
1 1 2 3 4 5 6 7 10
2 2 3 4 5 6 7 10 11

3 3 4 5 6 7 10 11 12
4 4 5 6 7 10 11 12 13
5 5 6 7 10 11 12 13 14
6 6 7 10 11 12 13 14 15

7 7 10 11 12 13 14 15 16

With the help of this table addition of octal numbers is

best illustrated by the following examples:

Evaluate:

(i) (162)8 + (537) 8

Solution:

11 <---- carry

162

537
721

Therefore, sum = 7218

36
(ii) (136) 8 + (636) 8

Solution:

1 <---- carry

136

636
774

Therefore, sum = 7748

(iii) (25.27) 8 + (13.2) 8

Solution:

1 <---- carry

25.27

13.2
40.47

Therefore, sum = (40.47) 8

(iv) (67.5) 8 + (45.6) 8

Solution:
 11 <---- carry

67.5

45.6
135.3

Therefore, sum = (135.3) 8

Subtraction of octal numbers:

Similarly, subtraction of octal numbers can be
performed by the rules of subtraction of binary
numbers.
Find Subtraction of 2120 and 543 using 8's
complement method

2120 - 0543 = ??? Using 8's Complement

8's Complement of 0543 = 7235
1
2 1 2 0
+ 7 2 3 5

1 1 3 5 5

Ignore carry...
Final answer = 13558
38
Self-Check

1. The hex numbering system has a base of ________, and

the binary numbering system has a base of ________.
2. The value of a particular digit in a number is determined
by its relative position in a sequence of digits. (T/F)
3. A single hexadecimal digit can represent how many binary
digits: (a) two, (b) three, or (c) four?
4. The bases of the binary and decimal numbering systems
are multiples of 2. (T/F)
5. The binary equivalent of a decimal 255 is ________.
6. The binary equivalent of a hexadecimal 1C is ________.
7. The decimal equivalent of a hexadecimal 1B6 is ________.
8. The hexadecimal equivalent of a decimal 129 is ________.
9. The decimal equivalent of a binary 110101 is ________.
10. The hexadecimal equivalent of a binary 1001 is ________.
11. The binary equivalent of a decimal 28 is ________.
12. The binary equivalent of a hexadecimal 35 is ________.
13. The decimal equivalent of a hexadecimal 7 is ________.
14. The hexadecimal equivalent of a decimal 49 is ________.
15. The decimal equivalent of a binary 110110110 is
________.
16. The hexadecimal equivalent of a binary 1110 is ________.
17. The result of 1012 + 112 is ________ (in binary).
18. The result of A116 + BC16 + 1016 is ________ (in
hexadecimal).
19. The result of 6010 + F116 - 10010012 is ________ (in
decimal).
20. The result of 112 + 278 + 9310 - B16 is ________ (in
decimal).

40