Designing Circuits

From a truth table to gates

An interactive lesson with 6 steps, about 5 minutes: you predict, drag and solve, with instant feedback on every answer. It runs in your browser and needs JavaScript.

What you’ll learn

• Sum of products: AND each “yes” row, then OR them together.
• AND, OR and NOT can build any logic function.
• Boolean algebra simplifies circuits, saving gates.

Steps

1. Sum of products
2. Majority rules
3. A voting machine
4. Simplify
5. Truth table size
6. How many gates are there?