Boolean Logic
Candidates should be able to:
1. Identify and use the standard symbols for logic gates
Logic gates symbols
2. Define and understand the functions of the logic gates
Including:
NOT
AND
OR
NAND
NOR
XOR (EOR)
the binary output produced from all the possible binary inputs
NOT is a single input gate
All other gates are limited to two inputs
3. - Use logic gates to create given logic circuits from a:
problem statement
logic expression
truth table
Complete a truth table from a:
problem statement
logic expression
logic circuit
Write a logic expression from a:
problem statement
logic circuit
truth table
A | B | C | Output |
|---|---|---|---|
0 | 0 | 0 | 0 |
0 | 0 | 1 | 1 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 1 |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 1 |
Circuits must be drawn for the statement given, without simplification
Logic circuits will be limited to a maximum of three inputs and one output
An example truth table with three inputs, for completion: