Decimal - Base 10 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)

Binary - Base 2 (0, 1)

Octal - Base 8 (0, 1, 2, 3, 4, 5, 6, 7)

Hexadecimal - Base 16 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F)

1. (25)10 = (?)2 3. (19.625)10 = (?)2

2. (37)10 = (?)2 4. (23.125)10 = (?)2

1. (25)10 = (?)2

2
25
2
12 1
2
6 0
2
3 0 We need to add write the pattern from down to upwards like 11001 not 10011.
2
1 1
0 1
So, the Binary Conversion will be (11001)2

2. (37)10 = (?)2

2
37
2
18 1
2
9 0
2
4 1
2
2 0
2
1 0
0 1
So, the Binary Conversion will be (100101)2

3. (19.625)10 = (?)2

2 19
2 9 1
2 4 1
2 2 0
2 1 0
0 1

Now for the Decimal Part we need to multiply by 2 since the base is 2 for Binary

0.625 × 2 = 1.250
0.250 × 2 = 0.500
0.500 × 2 = 1.000

1
We can use Calculators to do the division.
1
0.000 × 2 = 0.000
We need to write the numbers before the decimal point then it will be 1010

(But if the number don’t stop and continues without starting from the same number then we will
calculate for 6th Decimal place if it starts recurring then we will stop right there).

So, the Binary Conversion will be (10011.1010)2

4. (23.125)10 = (?)2

2 23
2 11 1
2 5 1
2 2 1
2 1 0
0 1
Now the .125 parts

0.125 × 2 = 0.250

0.250 × 2 = 0.500

0.500 × 2 = 1.000

0.000 × 2 = 0.000
Therefore, the answer will be (10111.0010)2.

1. (10010)2 = (?)10
1 0 0 1 0
1×2 4
0×2 3
0×22 1×21 0×20
 16 + 0 + 0 + 2 + 0 = (18)10
2. (1100101)2 = (?)10
1 1 0 0 1 0 1
1×2 6
1×2 5
0×2 4
0×23 1×22 0×21 1×20
 64 + 32 + 0 + 0 + 4 + 0 + 1 = (101)10
3. (1010.010)2 = (?)10
1 0 1 0 0 1 0
1×24 0×23 1×22 0×20 0×2-1 1×2-2 0×2-3
1 1 1
 16 + 0 + 4 + 0 + 0× 2 + 1× 2×2 + 0× 2×2×2 = (10.25)10
4. (1001.1101)2 = (?)10
1 0 0 1 1 1 0 1
1×2 3
0×2 2
0×2 1
1×2 0
1×2 -1
1×2-2 0×2-3 1×2-4
 8 + 0 + 0 + 1 + 0.5 + 0.25 + 0 + 0.0625 = (9.8125)10

1. (178)10 = (?)8
8 178 2. (2089)10 = (?)8
8 22 2 8 2089
8 2 6 8 261 1
0 2 8 32 6
∴(262)8 is the answer. 8 4 0

2
 0 4 ∴(4061)8 is the answer.

3. (15.154)10 = (?)8
8 15
8 1 7
8 0 1
Now for the after decimal point part
0.154 × 8 = 1.232
0.232 × 8 = 1.856
0.856 × 8 = 6.848
0.848 × 8 = 6.784
0.784 × 8 = 6.272
0.272 × 8 = 2.176

∴(17.116662)8 is the answer.

1. (176)8 = (?)10
1 7 6
1×8 2
7×81 6×80
 64 + 56 + 6
 = (126)10
2. (257.67)8 = (?)10
2 5 7 6 7
2×8 2
5×8 1
7×80 6×8-1 7×8-2
 128 + 40 + 7 + 0.125 + 0.015
 = (175.14)10
3. (141.012)8 = (?)10
1 4 1 0 1 2
1×8 2
4×8 1
1×80 0×8-1 1×8-2 2×8-3
 64 + 32 + 1 + 0.125 + 0.015 + 0.001
 = (97.141)10

Binary to Decimal Conversion Table –

Binary Decimal
000 0
001 1
010 2
011 3
100 4
101 5
110 6
111 7
We need to use this table for easy conversion of Octal to Binary but not in Binary to decimal since we
need to show how it’s done! We can do it the long way by dividing it but this one will be much faster
than dividing we just need to remember the table!

1. (217)8 = (?)2

3
From the table we can see that 2 is 010, 1 is 001 and 7 is 111 so the binary will be – 010 001 1112

= (010 001 111)2

2. (102.011)8 = (?)2 3. (155.037)8 = (?)2
= (001 000 010.000 001 001)2 = (001 101 101.000 011 111)2

1. (1001)2 = (?)8

Here we can also use the binary decimal table, but we need to take out for 3 digits from right to left if
it’s before the decimal point but if it’s on the right of decimal we need do that from left to right!

Here we can see that from right to left there is 001 at the first but then we are left with a single 1
so we need to add zeros before to complete it like 001.

Therefore, the answer will be (001 001) = (11)8.

2. (11111.1001)2 = (?)8 3. (1100.111111)2 = (?)8

= (011 111.100 100) = (37.44) = (001 100.111 111) = (14.77)

1. (158)10 = (?)16 2. (398)10 = (?)16

16 158 16 398
16 9 (14)E 16 26 (14)E
0 9 16 1 8
= (9E)16 0 1
= (18E)16

1. (80A)16 = (?)10
8 0 A
8×16 2
0×161 A (10)×160
 2048 + 0 + 10
 = (2058)10
