Level/AND Gate: Difference between revisions

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



Revision as of 23:22, 1 September 2024

This level has you create the AND Gate.

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

To solve this level, place one NAND gate and put a NOT gate on the output.