-
-
Notifications
You must be signed in to change notification settings - Fork 50.5k
Expand file tree
/
Copy pathnand_gate.py
More file actions
63 lines (52 loc) · 1.57 KB
/
nand_gate.py
File metadata and controls
63 lines (52 loc) · 1.57 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
"""
A NAND Gate is a logic gate in boolean algebra which results to 0 (False) if both
the inputs are 1, and 1 (True) otherwise. It's similar to adding
a NOT gate along with an AND gate.
Following is the truth table of a NAND Gate:
------------------------------
| Input 1 | Input 2 | Output |
------------------------------
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
------------------------------
Refer - https://www.geeksforgeeks.org/logic-gates-in-python/
"""
def nand_gate(input_1: int, input_2: int) -> int:
"""
Calculate NAND of the input values
>>> nand_gate(0, 0)
1
>>> nand_gate(0, 1)
1
>>> nand_gate(1, 0)
1
>>> nand_gate(1, 1)
0
"""
return int(not (input_1 and input_2))
def n_input_nand_gate(inputs: list[int]) -> int:
"""
Calculate NAND of a list of input values
>>> n_input_nand_gate([1, 0, 1, 1, 0])
1
>>> n_input_nand_gate([1, 1, 1, 1, 1])
0
>>> n_input_nand_gate([0, 0, 0, 0, 0])
1
>>> n_input_nand_gate([1, 0, 0, 0, 0])
1
>>> n_input_nand_gate([1, 1])
0
>>> n_input_nand_gate([1])
Traceback (most recent call last):
...
ValueError: Input list must contain at least two elements
"""
if len(inputs) < 2:
raise ValueError("Input list must contain at least two elements")
return int(not all(inputs))
if __name__ == "__main__":
import doctest
doctest.testmod()