Convert the following decimal numbers into their 32-bit floating
point representation (IEEE single precision). You may use a
calculator to do the required multiplications, but you must show
your work, not just the solution.
1. -59.75 (ANSW: 11000010011011110000000000000000)
2. 0.3 (ANSW: 00111110100110011001100110011010 (rounded)
00111110100110011001100110011001 (truncated; either answer is
fine))
Please show all work
Convert the following floating-point number (stored using IEEE
floating-point standard 754) to a binary number in non-standard
form.
0100_0001_1110_0010_1000_0000_0000_0000
Convert the following 32-bit IEEE floating point numbers to
decimal:
0100 1100 1110 0110 1111 1000 0000 0000
1011 0101 1110 0110 1010 0110 0000 0000
Determine whether or not the following pairs are equivalent by
constructing truth tables:
[(wx'+y')(w'y+z)] and [(wx'z+y'z)]
[(wz'+xy)] and [(wxz'+xy+x'z')]
Using DeMorgan’s Law and Boolean algebra, convert the following
expressions into simplest form:
(a'd)'
(w+y')'
((bd)(a + c'))'
((wy'+z)+(xz)')'
Draw the circuit that implements each of the following
equations:
AB'+(C'+AD')+D
XY'+WZ+Y'
(AD'+BC+C'D)'
((W'X)'+(Y'+Z))'
Convert the decimal floating point value 8.125 to a 12 bit
binary floating point value. Use a sign bit, 3 bits (excess 3) for
the exponent and an 8 bit significand. Enter just a 12 digit binary
value ( e.g. 0 000 11110000 ) spaces ignored.