Memory & StorageKey Facts

Quick Reference - Binary Arithmetic

Part of Binary Arithmetic — GCSE Computer Science

This key facts covers Quick Reference - Binary Arithmetic 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 10 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 10 of 10

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

Quick Reference - Binary Arithmetic

Quick Reference - Binary Arithmetic

Keep building this topic

Practice Questions for Binary Arithmetic

Quick Recall Flashcards

Want to test your knowledge?