Level/OR Gate: Difference between revisions

From Turing Complete
w:c:strategywiki>Henke37
m (Forgot the next and prev pages)
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|| False
| {{No}}|| {{No}}|| {{No}}
|-
|-
| False|| True|| True
| {{No}}|| {{Yes}}|| {{Yes}}
|-
|-
| True|| False|| True
| {{Yes}}|| {{No}}|| {{Yes}}
|-
|-
| True|| True|| True
| {{Yes}}|| {{Yes}}|| {{No}}
|}
|}



Revision as of 21:37, 6 February 2023

This level has you create the OR Gate.

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

To solve this level, place one NAND gate and put NOT gates on both of the inputs.