- Related Questions & Answers
- What is Control Logic Gates?
- Logic Gates in Python
- What is Arithmetic Logic Shift Unit in Computer Architecture?
- Boolean Gates in JavaScript
- Walls and Gates in C++
- What are Logic Micro-Operations in Computer Architecture?
- What are some funny memes about Steve Jobs and Bill Gates?
- Arithmetic Logic Unit (ALU)
- Introduction to Mathematical Logic!
- Negation logic in SAP ABAP
- Description of logic controller interface
- Decimal counter using logic controller
- Mathematical Logic Statements and Notations
- Chip Select Logic in 8085 Microprocessor
- Inference Theory of the Predicate Logic

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

A logic gate is an electronic device that creates logical decisions depends on the various combinations of digital signals accessible on its inputs. A digital logic gate can have greater than one input signal but has only one digital output signal. There are seven basic logic gates such as AND, OR, XOR, NOT, NAND, NOR, and XNOR.

It is a digital logic gate. It has an output that is frequently at logic level “0” and goes “HIGH” to a logic level “1” when all of its inputs are at logic level “1”. The output of AND gate returns “LOW” when any of its inputs are at a logic level “0”.

The Boolean expression for AND gate is Q= A.B.

**The diagram demonstrates the truth table and symbol of the AND gate.**

**Truth Table**

A | B | C |
---|---|---|

0 | 0 | 0 |

1 | 0 | 0 |

0 | 1 | 0 |

1 | 1 | 1 |

OR gate is also a digital logic gate that has an output that is frequently at logic level ’0’, but goes ’HIGH’ to a logic level ’1’ when any of its inputs are at logic level ’1’. The output of a logic OR gate returns ’LOW’ again when all of its inputs are at a logic level ’0’.

The Boolean expression for OR gate is indicated as Q = A+B.

**The diagram demonstrates the truth table and symbol of the OR gate.**

**Truth Table**

A | B | C |
---|---|---|

0 | 0 | 0 |

1 | 0 | 1 |

0 | 1 | 1 |

1 | 1 | 1 |

In digital electronics, the NOT gate is also referred to as inverting buffer or a digital inverter element. A NOT gate is a single input device. It has an output level that is provided at logic level ‘1’. It goes ‘LOW’ to a logic level ‘0’ whenever the single input is at logic level ‘1’. The output from a NOT gate returns ’HIGH’ when its input is at logic level ’0’.

The Boolean expression of NOT gate is Q=A

**The figure shows the truth table and symbol of NOT gate.**

**Truth Table**

A | Q |
---|---|

0 | 1 |

1 | 0 |

**Boolean Expression Q = not A or $\bar{A}$**

NAND gate is a mixture of AND gate with an inverter or NOT gate linked in series. It has an output that is frequently at logic level ’1’ and only goes ’LOW’ to logic level ’0’ when all of its inputs are at logic level “1”.

The Boolean expression of the NAND gate is Q= $\bar{A.B}$

The diagram demonstrates the truth table and symbol of the NAND gate.

**Truth Table**

A | B | Q |
---|---|---|

0 | 0 | 1 |

1 | 0 | 1 |

0 | 1 | 1 |

1 | 1 | 0 |

NOR gate is a mixture of OR gate with a NOT gate linked in a series. The NOR gate has an output that is generally at logic level ’1’ and only goes ’LOW’ to logic level ’0’ when any of its inputs are at logic level ’1’.

The Boolean expression of NOR gate is Q= $\bar{A+B}$

**The diagram demonstrates the truth table and symbol of the NOR gate.**

**Truth Table**

A | B | Q |
---|---|---|

0 | 0 | 1 |

1 | 0 | 1 |

0 | 1 | 1 |

1 | 1 | 0 |

It is a circuit that will give a high output if one of its inputs is high but not both of them. The XOR operation is defined by an encircled plus sign.

The Boolean expression is Q= (A$\oplus$B) = A.B+A.B

**The diagram displays the truth table and symbol of the Exclusive-OR gate.**

**Truth Table**

A | B | Q |
---|---|---|

0 | 0 | 0 |

1 | 0 | 1 |

0 | 1 | 1 |

1 | 1 | 0 |

The Exclusive-NOR gate function is a digital logic gate that is an interdependent form of the Exclusive-OR function. This function is at logic level ’1’, but it goes ’LOW’ to logic level ’0’ whenever any of its inputs are at logic level ’1’.

The Boolean expression is $\bar{Q}$ = (A$\oplus$$\bar{B}$) = A.B + A.B.

**The figure shows the truth table and symbol of the Exclusive-NOR gate.**

**Truth Table**

A | B | Q |
---|---|---|

0 | 0 | 1 |

1 | 0 | 0 |

0 | 1 | 0 |

1 | 1 | 1 |

Advertisements