0% found this document useful (0 votes)
48 views8 pages

Decimal and Binary Conversion Guide

Uploaded by

seokahchoi480sm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views8 pages

Decimal and Binary Conversion Guide

Uploaded by

seokahchoi480sm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

a) Convert the following values into decimal.

i. 5348 = 34810

5 3 4
4 2 1 4 2 1 4 2 1
1 0 1 0 1 1 1 0 0
5348 = 1010111002
1 0 1 0 1 1 1 0 0
256 128 64 32 16 8 4 2 1
256 + 64 16 + 8 4
34810

ii. 43548 = 228410

4 3 5 4
1 0 0 0 1 1 1 0 1 1 0 0

43548 = 1 0 0 0 1 1 1 0 1 1 0 02
1 0 0 0 1 1 1 0 1 1 0 0
2048 1024 512 256 128 64 32 16 8 4 2 1
2048 + 128 + 64 + 32 + 8 + 4
228410
b) Perform the following conversions.

i. 1110112 converts into a decimal number system?

1 1 1 0 1 1

25 24 23 22 21 20

32 16 8 4 2 1

32 + 16 +8 + 2+1

5910

1110112 = 5910 //

ii. 00110012 converts into a decimal number system?

0 0 1 1 0 0 1

2 2 2 2 2 2 2

64 32 16 8 4 2 1
16 + 8+1

25

00110012 = 2510 //
c) Convert the following decimal values to 8-bit 2's complement representation.

i. -7410 = 101101102

128 64 32 16 8 4 2 1
0 1 0 0 1 0 1 0 1’s

1 0 1 1 0 1 0 1
+1
1 0 1 1 0 1 1 0 2’s

ii. 14210 =

128 64 32 16 8 4 2 1

1 0 0 0 1 1 1 0

d) Convert the following decimal values to a 12-bit 2's complement representation.


i. 1014

2048 1024 512 256 128 64 32 16 8 4 2 1


0 0 1 1 1 1 1 1 0 1 1 0

ii. -126

204 102
512 256 128 64 32 16 8 4 2 1
8 4 1’s
0 0 0 0 0 1 1 1 1 1 1 0

1 1 1 1 1 0 0 0 0 0 0 1
+1
2’s
1 1 1 1 1 0 0 0 0 0 1 0
e) Convert the following decimal values to a 16-bit 2's complement representation

3276 1638 819 406 204 102 51 25 12


64 32 16 8 4 2 1
8 4 2 9 8 4 2 6 8
0 0 0 0 0 1 1 0 1 0 0 1 0 1 0 0

1 1 1 1 1 0 0 1 0 1 1 0 1 0 1 1
+1
1 1 1 1 1 0 0 1 0 1 1 0 1 1 0 0
i. -1684

1’s

ii. 892 2’s

3276 1638 819 406 204 102 51 25 12


64 32 16 8 4 2 1
8 4 2 9 8 4 2 6 8

0 0 0 0 0 0 1 1 0 1 1 1 1 1 0 0
01) a) Sum of -7 and 25

b) Sum of -14 and -11

c) Multiplication of -3 by -8

d) Multiplication of -12 by -5

e) Division of -40 by -2
05.
(a) Construct a truth table for this system.

X Y Z Output (F)

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 0

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 1

(b) From the truth table write down a Boolean equation.

(F) = XY’Z + XYZ’ + XYZ

(c) Using either Boolean algebra or Karnaugh maps, obtain a simplified expression.

00 01 11 10
1
0
1
1 1
Z //

(d) Draw a circuit to implement the system.

You might also like