Binary Addition and Shifts
Adding fixed-width binary values, detecting overflow and interpreting logical left and right shifts.
How to study for GCSE Computer Science
Move repeatedly between problem, algorithm, trace, code, test evidence and system explanation; use the exact language and assessment format required by your current board.
Core concepts
Concept 1
Binary addition follows base-2 carry rules and must be interpreted within the specified bit width.
Exam cue: Show carries and preserve the required bit width.
Concept 2
Overflow occurs when the mathematical result cannot be represented in the available bits.
Exam cue: Compare the result with the representable range before declaring overflow.
Concept 3
For unsigned values without discarded significant bits, a left shift multiplies by a power of two and a right shift performs integer division by a power of two.
Exam cue: State which bits are discarded and which zeros are inserted during a logical shift.
Risk pitfalls and guardrails
Keeping an extra carry bit despite a fixed-width result.
Guardrail: Do not substitute one board's syntax, protocol list, language version or extension topic for the multi-board core; check the current specification and exam year.
Calling any carry overflow.
Guardrail: Do not substitute one board's syntax, protocol list, language version or extension topic for the multi-board core; check the current specification and exam year.
Assuming shifting preserves all information or works identically for signed representations.
Guardrail: Do not substitute one board's syntax, protocol list, language version or extension topic for the multi-board core; check the current specification and exam year.
Memory anchors
Binary addition
Addition using base-2 digits and carries.
Overflow
A result outside the range available in the fixed representation.
Left shift
Moving bits toward higher place values and inserting zeros on the right.
Right shift
Moving bits toward lower place values and discarding least significant bits.
Bit width
The fixed number of bits available for a value.
Checkpoint rule
Do the check-up only after you can summarize each concept in one sentence and identify one dangerous pitfall from memory.
Knowledge Check (after reading)
Short check-up to confirm understanding of this module.
Check-up Questions
What is unsigned binary `0011 + 0101` in denary?
Which 4-bit result represents `0011 + 0101`?
Answer all questions to submit.
Next step personalized recommendations
Continue learning
Move forward only after this module is stable.
What is Pass Harbor?
Completely free exam prep for 247 UK exams.
- Practice questions
- Flashcards
- Study guides
- Mock exams
- No registration
- No paywall
- Start instantly
“No more expensive exam prep. Quality study tools should be accessible to everyone.”