What you’ll work on
- Logic and algorithms
Start with the idea
Logical implication p⇒q is false only when p is true and q is false. Boolean operations AND, OR and NOT can be represented by truth tables or logic circuits.
An algorithm uses a finite, precise sequence of steps, including selection and repetition as needed. Track variable updates in order and state when a loop stops.
A worked example
Simplify (p AND q) OR (p AND NOT q).
- Factor p
- q OR NOT q is always true, so p AND true equals p.
Answer: p.
Try one question
List truth values of p⇒q for (p, q)=(T, T), (T, F), (F, T), (F, F).
Show answer and explanation
T, F, T, T.
Only true⇒false is false.
Inside the collection
| Resource | Length | Practice | Answers |
|---|---|---|---|
| Learn and practise | 4 pages | 4 questions | Included |
| Apply and extend | 4 pages | 4 questions | Included |
| Topic checkpoint | 3 pages | 4 questions | Included |
Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.