Difficulty: Easy
Correct Answer: It has a RACE/forbidden condition when both inputs are asserted.
Explanation:
Introduction / Context:The basic S–R flip-flop (or latch) is the simplest bistable memory element formed by cross-coupling two gates. While educational and useful, it suffers from a well-known drawback: a forbidden input combination that produces an indeterminate state. Understanding this limitation is crucial before moving to improved devices such as the J-K or D flip-flops.
Given Data / Assumptions:
Concept / Approach:
With cross-coupled logic, asserting both inputs simultaneously forces both internal nodes toward the same logic level, violating the requirement that Q and Q̄ be complements. After releasing the inputs, the final state can be unpredictable due to imbalances and propagation delays. This is often described as a forbidden or race condition, and is the main disadvantage of the simple S–R latch.
Step-by-Step Explanation:
NOR S–R: S = 1 and R = 1 drive both outputs LOW at the gate outputs before inversion, leading to Q = 0 and Q̄ = 0 (invalid).NAND S–R: S = 0 and R = 0 force both outputs HIGH, yielding Q = 1 and Q̄ = 1 (invalid).When the forbidden combination is removed, slight differences in delays decide which side wins, producing an indeterminate final state.Verification / Alternative check:
Truth tables of S–R latches always include a row flagged as “forbidden” or “invalid.” Simulation tools reproduce the metastability risk if both inputs are asserted together.
Why Other Options Are Wrong:
Common Pitfalls:
Final Answer:
It has a RACE/forbidden condition when both inputs are asserted.
Discussion & Comments