Level/NAND Gate: Difference between revisions

From Turing Complete
w:c:strategywiki>Henke37
m (Consistent heading caption)
w:c:strategywiki>Henke37
(Switch to Y/N templates)
Line 8: Line 8:
! Input One !! Input Two !! Output
! Input One !! Input Two !! Output
|-
|-
| False|| False|| True
| {{No}}|| {{No}}|| {{Yes}}
|-
|-
| False|| True|| True
| {{No}}|| {{Yes}}|| {{Yes}}
|-
|-
| True|| False|| True
| {{Yes}}|| {{No}}|| {{Yes}}
|-
|-
| True|| True|| False
| {{Yes}}|| {{Yes}}|| {{No}}
|}
|}



Revision as of 21:36, 6 February 2023

Time for the first level with an actual logic gate. This level asks you to figure out the behavior of the NAND gate.

NAND Gate Truth Table
Input One Input Two Output
No No Yes
No Yes Yes
Yes No Yes
Yes Yes No

As the truth table shows, a NAND gate returns true unless both inputs are true, then it returns false. so set the result accordingly and press the verify button.