This key facts covers Boolean Expression Notation 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 4 of 12 in this topic. Use this key facts to connect the idea to the wider topic before moving on to questions and flashcards.
Boolean Expression Notation
There are several ways to write Boolean operations. GCSE Computer Science accepts multiple notations:
| Operation | GCSE Word Format | Mathematical Symbol | Alternative Notation | Example |
|---|---|---|---|---|
| AND | A AND B | A ∧ B | A · B or AB | Like multiplication |
| OR | A OR B | A ∨ B | A + B | Like addition |
| NOT | NOT A | ¬A | Ā or A' | Like negative/opposite |
Exam note: All GCSE boards accept ANY of these notations, but be consistent within your answer. Don't mix "A AND B" with "C ∨ D" - pick one style!
Practice questions for Boolean Expressions
Which Boolean operator produces an output of 1 only when BOTH inputs are 1?
State De Morgan's first law and give an example to illustrate it.