3.3 Data RepresentationKey Facts

Quick Reference - Binary Arithmetic

Part of Binary Arithmetic · GCSE GCSE Computer Science revision

This key facts covers Quick Reference - Binary Arithmetic within Binary Arithmetic for GCSE Computer Science. Revise Binary Arithmetic in 3.3 Data Representation for GCSE Computer Science with 15 exam-style questions and 18 flashcards. This is a high-frequency topic, so it is worth revising until the explanation feels precise and repeatable. It is section 10 of 11 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 10 of 11

Practice

15 questions

Recall

18 flashcards

Quick Reference - Binary Arithmetic

Addition Rules:

  0 + 0 = 0
  0 + 1 = 1
  1 + 0 = 1
  1 + 1 = 10 (0, carry 1)
  1 + 1 + 1 = 11 (1, carry 1)

Shift Operations:

Left shift 1: × 2
Left shift 2: × 4
Left shift 3: × 8
Right shift 1: ÷ 2
Right shift 2: ÷ 4
Right shift 3: ÷ 8

Two's Complement Conversion:

Flip all bits (0→1, 1→0)
Add 1
Done!

Number Ranges (8-bit):

Unsigned: 0 to 255
Two's complement: -128 to +127

Keep building this topic

Read this section alongside the surrounding pages in Binary Arithmetic. That gives you the full topic sequence instead of a single isolated revision point.

Exam Tips - Binary Arithmetic Knowledge Organiser: Binary Arithmetic The Lego Addition Machine Deep Dive: Why Binary Arithmetic Matters

Practice Questions for Binary Arithmetic

In binary addition, what is the result of 1 + 1?

A. 1
B. 10
C. 2
D. 11

1 markfoundation

Explain the effect of a logical left shift and a logical right shift on the value of a binary number.

2 marksstandard

Quick Recall Flashcards

15 questions on Binary Arithmetic — practise free

Instant marking, adaptive difficulty, and 18 spaced repetition flashcards. Free until your GCSEs.

Try PrepWise Free

Exam Tips - Binary Arithmetic

Knowledge Organiser: Binary Arithmetic