**Boolean Operators**:

Single Input Single Output:
Operation
A and B take binary (0,1) values.

*eg. NOT operation 12.1.
*

*Multiple Inputs Single Output:
*

*Eg 1. OR operation 12.2.
*

* if either of ``or'' is
*

*The truth table is as follows:
*

A |
B |
C |

0 |
0 |
0 |

0 |
1 |
1 |

1 |
0 |
1 |

1 |
1 |
1 |

*Truth table for OR gate
*

*Eg 2. AND operation is shown in figure 12.3
*

A |
B |
C |

0 |
0 |
0 |

0 |
1 |
0 |

1 |
0 |
0 |

1 |
1 |
1 |

*Truth table for AND gate
*

*
These were basic gates which are implemented using transistor and
other devices.
*

*The transistor implementation is shown if figure 12.4
*

*IC based gates are shown in figure 12.5
*

**Other functions**

*NAND: Not + AND
*

A |
B |
C |

0 |
0 |
1 |

0 |
1 |
1 |

1 |
0 |
1 |

1 |
1 |
0 |

*Truth table for NAND gate
*

**NOR gate**

Not+OR gate

A |
B |
C |

0 |
0 |
1 |

0 |
1 |
0 |

1 |
0 |
0 |

1 |
1 |
0 |

*Truth table for NOR gate
*

**X-OR gate**

Exclusive-OR gate

A |
B |
C |

0 |
0 |
0 |

0 |
1 |
1 |

1 |
0 |
1 |

1 |
1 |
0 |

*Truth table for X-OR gate
*

**X-NOR gate**

Exclusive NOR

A |
B |
C |

0 |
0 |
1 |

0 |
1 |
0 |

1 |
0 |
0 |

1 |
1 |
1 |

*Truth table for X-NOR gate.
*