Boolean Algebra and Logic
Evaluating, representing and simplifying logical expressions and applying logic to program conditions, bit masks and digital circuits.
How to study A-level Computer Science
Define the problem and representation, trace the state change, justify the algorithm or architecture, then test the result against requirements, evidence and constraints.
Core concepts
Concept 1
Boolean variables take two logical values and combine through defined operations such as NOT, AND, OR and XOR.
Exam cue: Evaluate brackets and negation carefully before other operations.
Concept 2
Truth tables, expressions and logic diagrams are alternative representations of the same logical relationship.
Exam cue: Use a complete truth table to test claimed equivalence.
Concept 3
Boolean identities and De Morgan's laws support simplification and equivalence arguments.
Exam cue: Translate each requirement into a named condition before combining expressions.
Risk pitfalls and guardrails
Using everyday meanings of OR and XOR instead of their truth definitions.
Guardrail: Do not substitute a memorised definition or generic advantage until you have identified the input, state, stakeholder and constraint in the task.
Negating a compound expression without applying De Morgan's law to both operation and operands.
Guardrail: Do not substitute a memorised definition or generic advantage until you have identified the input, state, stakeholder and constraint in the task.
Assuming a shorter expression is equivalent without proof.
Guardrail: Do not substitute a memorised definition or generic advantage until you have identified the input, state, stakeholder and constraint in the task.
Memory anchors
AND
AND is true only when all required operands are true.
OR
Inclusive OR is true when at least one operand is true.
XOR
XOR is true when the operands differ.
De Morgan's Laws
Negating a compound swaps AND with OR and negates each operand.
Truth Table
A truth table lists the output for every possible input combination.
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
A safety output should activate only if sensor A and sensor B are both active. Which row rule describes `A AND B`?
An indicator should light when exactly one of two switches is on. Which row rule describes `A XOR B`?
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.”