1. Use the IEEE-754 standard for 32-bit numbers: 1 sign bit, 8 exponent bits, 23 mantissa bits

Convert 100.625 to 32-bit floating point format

The ONE sign bit is _________, the EIGHT exponent bits are _______, and the TWENTY THREE mantissa bits are ______

2. Use the IEEE-754 standard for 64-bit numbers: 1 sign bit, 11 exponent bits, 52 mantissa bits

Convert -511.9921875 to 64-bit floating point format

The ONE sign bit is _________, the ELEVEN exponent bits are ___________, and the FIFTY TWO mantissa bits are _________

3. Use the IEEE-754 standard for 64-bit numbers: 1 sign bit, 11 exponent bits, 52 mantissa bits

Convert 11.25 to 64-bit floating point format

The ONE sign bit is _____________, the ELEVEN exponent bits are _________, and the FIFTY TWO mantissa bits are__________

4. Presume the existence of the following variables:

int x; int y; unsigned ux = x; unsigned uy = y;

Does the following statement hold true for all values of each variable? Which ranges work as expected? Which don't?

x & (x-1) != 0

5. Create truth tables to show all possible inputs and outputs for the following Boolean functions:

• (A B C)
• (A B C).

Do not modify the Boolean functions in any way.

What similarities do you find when you compare them against one another?

6. If a Boolean function has five inputs (A, B, C, D, E), how many combinations/rows are required for its truth table?

Who proved the theorem regarding the properties you just uncovered?