4.1SR latch: the basic memory cell
The idea
An SR latch is two cross-coupled gates that remember one bit. Set makes Q = 1, Reset makes Q = 0, and with both inputs idle it holds its value.
Think of it like this: A light switch with two buttons: one for ON, one for OFF, and it stays where you left it.
Why it exists
Every flip-flop is built on this idea, and the forbidden input is a favourite true/false item.
How it works
- NOR latch: S = 1 sets, R = 1 resets, S = R = 0 holds.
- S = R = 1 is forbidden (both outputs go to 0, and leaving it is a race).
- NAND latch is active low: S′ = 0 sets, R′ = 0 resets, 11 holds, 00 is forbidden.
- Characteristic equation Q⁺ = S + R′Q with SR = 0.
Worked example: NOR latch sequence
Start Q = 0. S = 1: Q becomes 1. S = 0, R = 0: stays 1. R = 1: Q becomes 0. S = R = 1: both outputs 0, which is illegal.
Now play with it
- →Press set, hold, reset, then both ones and read the notes column.
- →Switch to the NAND latch and find its forbidden pair.
| SR | Q | Q′ | what happened |
|---|---|---|---|
| - | 0 | 1 | start (Q = 0) |
NOR latch: S = R = 1 forces both outputs to 0, which breaks the Q′ = complement of Q rule. Dropping both inputs together leaves the final state to a race.
Check yourself
In a NAND-based SR latch with inputs S′ and R′, the forbidden input combination is
Exam notes (the dense version)
Two cross-coupled NOR gates form an SR latch: S = 1 sets Q = 1, R = 1 resets Q = 0, S = R = 0 holds, and S = R = 1 is forbidden (both outputs 0, and releasing both together causes a race). The NAND version has active-low inputs: S′ = 0 sets, R′ = 0 resets, 11 holds, 00 is forbidden. Adding an enable (clock) gives a gated latch. Characteristic equation: Q⁺ = S + R′Q with SR = 0. A latch is level sensitive; a flip-flop changes only on a clock edge.
Previous year questions: Latches & Flip-Flops (2)
PYQs are grouped by topic, so this is the full set for Latches & Flip-Flops; try the ones that match this subtopic. Open all 2 on the topic page.