• Use the following logic gate symbols: NOT, AND, OR, NAND, NOR, XOR

• Understand and define the functions of :

  • NOT, AND, OR, NAND, NOR and XOR (EOR) gates

  • All gates except the NOT gate will have two inputs only

• Construct the truth table for each of the logic gates above

• Construct a logic circuit from:

  • a problem statement

  • a logic expression

  • a truth table

• Construct a truth table from

  • a problem statement

  • a logic expression

  • a logic expression

• Construct a logic expression from

  • a problem statement

  • a logic circuit

  • a truth table

Resources:

The slides used in the lessons can be found on the Unit 3 page (with some helpful notes in the speaker notes section).

This is the full length video used in lesson two.

Logic expressions (Boolean expressions)

Karnaugh Maps (K Maps)

While K Maps do not appear until A2, they are incredibly useful when simplifying so they have been covered early.