Boolean Algebra Reference

Part of Boolean Expressions · Section 2 of 12

DiagramUnit: 3.4 Computer SystemsGCSE

This diagram covers Boolean Algebra Reference within Boolean Expressions for GCSE Computer Science. Revise Boolean Expressions in 3.4 Computer Systems for GCSE Computer Science with 17 exam-style questions and 22 flashcards. This topic appears regularly enough that it should still be part of a steady revision cycle. It is section 2 of 12 in this topic. Focus on the labels, the relationships between parts, and the explanation that turns the diagram into an exam-ready answer.

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

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

Previous

The Language of Logic

Next

Deep Dive: George Boole and the Birth of Binary Logic

17 questions on Boolean Expressions — practise free

Instant marking, adaptive difficulty and spaced-repetition flashcards — all aligned to your exam board.

Start revising free →