Summary
A logic gate is a digital circuit with one or more inputs and one output. Inputs and output are binary: 1 (high voltage) and 0 (low voltage). The three basic gates are OR (output 1 if any input is 1), AND (output 1 only if all inputs are 1) and NOT (output is the opposite of the input). In Boolean algebra: OR is Y = A + B, AND is Y = A · B, NOT is Y = Ā.
Key formulas
- OR
- Y = A + B
- AND
- Y = A · B
- NOT
- Y = Ā
- NAND
- Y = (A · B)̄ = Ā + B̄
- NOR
- Y = (A + B)̄ = Ā · B̄
- De Morgan
- (A + B)̄ = Ā · B̄ ; (A · B)̄ = Ā + B̄
- NOT from NAND or NOR
- (A · A)̄ = (A + A)̄ = Ā
- Rows in a truth table
- 2ⁿ for n inputs
What this note covers
- OR, AND, NOT
- NAND, NOR
- Truth tables
- NAND and NOR as universal gates
Solved past-paper question (NEET 2024)
A logic circuit provides the output Y as per the following truth table: A B Y 0 0 1 0 1 0 1 0 1 1 1 0 The expression for the output Y is:
- (A) B̄
- (B) B
- (C) A·B + Ā
- (D) A·B̄ + Ā
Solution
Read the truth table. Compare Y with A and with B row by row.
A B Y: 00→1, 01→0, 10→1, 11→0
Y changes when B changes (B = 0 gives 1, B = 1 gives 0) and does not change when A changes.
So Y is the inverse of B and A has no effect.
Y = B̄
Check an option such as A·B + Ā at A = 1, B = 0: it gives 0, but the table says 1. So only B̄ fits all rows.
Answer: (A) B̄
Common mistake: Writing an expression such as A·B̄ + Ā that fits only some rows. Always test every row.
The full note has 5 solved questions, 5 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.