Author: M Abo Bakar Aslam
AND Gate
The AND gate produces outputs HIGH only when all inputs are HIGH. It performs logical multiplication in digital electronics.
1. Properties
- Minimum two inputs
- Output is 1 only if every input is 1
- Output is 0, if any input is 0
2. Symbol - 2 Inputs AND Gate
3. Boolean Expression - 2 inputs AND Gate
Y = A ⋅ B
4. Truth Table - 2 Inputs AND Gate
Total Number of Rows = 2^(number of inputs) = 2^2 = 4
Total Numbers: 0, 1, 2, 3
| A | B | Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
5. AND Gate with 3 Inputs
Symbol
Boolean Expression
Y = A ⋅ B . C
Truth Table
Total Number of Rows = 2^(number of inputs) = 2^3 = 8
Total Numbers: 0, 1, 2, 3, 4, 5, 6, 7
| A | B | C | Y |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
6. AND Gate with 4 Inputs
Symbol
Boolean Expression
Y = A ⋅ B . C . D
Truth Table
Total Number of Rows = 2^(number of inputs) = 2^4 = 16
Total Numbers: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
| A | B | C | D | Y |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 |
7. AND Gate with 1 Inputs
This logic-gates actually doesn't exist but we can construct it by using 2-Input-AND-Gate.
Symbol
Boolean Expression
Y = A ⋅ A = A
Truth Table
Total Number of Rows = 2^(number of inputs) = 2^1 = 2
Total Numbers: 0, 1
| A | Y |
|---|---|
| 0 | 0 |
| 1 | 1 |