PrepWisePrepWiseBoolean Expressions
Boolean LogicDiagram

Boolean Algebra Reference

Part of Boolean Expressions — GCSE Computer Science

This diagram covers Boolean Algebra Reference within Boolean Expressions for GCSE Computer Science. Revise Boolean Expressions in Boolean Logic for GCSE Computer Science with 15 exam-style questions and 22 flashcards. This topic appears less often, but it can still be a useful differentiator on mixed-topic papers. It is section 2 of 11 in this topic. Focus on the labels, the relationships between parts, and the explanation that turns the diagram into an exam-ready answer.

Topic position

Section 2 of 11

Practice

15 questions

Recall

22 flashcards

Boolean Algebra Reference

Boolean algebra reference diagram showing the three core operations with their notations: AND gate (A AND B, A·B, A∧B) with output 1 only when both inputs are 1, OR gate (A OR B, A+B, A∨B) with output 1 when at least one input is 1, and NOT gate (NOT A, Ā, ¬A) which inverts the input, plus Boolean identities including De Morgan's laws, absorption law, and double negation

Keep building this topic

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

The Language of LogicDeep Dive: George Boole and the Birth of Binary LogicBoolean Expression NotationWriting Boolean Expressions from Descriptions

Practice Questions for Boolean Expressions

Which Boolean operator produces an output of 1 only when BOTH inputs are 1?

  • A. NOT
  • B. OR
  • C. AND
  • D. XOR
1 markfoundation

State De Morgan's first law and give an example to illustrate it.

2 marksstandard

Quick Recall Flashcards

Want to test your knowledge?

PrepWise has 15 exam-style questions and 22 flashcards for Boolean Expressions — with adaptive difficulty and instant feedback.

Join Alpha

Previous

The Language of Logic

Next

Deep Dive: George Boole and the Birth of Binary Logic