Write the truth table for a NAND gate connected as given in Fig. 14.45.
Hence identify the exact logic operation carried out by this circuit.
The output is obtained as (A∙A)’ = A’. (Since, A∙A = A)
Hence, the given gate acts as a NOT gate.
The truth table is given as follows:
Input (A) | Output (Y) |
0 | 1 |
1 | 0 |
NOTE: NAND gate is a universal gate because it can be used to implement any Boolean function without using any other gates.
16