Difficulty: Easy
Correct Answer: Set state (Q = 1, Q̄ = 0)
Explanation:
Introduction / Context:An SR (Set–Reset) latch is the simplest bistable storage element in digital electronics. Understanding how input polarity (active-HIGH or active-LOW) affects the state transition is essential for correctly interfacing latches with combinational logic and for diagnosing behavior in larger sequential circuits.
Given Data / Assumptions:
Concept / Approach:With active-HIGH inputs, a logic HIGH on S commands the latch to store a 1 (set), while a logic HIGH on R commands the latch to store a 0 (reset). If both inputs are LOW, the latch holds its previous state. The combination S = 1 and R = 1 is generally considered invalid/forbidden for an SR latch because it attempts to force both outputs LOW (for NOR-based implementation) and can lead to metastability upon release.
Step-by-Step Solution:
Identify input polarity: active-HIGH means 1 asserts the function.Apply inputs: S = 1 (asserted set), R = 0 (not asserted).Follow behavior: an asserted set drives Q → 1 and Q̄ → 0 regardless of the prior stored bit.Conclude state: the latch moves into the set state and will remain there until a subsequent reset action or power cycle.Verification / Alternative check:Consider a cross-coupled NOR implementation: S = 1 forces the left NOR output LOW, which releases the opposite side to go HIGH, producing Q = 1. Tracing the feedback confirms a stable set condition as long as R remains 0.
Why Other Options Are Wrong:
Common Pitfalls:Confusing active-HIGH with active-LOW versions (for NAND-based latches, assertions are LOW), and assuming the hold condition applies whenever one input is 0 (it applies only when both are inactive).
Final Answer:Set state (Q = 1, Q̄ = 0)
Discussion & Comments