Last Sync: 2022-09-07 21:00:04
This commit is contained in:
parent
515f3e51c2
commit
91e9fd71f8
2 changed files with 6 additions and 3 deletions
|
@ -8,3 +8,5 @@ tags: [logic-gates, binary]
|
|||
---
|
||||
|
||||
# Creating memory with NAND gates
|
||||
|
||||

|
||||
|
|
|
@ -17,9 +17,10 @@ Diagram representing NAND gate:
|
|||
The diagram below shows how the circuit models the truth conditions for `NAND`
|
||||
|
||||
<img src="/home/thomas/repos/computer_science/img/NAND.gif" width="400" />
|
||||
* When both switches are off (corresponding to `false` `false`) the output is on (the bulb lights up).
|
||||
* If either one of the switches are on, the output remains on (corresponding to `true` `false` or `false` `true` )
|
||||
* It is only when both switches are on, that the output is off (corresponding to `true` `true` )
|
||||
|
||||
- When both switches are off (corresponding to `false` `false`) the output is on (the bulb lights up).
|
||||
- If either one of the switches are on, the output remains on (corresponding to `true` `false` or `false` `true` )
|
||||
- It is only when both switches are on, that the output is off (corresponding to `true` `true` )
|
||||
|
||||
This is the exact opposite to the truth-conditions for AND.
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue