Difficulty: Easy
Correct Answer: toggle
Explanation:
Introduction / Context:
The hallmark of the J–K flip-flop is its toggling behavior when J and K are both asserted. This property allows efficient construction of binary counters and frequency dividers. Knowing the exact outcome under J = K = 1 at the active clock edge is core knowledge in sequential logic.
Given Data / Assumptions:
Concept / Approach:
From the characteristic table, J = K = 1 produces Q_next = NOT(Q_current). This is toggling, meaning the output flips state every valid edge. The behavior is deterministic so long as timing constraints are respected and the inputs are not changing during the aperture window.
Step-by-Step Solution:
Verification / Alternative check:
Simulate a divide-by-2 counter stage using a J–K with J = K tied HIGH; the output frequency is half the input clock, confirming toggling at each edge.
Why Other Options Are Wrong:
Common Pitfalls:
Violating setup/hold times causing race-like symptoms; mistakenly assuming level-sensitive behavior; overlooking asynchronous inputs that could override the synchronous path.
Final Answer:
toggle
Discussion & Comments