Logic Gates — Revision Notes

⚡ 30-Second Revision

AND Gate: — $Y = A \cdot B$. Output '1' only if all inputs '1'.
OR Gate: — $Y = A + B$. Output '1' if any input '1'.
NOT Gate: — $Y = \bar{A}$. Inverts input.
NAND Gate: — $Y = \overline{A \cdot B}$. Universal. Output '0' only if all inputs '1'.
NOR Gate: — $Y = \overline{A + B}$. Universal. Output '1' only if all inputs '0'.
XOR Gate: — $Y = A \oplus B = A\bar{B} + \bar{A}B$. Output '1' if inputs are different.
XNOR Gate: — $Y = A \odot B = AB + \bar{A}\bar{B}$. Output '1' if inputs are same.
De Morgan's Theorems: — $\overline{A \cdot B} = \bar{A} + \bar{B}$ and $\overline{A + B} = \bar{A} \cdot \bar{B}$.

2-Minute Revision

Logic gates are the digital building blocks, processing binary 0s and 1s. The three basic gates are AND, OR, and NOT. AND requires all inputs to be '1' for a '1' output ($Y = A \cdot B$). OR needs at least one '1' input for a '1' output ($Y = A + B$).

NOT simply inverts its single input ($Y = \bar{A}$). NAND and NOR gates are crucial as 'universal gates' because any other gate can be constructed from them. NAND is 'NOT AND' ($Y = \overline{A \cdot B}$), giving '0' only when all inputs are '1'.

NOR is 'NOT OR' ($Y = \overline{A + B}$), giving '1' only when all inputs are '0'. XOR gates output '1' if inputs are different ($Y = A \oplus B$), while XNOR gates output '1' if inputs are the same ($Y = A \odot B$).

De Morgan's theorems ($\overline{A \cdot B} = \bar{A} + \bar{B}$ and $\overline{A + B} = \bar{A} \cdot \bar{B}$) are vital for simplifying Boolean expressions and understanding gate equivalences. Master truth tables and symbols for quick problem-solving.

5-Minute Revision

Start with the core: Logic gates are digital decision-makers, operating on binary inputs (0s and 1s) to produce a binary output. Each gate has a unique symbol, Boolean expression, and truth table.

1
Basic Gates:

* **AND ($Y = A \cdot B$):** Output '1' only if *all* inputs are '1'. Think of it as a series circuit where all switches must be closed. * **OR ($Y = A + B$):** Output '1' if *any* input is '1'. Like a parallel circuit, if any switch is closed, the light turns on. * **NOT ($Y = \bar{A}$):** Inverts the single input. If input is '1', output is '0', and vice-versa.

1
Universal Gates: — These are critical because they can form any other gate.

* **NAND ($Y = \overline{A \cdot B}$):** An AND gate followed by a NOT. Output '0' only if *all* inputs are '1'. To make a NOT gate from NAND, tie inputs together: $Y = \overline{A \cdot A} = \bar{A}$. * **NOR ($Y = \overline{A + B}$):** An OR gate followed by a NOT. Output '1' only if *all* inputs are '0'. To make a NOT gate from NOR, tie inputs together: $Y = \overline{A + A} = \bar{A}$.

1
Derived Gates:

* **XOR ($Y = A \oplus B = A\bar{B} + \bar{A}B$):** Output '1' if inputs are *different*. * **XNOR ($Y = A \odot B = AB + \bar{A}\bar{B}$):** Output '1' if inputs are *the same*.

Key Tools:

Truth Tables: — Essential for defining and verifying gate behavior. Always construct them systematically.
Boolean Algebra: — The mathematical system. Remember basic postulates like $A+0=A$, $A \cdot 1=A$, $A+\bar{A}=1$, $A \cdot \bar{A}=0$.
De Morgan's Theorems: — Crucial for simplification and gate conversion: $\overline{A \cdot B} = \bar{A} + \bar{B}$ and $\overline{A + B} = \bar{A} \cdot \bar{B}$.

Example: Simplify $Y = \overline{\bar{A} \cdot B}$. Using De Morgan's first theorem: $\overline{X \cdot Y} = \bar{X} + \bar{Y}$. Let $X = \bar{A}$ and $Y = B$. So, $Y = \overline{\bar{A}} + \bar{B} = A + \bar{B}$.

Practice tracing signals through cascaded gates and converting between gate types using universal gates. This topic is highly scoring in NEET if concepts are clear.

Prelims Revision Notes

1
Logic Gates Basics: — Elementary digital circuits performing logical operations on binary inputs (0/1) to produce a single binary output.
2
Binary System: — All operations are based on 0 (low voltage) and 1 (high voltage).
3
Truth Table: — Tabular representation of all possible input combinations and corresponding outputs for a logic gate or circuit.
4
Boolean Algebra: — Mathematical system for analyzing digital circuits. Variables are 0 or 1.

* AND (Logical Multiplication): $A \cdot B$. Output 1 only if A=1 AND B=1. * OR (Logical Addition): $A + B$. Output 1 if A=1 OR B=1 (or both). * NOT (Inversion): $\bar{A}$. Inverts input.

1
Basic Gates:

* AND Gate: Symbol (D-shape), $Y = A \cdot B$. * OR Gate: Symbol (curved), $Y = A + B$. * NOT Gate (Inverter): Symbol (triangle with bubble), $Y = \bar{A}$.

1
Universal Gates: — Can construct any other logic gate.

* NAND Gate: Symbol (AND with bubble), $Y = \overline{A \cdot B}$. Output 0 only if all inputs 1. (NOT from NAND: inputs tied. AND from NAND: two NANDs. OR from NAND: three NANDs). * NOR Gate: Symbol (OR with bubble), $Y = \overline{A + B}$. Output 1 only if all inputs 0. (NOT from NOR: inputs tied. OR from NOR: two NORs. AND from NOR: three NORs).

1
Derived Gates:

* XOR Gate (Exclusive OR): Symbol (OR with extra curve), $Y = A \oplus B = A\bar{B} + \bar{A}B$. Output 1 if inputs are different. * XNOR Gate (Exclusive NOR): Symbol (XOR with bubble), $Y = A \odot B = AB + \bar{A}\bar{B}$. Output 1 if inputs are same.

1
De Morgan's Theorems:

* $\overline{A \cdot B} = \bar{A} + \bar{B}$ (NAND is equivalent to OR with inverted inputs) * $\overline{A + B} = \bar{A} \cdot \bar{B}$ (NOR is equivalent to AND with inverted inputs)

1
Key Strategy: — Memorize truth tables and symbols. Practice tracing signals through combined gates. Understand universal gate conversions. Apply De Morgan's theorems for simplification.

Vyyuha Quick Recall

NAND and NOR are the 'UNI-versal' gates, because they can make 'NOT', 'AND', 'OR' for 'U' and 'I' and 'N' (universal).

For XOR: 'eXactly One Right' (output 1 if exactly one input is 1). For XNOR: 'eXactly None Right' or 'eXactly Both Right' (output 1 if both inputs are same, i.e., both 0 or both 1).