Writing Boolean Expressions from Descriptions
Part of Boolean Expressions — GCSE Computer Science
This key facts covers Writing Boolean Expressions from Descriptions 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 5 of 11 in this topic. Use this key facts to connect the idea to the wider topic before moving on to questions and flashcards.
Topic position
Section 5 of 11
Practice
15 questions
Recall
22 flashcards
Writing Boolean Expressions from Descriptions
You need to translate plain English descriptions into Boolean notation:
| Plain English Description | Boolean Expression | What It Means |
|---|---|---|
| A and B are both true | A AND B | Both inputs must be 1 |
| Either A or B is true (or both) | A OR B | At least one input is 1 |
| A is not true (A is false) | NOT A | A is 0 (inverted) |
| A is false but B is true | NOT(A) AND B | A must be 0 AND B must be 1 |
| A and B, or C | (A AND B) OR C | Either both A&B are 1, or C is 1 |
| Not (A or B) | NOT(A OR B) | Neither A nor B is 1 (both must be 0) |
"Both" or "all" → Use AND
"Either" or "at least one" → Use OR
"Not" or "opposite" → Use NOT