Level/OR Gate: Difference between revisions

From Turing Complete
m (Smaller truth table)
m (Use ON & OFF in truth table)
 
Line 6: Line 6:
|+ OR Gate Truth Table
|+ OR Gate Truth Table
|-
|-
! Input One !! Input Two !! Output
! Input 1 !! Input 2 !! Output
|-
|-
| {{No}}|| {{No}}|| {{No}}
| {{Off t}}|| {{Off t}}|| {{Off t}}
|-
|-
| {{No}}|| {{Yes}}|| {{Yes}}
| {{Off t}}|| {{On t}}|| {{On t}}
|-
|-
| {{Yes}}|| {{No}}|| {{Yes}}
| {{On t}}|| {{Off t}}|| {{On t}}
|-
|-
| {{Yes}}|| {{Yes}}|| {{Yes}}
| {{On t}}|| {{On t}}|| {{On t}}
|}
|}



Latest revision as of 23:24, 1 September 2024

This level has you create the OR Gate.

OR Gate Truth Table
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 1

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