2. (10B.C13)16 = (?)10
1 0 B C 1 3
1×16 2
0×16 1
B (11)×16 0
C (12)×16-1 1×16-2 3×16-3
 256 + 0 + 11 + 0.75 + 0.003 + 0.0007
 = (267.7537)10

Binary Decimal Hexadecimal

0000 0 0
0001 1 1
0010 2 2
0011 3 3
0100 4 4
0101 5 5
0110 6 6

2
I gave the space for better understanding we don’t need to give that in actual answer. I will be giving spaces
everywhere, but you don’t need to.
4
 0111 7 7
1000 8 8
1001 9 9
1010 10 A (10)
1011 11 B (11)
1100 12 C (12)
1101 13 D (13)
1110 14 E (14)
1111 15 F (15)

1. (1AB)16 = (?)2
We need to same as Binary to Octal Conversion but with this table above us since we need 4
Bits to store values till 15(F)
= (0001 1010 1011)2
2. (70A.CD1)16 = (?)2
= (0111 0000 1010.1100 1101 0001)2
3. (89C.003)16 = (?)2
= (1000 1001 1100.0000 0000 0011)2

1. (29.7)10 = (?)2 1. (567.12)8 = (?)2

2. (43.14)10 = (?)2

1. (1010.1001)2 = (?)10 1. (2578)10 = (?)16

1. (72.170)10 = (?)8
1. (23.7A1)16 = (?)10
1. (1001.11010)2 = (?)8

5
1. (11011)2 = (?)16
 (0001 1011)2 = (1B)16
2. (110011.10011)2 = (?)16
 (0011 0011.1001 1000)2 = (33.98)16
3. (11110.001111)2 = (?)16
 (0001 1110.0011 1100)2 = (1E.3C)16

1. (8EB)16 = (?)8
 (100 011 101 011)2 = (4353)8
2. (73A0)16 = (?)8
 (0111 0011 1010 0000)2 = (000 111 001 110 100 000)2 = (071640)8
3. (A3B)16 = (?)8
 (1010 0011 1011)2 = (101 000 111 011)2 = (5073)8

1. (5174)8 = (?)16
 (101 001 111 100)2 = (1010 0111 1100)2 = (A7C)16
2. (72004)8 = (?)16
 (111 010 000 000 100)2 = (0111 0100 0000 0100)2 = (7404)16
3. (5712)8 = (?)16
 (101 111 001 010)2 = (1011 1100 1010)2 = (BCA)16

1. (7A.3C)16 = (?)8 2. (57.32)8 = (?)16

6
 BCD
BCD (Binary Coded Decimal) is a representation that combines groups of four binary digits to
represent decimal numbers. Each set of four binary digits in BCD corresponds to a single decimal digit.

Decimal 0 1 2 3 4 5 6 7 8 9
Binary 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001

.
1 1 1

3 -> 0011
+ 5 -> 0101
1000

7 -> 0111
+ 7 -> 0111
1110
0110 We need to add 6 here.
0001 1100

Note: If the sum of a 4-bit BCD addition exceeds 9, adding 6 to the result helps correct it. This
approach should be repeated until the result no longer exceeds 9 in each 4-bit segment.

Sum Carry
0 + 0 = 0 0
0 + 1 = 1 0
1 + 0 = 1 0
1 + 1 = 0 1
1 + 1 + 1 = 1 1

Note: In 4-bit BCD addition, if a carry is generated, adding 6 (0110 in binary) to the result helps to
ensure the correct result. This adjustment compensates for the limitations of 4-bit BCD representation
and accurately accounts for the carry that occurs when adding BCD digits that sum to a value greater
than 9.
1. 55 + 55 = 110 (Answer)3
2. 58 + 39 = 97 (Answer)
3. 58 + 59 = 117 (Answer)

Same process as before ones just leave it at the first answer

1. 1011 + 1111 = 1 10104

2. 1001 + 1011 + 1 0100

1. 974 ➔ 9’s Complement = 999 – 974 = 025

2. 7254 ➔ 9’s Complement = 9999 – 7254 = 2745 + 1 (we need to add one at the end).

3
I am not showing the process, but you must show the process.
4
I am doing this on side, but you need to show it like the BCD Addition just need stop at the first answer
7
1. 1011 = (1’s Complement) = 1111 – 1011 = 0100
2. 1001 = (2’s Complement) = 1111 – 1001 = 1 0110

• 7's Complement (n-1's Complement) • 8's Complement (n's Complement)

1. 767 = 7's Complement = 777 – 767 = 010
2. 707 = 8's Complement = 777 – 707 = 070 + 1 = 071 (we need to add one at the end)

• 15's Complement (n-1) • 16's Complement (n)

1. 7AB = FFF – 7AB = 15-7, 15-10, 15-11 = 854 15's Complement (n-1)
2. 701 = FFF – 701 = 8FE + 1 = 8FF 16's Complement (n)

1. 554 – 475 = 999 – 475 = 524 + 554 = 1,078 (now the 1 at end came as a carry we need
to add it to 078) 078 + 1 = 079 (Ans)
2. 475 – 554 = 999 -554 = 445 + 475 = 920 (now we need to again divide it by 9)
999 – 920 = -079 (Ans)

1. (902)16 = 15's Complement 2. (1AE)16 = 15's Complement

1. 750 – 524 = (?) 2. 524 – 750 = (?)