ed 2 and 4
1. (15 points) Consider a miniature binary computer whose floating-point words consist of 4 binary (le, base-2)
digits for the mantissa and 3 binary digits for the exponent (plus sign bits). Let
I=(.1011)2 x 2°, y-(.1100)2 x 20
(0)
Mark in the provided table whether the machine operation indicated (with the result Z assumed normalised) is
exact, rounded (i.c., subject to nonzero rounding error), overflows, or under flows. Show your work.
exact
rounded
overflow
underflow
Operation
Z = f(-y)
Z = f((1 - y))
z=f(x + y)
Z =f(y + (r/2))
Answers
Answered by
3
Answer:
15
Step-by-step explanation:
Hope it helps Mark as brainliest
Similar questions