## 2.1.11 – Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR

**AND Gate**

**OR Gate**

**NOT Gate**

**XOR Gate**

**NAND Gate**

**NOR Gate**

## 2.1.12 – Construct truth tables using the above operators

Truth tables are used to show all the possible outcomes for a logic problem. Here is the truth table for an **AND** gate:

Above is just a simple examples and you are more likely in your exam to see something like below

## 2.1.13 – Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates

**Creating a Logic Diagram from a statement**

**Creating a statement from a Logic Diagram**

The Answer is **X = (A OR B) AND (B OR NOT C)**

**Order of Preference**

- NOT
- AND
- OR