Truth tables show the output of every possible input combination to a boolean expression.
The NOT gate truth table is the simplest one as it only has two rows.
Table 1 shows the truth table for Q = NOT(A).
Table 1
| A (in) | Q (out) |
|---|---|
0 |
1 |
1 |
0 |
Table 2 shows the truth table for Q = A AND B.
Table 2
| A (in) | B (in) | Q (out) |
|---|---|---|
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
1 |
Table 3 shows the truth table for Q = A OR B.
Table 3
| A (in) | B (in) | Q (out) |
|---|---|---|
0 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
Table 4 shows the truth table for Q = A XOR B.
Table 4
| A (in) | B (in) | Q (out) |
|---|---|---|
0 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
0 |
Note that the order of the rows matters. If you read the inputs row by row, they must count up in binary (00, 01, 10, 11).
What is the final column of the truth table for Q = NOT(A AND B)?
1, 1, 1, 0