DASKEREL published · Year 10 · academic review pending

Computer Science GCSE

Original DASKEREL teaching informed by an attributed Oak unit sequence. This resource remains subject to qualified academic review. Check your examination board and tier before using it for exam preparation.

Year 10 · Original DASKEREL extended lesson · Academic review pending

Represent, add and check unsigned binary values

Allow up to 50 minutes for reading, practice and review · Source route: Oak AQA GCSE Computer Science · DASKEREL beta; board review required

DASKEREL wrote this resource using the Oak National Academy unit sequence as a curriculum reference. It is an extended lesson, not a complete unit or an exam-board-approved course. Academic review remains pending.

You will learn to

  • Convert unsigned integers between denary and eight-bit binary.
  • Perform binary addition with carries and recognise unsigned overflow.
  • Explain the range of a fixed-width unsigned representation.

Key terms: bit · binary · denary · place value · unsigned · carry · overflow

Teaching sequence

Check these ideas before you begin:

  • Read ordinary place-value columns in base ten.
  • Add small integers and understand powers of two as repeated doubling.
  1. 1. Retrieve place values · about 6 minutes

    Teach or study: Build the eight columns by doubling from 1 and distinguish value from bit width.

    Try: Write the eight weights and decode one sparse bit pattern.

  2. 2. Model both conversions · about 12 minutes

    Teach or study: Convert 173 by remainders and check by recomposition.

    Try: Convert 45 to binary, then independently decode the result.

  3. 3. Model carries and overflow · about 12 minutes

    Teach or study: Demonstrate 1+1 and 1+1+1, then contrast 255 with 256.

    Try: Trace 45+7 in columns and predict whether 250+10 fits in eight bits.

  4. 4. Practise and explain · about 15 minutes

    Teach or study: Inspect carry columns and require denary checks of every result.

    Try: Complete the guided addition and six answered conversion or overflow checks.

  5. 5. Exit verification · about 5 minutes

    Teach or study: Review the unsigned range and distinguish mathematical sums from stored results after overflow.

    Try: Answer two exit prompts with a short explanation.

Learn the idea

A computer stores a bit as one of two states, represented in this lesson by 0 or 1. A fixed-width unsigned binary number uses each position to contribute a power of two. In an eight-bit number, the place values from left to right are 128, 64, 32, 16, 8, 4, 2 and 1. To convert to denary, add only the values under the 1 bits. For example, 00101101 has 1s in the 32, 8, 4 and 1 columns, so it represents 45. Leading zeros do not change the value, but they show the chosen width. State whether a number is unsigned before discussing its range: signed representations use some bit patterns differently.

To convert a non-negative denary integer to eight-bit unsigned binary, repeatedly choose the largest place value that does not exceed the remainder. For 173, select 128, leaving 45; select 32, leaving 13; select 8, leaving 5; select 4, leaving 1; select 1. The 1 bits are therefore in columns 128, 32, 8, 4 and 1, giving 10101101. Verify by adding 128+32+8+4+1=173. A quick range check helps: eight unsigned bits have 2⁸=256 distinct patterns, from 0 to 255 inclusive. The largest pattern, 11111111, sums to 255, not 256.

Binary addition follows the same column principle as denary addition, but the base is two. In one column, 0+0 gives 0; 0+1 gives 1; 1+1 gives binary 10, so write 0 and carry 1. If two 1s meet an incoming carry, 1+1+1 gives binary 11: write 1 and carry 1. Align equal place values before adding. For 00101101 (45) plus 00000111 (7), work from right to left; the sum is 00110100 (52). Convert the result back to denary to catch a misplaced carry. Binary arithmetic is a procedure, not a different meaning for addition: the underlying quantities still total 52.

Fixed width matters when a result exceeds the available patterns. Eight-bit unsigned addition of 250 and 10 produces mathematical total 260. Since 260 exceeds 255, a ninth bit is needed to store the complete unsigned result. If the system retains only eight bits, the low eight bits represent 4: 260 modulo 256. Call this unsigned overflow and state both the true sum and the stored eight-bit result. Do not describe the wrapped value as the correct full sum. Whether software checks or ignores overflow depends on its design and the language or hardware; the GCSE exercise is about identifying the representation limit.

