1. Convert the following decimal numbers to binary.

a. 82

b. 120

2. Convert the following binary numbers to decimal.

a. 00111011

b. XXXXXXXXXXX /p>

3. Convert the following floating point numbers to binary.

.25

0625

4. Convert the following binary numbers to hex:

11011010

10101110011100101011101

4. Convert the following decimal numbers to 8‐bit Signed Integer Representation

9

25

5. Add the following 8‐bit signed integers together

01101010 + 01110111

10011000 + 10000111

6. Add the following numbers together using 8‐bit one’s complement binary representations

51 and ‐12

`

104 and ‐64

7. Convert the following numbers to 8‐bit two’s complement binary representations

a. 89 =

b. 15 =

8. What is the range of numbers we can represent with the following number of bits in two’s complement format?

a. 8 =

b. 16 =

c. 32 =

d. 64 =

9. Convert the following floating point numbers to IEEE 32‐bit floating format

65536

b. ‐93002

Convert the following floating point numbers to IEEE 32‐bit format

a. .125

b. ‐0.03125

c. ‐29.03125

84.8

Convert the following IEEE 32‐bit format representations to their base 10 floating point format.

a. 01000001110000000000000000000000

01001010010100101101100101000111

Complete the following problems, type your answers in a Word document and upload it in the drop box. Please show all work to get full credit. Convert the following Boolean expression to a circuit representation: ('A+B) xor (C+A).

Write the truth table for the following Boolean expression: 'AB + C'D

Create the Kmap and then simplify for the following function: F(x,y,z) = 'x'y'z+'xy'z+x'y'z+xy'z.

Using a KMap, determine if the following circuit can be reduced, if it can, draw the equivalent circuit. Show your truth table and minterms in your solution:

It depends on when it is completed and the way the answers are displayed. I do not have time to play a numbers game. But I will add up to 20 if it is done correctly.