Eduqas A500QS 1.2: Logical operations
The free BugBot lessons that teach this point, a robot to try it on, and the past-paper questions that test it.
Lessons that teach it
- A8.1 Logic gates and notation Boolean algebra and logic circuits
NOT, AND, OR, XOR, NAND and NOR, the notation each board uses, and why NAND alone can build anything. - A8.2 Circuits, expressions and truth tables Boolean algebra and logic circuits
Reading and drawing circuits, defining a problem in Boolean logic, and sum of products from a truth table. - A8.3 Boolean identities and laws Boolean algebra and logic circuits
The identities, commutation, association, distribution, double negation and absorption, proved by truth table. - A8.4 De Morgan's laws Boolean algebra and logic circuits
Breaking the bar and changing the sign, NAND and NOR, and rewriting the robot's loop condition. - A8.5 Simplifying expressions Boolean algebra and logic circuits
A method for simplifying by algebra, worked exam-style examples, and checking the result. - A8.6 Karnaugh maps Boolean algebra and logic circuits
Gray code order, grouping rules for two to four variables, wrap-around groups, and reading off the expression. - A8.9 Project: the robot's safety logic Boolean algebra and logic circuits
From a rule table to a Karnaugh map, a simplified expression, a proof and a robot that stops for the right reasons.
Try it on a robot
The task from A8.1 Logic gates and notation, running here. Change the program and press Run.
The specification is Eduqas's own document; this page says which of our lessons teach point 1.2 and is not endorsed by the board.