Practical lesson: logic and logic circuits
This practical lesson uses everything from Chapter I together. First decide whether a sentence is a statement, then mark the simple statements with letters and write the compound statement as an expression. Build the table of the expression with the 8-step procedure and draw a circuit for the same expression: both rely on the same order of operations. To write an expression from a circuit, read the elements from the inputs to the output: each element gives one operation. If you are asked whether two expressions are the same, build both tables and compare the last columns; a difference in even one row means the expressions are not the same. Always check the result by walking through the circuit by hand for one input combination.
Two pupils wrote the entry rule for a quiz team in different words. They tested both versions with a table of all the cases and found one case where the answers differed, so they corrected the rule before it was announced.
Checkers, programmers and engineers verify one result in two different ways to be sure.
Write one two-condition rule in two forms, such as “not (A or B)” and “not A and not B”, and compare both tables on paper. Do the results match?
| A | B | C | ¬B | A ∨ ¬B | X |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 1 | 0 |
| 0 | 0 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 |
| A | B | ¬(A ∨ B) | ¬A ∨ ¬B |
|---|---|---|---|
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 0 |
“Circuit workshop”: pairs give each other an expression; the partner draws the circuit and then shows the output for one input combination.