How are real numbers stored in floating-point form, and what does normalisation achieve?
Floating-point representation: storing a real number as a mantissa and an exponent in two's complement, evaluating a stored floating-point value, normalising a mantissa, and the trade-off between range and precision.
An Eduqas Component 2 answer on floating-point representation: storing a real number as a two's complement mantissa and exponent, evaluating a stored floating-point value, normalising a mantissa, and the trade-off between range and precision.
Reviewed by: AI editorial process; not yet individually human-reviewed
Have a quick question? Jump to the Q&A page
Jump to a section
What this dot point is asking
Eduqas wants you to explain how a real number is stored as a mantissa and exponent in two's complement, evaluate a stored floating-point value, normalise a mantissa, and explain the trade-off between range and precision. The classic questions are evaluating a stored value and normalising one, both without a calculator.
The answer
Storing a real number: mantissa and exponent
Evaluating a stored floating-point number
Normalisation and the range-precision trade-off
Examples in context
Floating point is how computers store and calculate with real numbers, scientific measurements, money in some systems, graphics coordinates, so the range-precision trade-off is a real engineering decision (single versus double precision). Normalisation is exactly why the IEEE floating-point standards used in every modern CPU keep numbers in a unique, maximally precise form. The two's complement skills from the previous dot point are used here for both the mantissa and the exponent, and rounding errors in floating point explain why 0.1 + 0.2 is not exactly 0.3 in many languages.
Try this
Q1. State the leading bits of a normalised positive mantissa and a normalised negative mantissa. [2 marks]
- Cue. Positive: ; negative: .
Q2. A mantissa represents and the exponent is . What is the denary value? [1 mark]
- Cue. .
Q3. For a fixed number of bits, what is the effect of giving more bits to the exponent? [1 mark]
- Cue. It increases the range of magnitudes representable but reduces precision (fewer mantissa bits).
Exam-style practice questions
Practice questions written in the style of WJEC Eduqas exam questions on this dot point, with worked answer explainers. The year tag is the paper they imitate, not the source.
Eduqas 20205 marksA floating-point number uses an 8-bit two's complement mantissa and a 4-bit two's complement exponent, with the binary point after the first mantissa bit. The mantissa is (using the convention ) and the exponent is . Calculate the denary value, showing your working.Show worked answer →
Read the exponent (up to 1): exponent , so the binary point moves places to the right.
Read the mantissa (up to 1): the mantissa represents in denary (with the point after the sign bit).
Apply the exponent (up to 2): moving the point places right multiplies by , so the value is (equivalently the bits become ).
State the result (up to 1): the denary value is .
Markers reward reading the exponent as the shift, reading the mantissa as a fraction, applying the shift (multiply by ), and the final value.
Eduqas 20215 marksExplain what it means to normalise a floating-point number, state the leading bits of a normalised positive and negative mantissa, and explain the trade-off between range and precision.Show worked answer →
Normalisation (up to 2 marks): adjusting the mantissa so it has no redundant leading bits, shifting it and changing the exponent to keep the value the same; this maximises the precision held in the available mantissa bits and gives each value a unique representation.
Leading bits (up to 1 mark): a normalised positive mantissa begins and a normalised negative mantissa begins (the first bit after the point differs from the sign bit).
Range versus precision (up to 2 marks): for a fixed total number of bits, giving more bits to the exponent increases the range of magnitudes that can be represented but leaves fewer mantissa bits, reducing precision; giving more bits to the mantissa increases precision but reduces range.
Markers reward the remove-redundant-bits definition, the correct leading bits, and the more-exponent-bits-more-range versus more-mantissa-bits-more-precision trade-off.
Related dot points
- Data representation of numbers: converting between binary, denary and hexadecimal, representing negative numbers with sign and magnitude and two's complement, binary addition and subtraction, and detecting overflow.
An Eduqas Component 2 answer on number representation: converting between binary, denary and hexadecimal, representing negative numbers with sign and magnitude and two's complement, binary addition and subtraction, and detecting overflow.
- Logical operations: the logic gates (AND, OR, NOT, NAND, NOR, XOR) and their truth tables, building and reading truth tables for expressions, the laws of Boolean algebra and De Morgan's laws, and simplifying expressions with Karnaugh maps.
An Eduqas Component 1 answer on logical operations: the six logic gates and their truth tables, building truth tables for expressions, simplifying with the laws of Boolean algebra and De Morgan's laws, and using Karnaugh maps to minimise a Boolean expression.
- Representing text, images and sound: character sets (ASCII and Unicode), bitmap images with resolution, colour depth and the file-size calculation, and sampled sound with sample rate, bit depth and the file-size calculation.
An Eduqas Component 2 answer on representing text, images and sound: the ASCII and Unicode character sets, bitmap images with resolution and colour depth and the file-size calculation, and sampled sound with sample rate and bit depth and the file-size calculation.
- Compression, encryption and error checking: lossy and lossless compression (run-length encoding and dictionary methods), symmetric and asymmetric encryption, and error-detection methods (parity, checksums and check digits).
An Eduqas Component 2 answer on compression, encryption and error checking: lossy versus lossless compression with run-length and dictionary methods, symmetric and asymmetric encryption, and error-detection methods including parity, checksums and check digits.
- Assembly language: the instruction set with its opcode and operand, common operations (load, store, add, jump, compare), the relationship between assembly and machine code, and immediate, direct and indirect addressing modes.
An Eduqas Component 2 answer on assembly language: the opcode and operand structure of an instruction, common operations such as load, store, add, jump and compare, how assembly maps to machine code via the assembler, and immediate, direct and indirect addressing modes.