Computer ScienceExam code: 0984

Boolean Logic and Expressions

Boolean Logic

Topic 26 covered the six logic gates as physical components: AND, OR, NOT, XOR, NAND, NOR. This topic covers the same gates as algebra: how to write them as expressions, derive them from circuits or truth tables, and evaluate them for given inputs.

A Boolean expression is an algebraic statement built from Boolean variables (each 0 or 1), the operators NOT, AND, OR, NAND, NOR and XOR, and brackets. Every expression evaluates to a single Boolean value, 0 or 1.

The output of a logic circuit can always be written as a Boolean expression in its inputs. Working the other way, every Boolean expression has a corresponding logic circuit and a corresponding truth table. The three representations are interchangeable; choosing the right one for a question is half the work.

Quick check

3 short questions on this note. See what has stuck, and where to look if something hasn't.

About 1 minute

Build on this topic