You are viewing a free preview of this lesson.
Subscribe to unlock all 10 lessons in this course and every other course on LearningBro.
Truth tables are a systematic way to enumerate every possible combination of inputs and determine the resulting output for a Boolean expression or logic circuit. They are an essential tool for analysing, verifying, and comparing logic circuits and Boolean expressions in OCR H446.
Truth tables allow you to:
The number of rows in a truth table depends on the number of input variables:
| Variables | Rows (2^n) |
|---|---|
| 1 | 2 |
| 2 | 4 |
| 3 | 8 |
| 4 | 16 |
| 5 | 32 |
Key Term: For n input variables, a truth table has 2^n rows. Each row represents a unique combination of 0s and 1s.
Inputs should be listed in a standard binary counting pattern. For three variables A, B, C:
Subscribe to continue reading
Get full access to this lesson and all 10 lessons in this course.