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