Binary addition, overflow and shifts

Computers add binary numbers column by column, just like you add in denary. Shifting bits left or right is a quick way to multiply or divide by 2.

Practise this lesson free (7 questions)

More tools

Binary addition rules

0 + 0 = 0
0 + 1 = 1
1 + 1 = 0 carry 1
1 + 1 + 1 = 1 carry 1
Work from the right-hand column, carrying into the next column.
ItemBinaryDenary
01101100108
+0011010153
=10100001161

Overflow

8 bits can only hold up to 255 (unsigned).
If a result needs a 9th bit, there is no room for it. This is overflow and the stored result is wrong.
11001000 (200) + 01000000 (64) = 264, which needs 9 bits.

Binary shifts

Logical shift left: move every bit left, fill the gaps on the right with 0. Each place multiplies by 2.
Logical shift right: move every bit right, fill on the left with 0. Each place divides by 2 (losing any remainder).
Arithmetic shift right: used for signed numbers. The left gaps are filled with copies of the sign bit, so negative numbers stay negative.
00010110 (22) shifted left 2 places = 01011000 (88)
Worked example

Add 00110101 and 00011010.

  1. 53 + 26 in denary
  2. Add column by column from the right, carrying 1s.

Answer: 01001111 (79)

Key idea

1 + 1 = 0 carry 1. A result too big for the bits available causes overflow. Logical shifts fill with 0s: left multiplies by 2 per place, right divides by 2. Arithmetic right shifts copy the sign bit.

Key words
Binary
Base 2: the number system that uses only the digits 0 and 1.
Binary addition
0 + 0 = 0, 0 + 1 = 1, 1 + 1 = 0 carry 1, 1 + 1 + 1 = 1 carry 1. A carry out of the leftmost bit means overflow.
Overflow
When a result is too large for the number of bits available to store it.
Shifts
Logical shift left one place multiplies by 2; logical shift right one place divides by 2 (losing any remainder); both fill with 0. Arithmetic shift right fills with copies of the sign bit. Example: 00010110 (22) left 2 = 01011000 (88).
Bit
A single binary digit, 0 or 1.
Logical shift
Moving all the bits left or right and filling the gaps with 0s.

All GCSE and International GCSE Computer Science key terms and definitions โ†’

Quick check

Try two quick questions

See if it has sunk in. Answers are marked straight away.

Extra practice

2 more questions

Try each one, then tap to check.

  1. Add these 8-bit binary numbers: 00100110 + 00010001

    Show the answer

    Answer: 00110111

    In denary: 38 + 17 = 55, which is 00110111.

  2. Add these 8-bit binary numbers: 01011011 + 00100110

    Show the answer

    Answer: 10000001

    In denary: 91 + 38 = 129, which is 10000001.

Check you have got it

Answer 7 quick questions with instant marking. If you get one wrong, GCSE-ready shows you why and gives you another go. It is free, and you do not need an account.

Video for this lesson coming soon. Subscribe on YouTube

Sources and references

Facts checked against the sources below, 17 October 2026. Last updated 2 October 2026. Spotted a mistake? Tell us and we will fix it.

What do exam command words like explain and evaluate mean? โ†’

Related lessons