NEET Physics · Semiconductor Electronics
Logic Gates
The five basic gates OR, AND, NOT, NAND and NOR with their truth tables, and how to reduce a circuit of gates to one expression, one truth table or one equivalent gate.
Why this matters
Eight NEET questions from 2021 to 2025, four of them from 2024, and none in the two 2026 papers. Six give a circuit of gates and ask for its output, its truth table or the single gate it equals; one of these, in 2021, gives the inputs as waveforms. One asks for the expression behind a truth table, and one for the gate made by an OR gate followed by a NOT gate.
Concept 1 of 3: The basic gates and their truth tables
Definition
- OR: . AND: . NOT: , one input.
- NAND is an AND gate followed by a NOT gate: .
- NOR is an OR gate followed by a NOT gate: .
- NAND and NOR are called universal gates: OR, AND and NOT can all be built from NAND gates alone, or from NOR gates alone.
- A truth table lists the output for every input combination: 4 rows for two inputs, 8 rows for three.
| Gate | Output Y | Y for inputs 00, 01, 10, 11 | Y is 1 when |
|---|---|---|---|
| OR | 0, 1, 1, 1 | at least one input is 1 | |
| AND | 0, 0, 0, 1 | both inputs are 1 | |
| NOT | 1 for A = 0, 0 for A = 1 | the input is 0 | |
| NAND | 1, 1, 1, 0 | at least one input is 0 | |
| NOR | 1, 0, 0, 0 | both inputs are 0Q Re-NEET 2024: an OR gate whose output feeds a NOT gate acts as a NOR gate. |
Practise this conceptself-check · 4 quick reps
The same idea in a real exam question:
Example 1 · Semiconductor Electronics · Logic Gates
NAND and NOR are easy to swap
One row fits several gates
Concept 2 of 3: Reducing a circuit with Boolean algebra
Definition
- Work from the inputs to the output, writing each gate's output in terms of A and B.
- Rules: , , , , , , and .
- De Morgan's theorems: and .
- Two results worth knowing: NOT gates on both inputs of a NAND make an OR gate, ; NOT gates on both inputs of a NOR make an AND gate, .
- Reading a truth table: if Y does not change when A changes (with B held), Y does not depend on A.
De Morgan's theorems
Worked example
Practise this conceptself-check · 4 quick reps
The same idea in a real exam question:
Example 2 · Semiconductor Electronics · Logic Gates
| A | B | Y |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
Break a bar only with De Morgan
Invert the right input
Check one row in the original circuit
Concept 3 of 3: Joined inputs and waveform inputs
Definition
- A NAND gate with its inputs joined: . A NOR gate with its inputs joined: . Both act as NOT gates.
- So a NAND followed by a NAND with joined inputs is an AND gate, and a NOR followed by a NOR with joined inputs is an OR gate.
- Waveforms: a high level (such as 5 V) is 1 and 0 V is 0. Mark every instant where any input changes. In each interval read the inputs, find Y, then draw Y interval by interval.
Joined inputs
Worked example
Practise this conceptself-check · 4 quick reps
The same idea in a real exam question:
Example 3 · Semiconductor Electronics · Logic Gates
Joined inputs make a NOT gate
Cut the time axis at every change
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (2)
- Reducing a circuit with Boolean algebra
De Morgan's theorems
- Joined inputs and waveform inputs
Joined inputs
Reference tables (1)
The basic gates and their truth tables5 rows
| Gate | Output Y | Y for inputs 00, 01, 10, 11 | Y is 1 when |
|---|---|---|---|
| OR | 0, 1, 1, 1 | at least one input is 1 | |
| AND | 0, 0, 0, 1 | both inputs are 1 | |
| NOT | 1 for A = 0, 0 for A = 1 | the input is 0 | |
| NAND | 1, 1, 1, 0 | at least one input is 0 | |
| NOR | 1, 0, 0, 0 | both inputs are 0Q Re-NEET 2024: an OR gate whose output feeds a NOT gate acts as a NOR gate. |
Watch out for (7)
- NAND and NOR are easy to swap→ The basic gates and their truth tables
- One row fits several gates→ The basic gates and their truth tables
- Break a bar only with De Morgan→ Reducing a circuit with Boolean algebra
- Invert the right input→ Reducing a circuit with Boolean algebra
- Check one row in the original circuit→ Reducing a circuit with Boolean algebra
- Joined inputs make a NOT gate→ Joined inputs and waveform inputs
- Cut the time axis at every change→ Joined inputs and waveform inputs
Test yourself on a real paper
Sit a past NEET paper, timed and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.