Summary
A logic gate is a circuit with one or more inputs and one output. The signals have only two levels: HIGH (1) and LOW (0). The three basic gates are OR, AND and NOT. Think of switches: an AND gate is two switches in series (both must be ON for the lamp to glow) and an OR gate is two switches in parallel (any one ON is enough).
NAND is AND followed by NOT. NOR is OR followed by NOT. XOR (exclusive OR) gives HIGH only when the two inputs are different. NAND and NOR are called universal gates because any other gate can be built from NAND gates alone, or from NOR gates alone.
Key formulas
- Gate
- Boolean expression
- OR
- Y = A + B
- AND
- Y = A·B
- NOT
- Y = Ā
- NAND
- Y = (A·B)′ = Ā + B̄
- NOR
- Y = (A + B)′ = Ā·B̄
- XOR
- Y = A ⊕ B = Ā·B + A·B̄
- Number of rows
- 2ⁿ for n inputs
- NOT from NAND or NOR
- Join the two inputs together
What this note covers
- OR, AND, NOT
- NAND, NOR, XOR
- Truth tables
Solved past-paper question (MHT-CET 2020)
In case of an AND gate
- (A) only if both the inputs are OFF, the output is ON
- (B) even if one of the inputs are ON, the output is ON
- (C) only if both the inputs are ON, the output is ON
- (D) if both the inputs are ON, the output is OFF
Solution
An AND gate is like two switches in series. The lamp is ON only if both are ON.
1 · 1 = 1, all other cases 0
Check the options. A (both OFF gives ON) describes NOR. B (one ON is enough) describes OR. D (both ON gives OFF) describes NAND.
Option C matches AND.
Answer: (C) only if both the inputs are ON, the output is ON
Common mistake: Choosing 'even if one input is ON, the output is ON': that is the OR gate.
The full note has 9 solved questions, 9 practice questions, figures and a topic test. Reading it on PrepKi is free after you log in.
PDF download is included in PrepKi plans. See plans.