(a)
Define problems using Boolean logic See Required Boolean algebra
(b)
Manipulate Boolean expressions, including the use of Karnaugh maps to simplify expressions
(c)
Use the following rules to derive or simplify Boolean statements:
- De Morgan’s Laws
- distribution
- association
- [[commutation]
- double negation
(d)
Use logic gate diagrams and truth tables See Required Boolean algebra
(e)
The logic associated with:
- D-type flip flops
- half adders
- full adders