Summary
A logic gate is a circuit with one or more inputs and one output, each being either 0 (low) or 1 (high). A circuit built from several gates is solved stage by stage: write the output of each gate on the diagram and then fill a truth table row by row.
To write the Boolean expression, start at the inputs and write the output of each gate as an expression. Then simplify with the standard laws. A simplified expression often shows the circuit is just a single gate.
Key formulas
- AND
- Y = A·B
- OR
- Y = A + B
- NAND
- Y = (A·B)′ = Ā + B̄
- NOR
- Y = (A + B)′ = Ā·B̄
- XOR
- Y = A·B̄ + Ā·B
- XNOR
- Y = A·B + Ā·B̄
- Absorption
- A + A·B = A, A + Ā·B = A + B
- NOT from NAND / NOR
- join both inputs
What this note covers
- Combination of gates
- Boolean expression from a circuit
- Output for given input waveforms
- De Morgan's laws
Solved past-paper question (JEE 2025)
A logic circuit uses two NOT gates and two AND gates (inputs A and B, with each AND gate fed by A and B or their complements) whose outputs feed a gate G to give the output Y. The truth table of the output is: A B Y = 00→1, 01→0, 10→0, 11→1. To obtain the given truth table, the following logic gate should be placed at G:
- (A) AND Gate
- (B) OR Gate
- (C) NOR Gate
- (D) NAND Gate
Solution
The two AND gates give A·B and Ā·B̄. The final gate G combines them.
P = A·B, Q = Ā·B̄
Target truth table: 1 for 00 and 11, and 0 for 01 and 10. At A = B = 0: P = 0 and Q = 1. At A = B = 1: P = 1 and Q = 0.
Y = 1 when P = 1 or Q = 1
At 01 and 10 both P and Q are 0 and Y = 0. So Y = P + Q.
Y = A·B + Ā·B̄
A gate that gives 1 when at least one input is 1 is an OR gate.
Answer: (B) OR Gate
Common mistake: Choosing AND or NAND at G because the first gates are AND gates. Read the target truth table, not the first stage.
The full note has 10 solved questions, 10 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.