(N/A) $NAND$ gate is constructed by combining an $AND$ gate and a $NOT$ gate. $\therefore AND + NOT = NAND$.
This is an $AND$ gate followed by a $NOT$ gate. The symbol of this gate is represented by an $AND$ gate with a small circle at the output. It has two inputs $(A, B)$ and one output $(Y)$.
Function of $NAND$ gate: The output is $'0'$ only when all inputs are $'1'$,otherwise the output is $'1'$.
Boolean equation: $Y = \overline{A \cdot B}$.
Truth Table for $NAND$ gate:
| $A$ | $B$ | $Y$ |
|---|---|---|
| $0$ | $0$ | $1$ |
| $0$ | $1$ | $1$ |
| $1$ | $0$ | $1$ |
| $1$ | $1$ | $0$ |
$NAND$ gates are called universal gates because they can be used to realize other basic gates like $OR$,$AND$,and $NOT$.
$NOR$ gate is constructed by combining an $OR$ gate and a $NOT$ gate. $\therefore OR + NOT = NOR$.
This is an $OR$ gate followed by a $NOT$ gate. The symbol is an $OR$ gate with a small circle at the output.
Function of $NOR$ gate: The output is $'1'$ only when all inputs are $'0'$,otherwise the output is $'0'$.
Boolean equation: $Y = \overline{A + B}$.
Truth Table for $NOR$ gate:
| $A$ | $B$ | $Y$ |
|---|---|---|
| $0$ | $0$ | $1$ |
| $0$ | $1$ | $0$ |
| $1$ | $0$ | $0$ |
| $1$ | $1$ | $0$ |
$NOR$ gates are also called universal gates.