Binary Addition (AQA GCSE Computer Science)

Revision Note

Test yourself

Binary Addition

What is binary addition?

  • Binary addition is the process of adding together up to three binary integers (up to and including 8 bits)

  • To be successful there are 5 golden rules to apply:

Table showing binary addition examples, binary answers, and working explanations for combinations: 0+0, 0+1, 1+0, 1+1, and 1+1+1.
  • Like denary addition, start from the rightmost digit and move left

  • Carrying over occurs when the sum of a column is greater than 1, passing the excess to the next left column

Example 1

  • Add together the binary values 1001 and 0100

Table displaying binary numbers with LEDs for decimal values 8, 4, 2, and 1. First row: 1010, second row: 0110, both summed; result labeled 'C' is empty.
  • Starting from right to left, add the two binary values together applying the 5 golden rules

  • If your answer has 2 digits, place the rightmost digit in the column and carry the remaining digit to the next column on the left

  • In this example, start with 1+0, 1+0 = 1, so place a 1 in the column

A binary arithmetic operation table showing addition. Top row has columns labeled 8, 4, 2, and 1. A cell at bottom right shows a result of '1' in red, highlighted with a dashed red line.
  • Repeat until all columns have a value

Binary addition of two numbers in an 8-4-2-1 setup with the result in the bottom row showing 1101 and the digits being added above in separate rows.
  • The sum of adding together binary 1001 (9) and 0100 (4) is 1101 (13)

Examiner Tip

Make sure any carried digits are clearly visible in your answer, there are marks available for working. Carries can be put above or below in the addition

Example 2

  • Add together the binary values 00011001 and 10000100

Binary addition table showing two rows of 8-bit binary numbers. The columns from left to right are labeled 128, 64, 32, 16, 8, 4, 2, and 1.
  • Starting from right to left, add the two binary values together applying the 5 golden rules

  • If your answer has 2 digits, place the rightmost digit in the column and carry the remaining digit to the next column on the left

  • In this example, start with 1+1, 1+1 = 10, so place a 0 in the column and carry the 1 to the next column

Binary addition table with two rows. The first row of binary digits is 00010101, and the second row is 01000101. Carry numbers are highlighted in red boxes.
  • Repeat until all columns have a value

Binary addition chart with three rows. Each column is labeled as 128, 64, 32, 16, 8, 4, 2, 1. Dotted red boxes indicate carried-over values.
  • The sum of adding together binary 00011001 (25) and 10001001 (137) is 10100010 (162)

Example 3

  • Add together the binary values 00011011, 00010110 and 00100010

A table illustrating binary addition with columns labeled 128 to 1 and rows showing binary digits with sums. Plus and carry-over columns on the right.
  • Starting from right to left, add the two binary values together applying the 5 golden rules

  • If your answer has 2 digits, place the rightmost digit in the column and carry the remaining digit to the next column on the left

  • In this example, start with 1+0+0, 1+0+0 = 1, so place a 1 in the column

  • In the second column we have 1+1+1, 1+1+1 = 11, so place 1 in that column and carry the other 1 to the next column

Table with binary addition of three 8-bit numbers. The binary values are aligned under columns labeled 128 to 1. Results and carry values are highlighted.
  • Repeat until all columns have a value

Binary addition table for columns labeled 128 to 1, with four rows of binary digits. Final row shows the sum in binary form, and carry out marked by C.
  • The sum of adding together binary 00011011 (27), 00010110 (22) and 00100010 (34) is 01010011 (83)

What is an overflow error?

  • An overflow error occurs when the result of a binary addition exceeds the available bits

  • For example, if you took binary 11111111 (255) and tried to add 00000001 (1) this would cause an overflow error as the result would need a 9th bit to represent the answer (256)

The image shows a binary addition table with columns for 256, 128, 64, 32, 16, 8, 4, 2, and 1. Rows display binary digits (1s and 0s) for the addition process.

Last updated:

You've read 0 of your 10 free revision notes

Unlock more, it's free!

Join the 100,000+ Students that ❤️ Save My Exams

the (exam) results speak for themselves:

Did this page help you?

Robert Hampton

Author: Robert Hampton

Expertise: Computer Science Content Creator

Rob has over 16 years' experience teaching Computer Science and ICT at KS3 & GCSE levels. Rob has demonstrated strong leadership as Head of Department since 2012 and previously supported teacher development as a Specialist Leader of Education, empowering departments to excel in Computer Science. Beyond his tech expertise, Robert embraces the virtual world as an avid gamer, conquering digital battlefields when he's not coding.

James Woodhouse

Author: James Woodhouse

Expertise: Computer Science

James graduated from the University of Sunderland with a degree in ICT and Computing education. He has over 14 years of experience both teaching and leading in Computer Science, specialising in teaching GCSE and A-level. James has held various leadership roles, including Head of Computer Science and coordinator positions for Key Stage 3 and Key Stage 4. James has a keen interest in networking security and technologies aimed at preventing security breaches.