The AND gate has two AND-combined input terminals.
If both input terminals are true, the output will also be true.
This means that the output Z will be HIGH (1), if input-terminal A and input-terminal B are HIGH (1). Otherwise the output Z will be LOW (0).
claim: You are a man and I am a man.
(If both you and I are men, the claim will be true. It will be false, if at least one of us is not a man.)
If... | the claim will be... |
---|---|
no one is a man, | False |
I'm a man, | False |
you're a man, | False |
we noth are men, | True |
claim (Z) = You (A) and me (B) are men.
A | B | Z |
---|---|---|
No man. | No man. | False |
No man. | Man. | False |
Man. | No man. | False |
Man. | Man. | True |
Z = A AND B
A | B | Z |
---|---|---|
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
claim: Lisa and Tina both swim in the swimming pool .
If Tina swims in the swimming pool and Lisa eats ice cream at the café, the claim will be __________.
false
If Tina swims on the left side and Lisa swims on the right side of the swimming pool, the claim will be __________.
true
It is possible to build this gate just from NAND gates: