For this simple logic gate everytime you would put in a "0" for both values "A" and "B" you would always get a 0 for the output. As long as both of the input values were both 1 or 0, you would get a 0 for the output. When the two inputs are different values, you get a 1 for the output.
| A | B | Output 1 | Output 2 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 |
In the second example for the table to the left, it shows that even though both of the two input switches went through different logic gates, they both had the exact same outputs. This table also shows that De Morgan's Law is true based on the values given and the way the logic gates worked in the above screenshot.
1 comment:
good job but you misunderstood the task.
task1 was asking you to simulate (not(xor(A,B))
Post a Comment