Six original Cambridge-style questions on normalisation, range, precision and the limits of floating point, every value checked, with mark points.
Give two reasons why floating-point numbers are normalised.
A floating-point number has an 8-bit mantissa and a 4-bit exponent, both two's complement. Normalise 00010110 0100, showing the new mantissa and exponent.
Using the same format, normalise 11110100 0101 and give its denary value.
For the same format, write the binary and the denary value of (a) the largest positive number and (b) the smallest positive normalised number.
A designer must use 12 bits for each floating-point number and is choosing between an 8-bit mantissa with a 4-bit exponent and a 6-bit mantissa with a 6-bit exponent. Explain the effect of each choice.
The denary value 0.1 is stored using an 8-bit mantissa and a 4-bit exponent as 01100110 1101. Explain why this is not exactly 0.1, and describe one consequence for a program. Also explain the term overflow.
Mark this once you have attempted all six and checked your working. It records a Practiced badge on the topic and adds a one-time bonus. Revealing the solutions alone does not count.