A bit pattern only has meaning when an interpretation is supplied. The same eight bits can be interpreted as an unsigned integer, part of a character encoding, a colour component or a signed integer under another convention. In this lesson we consistently use unsigned integers. A deliberate verification routine has three steps: check each conversion by recomposing its place values, check an addition in denary, and compare the denary total with the maximum storable value before reporting the binary result. This makes the answer auditable and highlights errors that a plausible-looking string of zeros and ones could conceal.

Worked example

Represent 173 in eight-bit unsigned binary and verify the conversion.

  1. Use columns 128,64,32,16,8,4,2,1.
  2. 173−128=45, so the 128 column is 1; 64 is 0.
  3. 45−32=13, so 32 is 1; 16 is 0.
  4. 13−8−4−1=0, giving 1s at 8, 4 and 1 and 0 at 2.
  5. Read 10101101; check 128+32+8+4+1=173.

173 is 10101101 as an eight-bit unsigned value.

Try together

Add 00111010 and 00000011 as eight-bit unsigned values. Show the denary check.

  • Decode the first value as 32+16+8+2.
  • Work from the right, carrying where 1+1 occurs.
  • Convert the result back to denary.
Show guided answer

00111010 is 58; adding 3 gives 61, which is 00111101. It fits in eight bits.

Practise independently

  1. Decode unsigned 01010110.
    Show answer and reasoning for question 1

    86. The set place values sum to 64+16+4+2=86.

  2. Write 45 in eight-bit unsigned binary.
    Show answer and reasoning for question 2

    00101101. 45=32+8+4+1; fill the other columns with 0.

  3. Write 200 in eight-bit unsigned binary.
    Show answer and reasoning for question 3

    11001000. The set place values are 128, 64 and 8, which sum to 200.

  4. Add 00101101 and 00000111; report binary and denary.
    Show answer and reasoning for question 4

    00110100, which is 52. 45+7=52; 52=32+16+4.

  5. What is the greatest unsigned eight-bit denary value?
    Show answer and reasoning for question 5

    255. 2⁸ gives 256 patterns numbered 0 through 255.

  6. Eight-bit unsigned storage retains only the low eight bits of 200+100. Report the full sum and stored value.
    Show answer and reasoning for question 6

    Full sum 300; stored value 44, with overflow. 300−256=44; 300 needs nine bits for its full representation.

DASKEREL exam-style practice · 6 draft marks

This original practice task and guidance are not an official examination-board paper or mark scheme.

An eight-bit unsigned register holds 11111010. Add 00001010. State both denary operands, the true sum, whether overflow occurs, and the retained eight-bit pattern with its denary value.

Show draft mark guidance
  • Decode 11111010 as 250 (1).
  • Decode 00001010 as 10 (1).
  • Calculate true sum 260 (1).
  • Identify 260 > 255, hence overflow (1).
  • State retained pattern 00000100 (1).
  • State retained unsigned value 4 and distinguish it from the true sum (1).

Exit ticket

Answer without looking back, then check your reasoning.

  1. What denary value does 10000101 represent as unsigned eight-bit binary?
    Show answer

    133, because 128+4+1=133.

  2. Does 255+1 fit in eight unsigned bits? What are the full sum and retained low-eight-bit result?
    Show answer

    No. The full sum is 256; retaining eight bits produces 0 and an overflow carry.

Check your understanding

  • Eight bits give 256 patterns but a maximum unsigned value of 255.
  • A carried ninth bit signals overflow; dropping it does not change the mathematical sum.
  • Bit patterns require an interpretation such as unsigned or signed.

Retrieve later: Explain why 11111111 represents 255, not 256, under unsigned eight-bit interpretation.

Next step: Compare unsigned representation with signed integers, character encodings and other data representations.

Library links: Oak National Academy · Representation of numbers (checked 2026-11-07) · DASKEREL subject library. Oak's applicable post-2022 content licence is OGL v3.0; some source assets have separate third-party rights. No Oak media is embedded here. DASKEREL is not affiliated with Oak.