Define problems using Boolean logic. See appendix 5d
1.4.3 Boolean Algebra
Boolean Algebra — Note 1 of 5
Candidates should be familiar with AND, OR, NOT and XOR. Candidates should be familiar with the logic of each Boolean operator, and the truth tables. Candidates should be able to define problems using Boolean logic, using the notation in appendix 5d.
Boolean logic expresses conditions that are either true or false, combined using operators such as AND, OR, NOT and XOR. You need to be able to turn a written problem into a Boolean expression using OCR's notation.
A ∧ B is true only when both A and B are true. Alternatives accepted: A AND B, A.B.A ∨ B is true when at least one of A or B is true. Alternatives: A OR B, A + B.¬A is true when A is false. Alternatives: NOT A, ~A, A with a bar over it.A ⊻ B is true when exactly one of A or B is true. Alternatives: A XOR B, A ⊕ B.≡ (or ↔) shows that two expressions always give the same result.Q = A ∧ (B ∨ C).