Memory & StorageKey Facts
Binary Addition - The Foundation
Part of Binary Arithmetic — GCSE Computer Science
This key facts covers Binary Addition - The Foundation within Binary Arithmetic for GCSE Computer Science. Revise Binary Arithmetic in Memory & Storage for GCSE Computer Science with 15 exam-style questions and 18 flashcards. This topic appears regularly enough that it should still be part of a steady revision cycle. It is section 3 of 10 in this topic. Use this key facts to connect the idea to the wider topic before moving on to questions and flashcards.
Topic position
Section 3 of 10
Practice
15 questions
Recall
18 flashcards
Binary Addition - The Foundation
Binary Addition Rules (just like denary!):
0 + 0 = 0 (no carry) 0 + 1 = 1 (no carry) 1 + 0 = 1 (no carry) 1 + 1 = 10 (0 with carry 1) ← This is like 9+1=10 in denary! With carry from previous column: 1 + 1 + 1 (carry) = 11 (1 with carry 1)
Example 1: Simple Addition (no carry)
0011 (3)
+ 0101 (5)
------
1000 (8)
Check: 3 + 5 = 8 ✓
Example 2: Addition with Carry
0110 (6)
+ 0111 (7)
------
¹¹¹ ← carry bits
1101 (13)
Step-by-step:
Column 1 (rightmost): 0+1 = 1
Column 2: 1+1 = 0, carry 1
Column 3: 1+1+carry(1) = 1, carry 1
Column 4: 0+0+carry(1) = 1
Result: 1101 = 13 ✓
Example 3: Multiple Carries
10111 (23)
+ 01110 (14)
-------
¹¹ ¹ ← carry bits
100101 (37)
Check: 23 + 14 = 37 ✓