Logic Design and Digital Computer Circuits
Canonical and Standard Forms Activity
Directions: Solve the following statements on a clean sheet of paper
I. Given the following Boolean expression, simplify each using Boolean Algebra.
II. Represent the simplified Boolean expression using Logic Gates.
III. Represent the simplified Boolean expression using Canonical Form.
1. (A + B' + C') (A + B' + C) (A + B + C')
2. AB (C+BD') + (AB) (BD)'
3. XYZ + XY' (YZ') + XZ'