4. Create truth tables for the Boolean operators OR, AND, and NOT.
The output of an OR gate is High when any one of the inputs is High. The input 1 represents High and input 0 represents Low.
Truth table for the Boolean operator OR:
Inputs |
Output |
|
x |
y |
x+y |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
The output of an AND gate is High when all the inputs are High. The input 1 represents High and input 0 represents Low.
Truth table for the Boolean operator AND:
Inputs |
Output |
|
x |
y |
x.y |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
1 |
1 |
The output of a NOT gate is complement to its input.
Truth table for the Boolean operator NOT:
Input |
Output |
0 |
1 |
1 |
0 |