Binary Place Values
Bits from left to right represent 2ⁿ down to 2⁰.
Decimal = Σ (bit × 2^position) Pearson Edexcel International GCSE 4CP0
Key binary, logic, storage, CPU, and networking calculations for Edexcel IGCSE theory (Paper 1) and practical programming (Paper 2).
Use this cheat sheet alongside pseudocode practice to stay confident with conversions, data size estimates, and performance calculations that Edexcel loves to assess.
Binary ↔ decimal ↔ hexadecimal conversions
Boolean algebra and logic gate reminders
Storage, sound, and image file calculations
CPU timing, bandwidth, and latency formulas
Bits from left to right represent 2ⁿ down to 2⁰.
Decimal = Σ (bit × 2^position) Repeatedly divide by 2, record remainders, read remainders in reverse.
Group binary digits into nibbles (4 bits) from the right and convert each nibble to hex.
Invert bits (one’s complement) then add 1 to represent negative numbers.
0 + 0 = 0 (carry 0) 0 + 1 = 1 (carry 0) 1 + 1 = 0 (carry 1) 1 + 1 + 1 = 1 (carry 1) 1 nibble = 4 bits, 1 byte = 8 bits, 1 KB = 1024 bytes, 1 MB = 1024 KB, etc.
ASCII uses 7/8 bits; Unicode (UTF-16) uses 16 bits per character.
File size (bits) = Number of characters × Bits per character Colour depth bits per pixel; divide by 8 for bytes.
File size (bits) = Width × Height × Colour depth File size (bytes) = (Width × Height × Colour depth) / 8 Sample rate in Hz (samples per second), bit depth bits per sample.
File size (bits) = Sample rate × Bit depth × Duration × Number of channels Frame size × frame rate × duration (apply compression factor if given).
File size (bits) ≈ Frame size × Frame rate × Duration A, B inputs (0 or 1). ¬ = NOT, · = AND, + = OR.
NOT A = ¬A AND: A · B OR: A + B NAND: ¬(A · B) NOR: ¬(A + B) XOR: A ⊕ B ¬(A · B) = ¬A + ¬B ¬(A + B) = ¬A · ¬B Use for binary addition in exam logic design questions.
Sum = A ⊕ B Carry = A · B Clock speed in Hz (cycles/s), CPI cycles per instruction.
Time per cycle = 1 / Clock speed Execution time = Number of cycles × Time per cycle Measure file size in bits for transmission calculations.
Bandwidth (bps) = Data transferred / Time Transmission time = File size (bits) / Transmission rate (bits per second) Latency ≈ propagation + transmission + processing delay.
Bit rate = baud rate × bits per symbol (binary: equal values).
Binary search comparisons ≈ ⌈log₂ n⌉ where n is list length.
Remember to initialise total ← 0, count ← 0.
average ← total / count Know typical orders: bubble sort O(n²), merge sort O(n log n), binary search O(log n).
Validation = range, length checks; verification = double entry/visual check.
Boost your Cambridge exam confidence with these proven study strategies from our tutoring experts.
Write each step in conversions to gain method credit even if a digit slips.
Add short comments describing purpose of loops and variables, especially under time pressure.
Explain what a higher bandwidth, latency, or CPI means for the real scenario in long answers.
Practice converting entire truth tables, ASCII charts, and check digit examples to build speed.
Join Tutopiya tutors for Edexcel-style coding and theory drills. We help you blend precise calculations with strong written explanations.
Aligned with Pearson Edexcel International GCSE Computer Science (4CP0) specification calculations.
Always state units (bits, bytes, Hz, seconds) and show intermediate steps for top marks.