We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is ________.
The counter cycles through 6 different states, because the value 0 appears three times and each occurrence is followed by a different value, so the three 0 states are distinct. Six states need at least $\lceil \log_2 6 \rceil = 3$ flip-flops. The official key accepts 3 or 4.
More Sequential Circuits questions
GATE 2017 CS (CS1) Q43– Consider a combination of T and D flip-flops connected as shown below. The output of the D…
GATE 2014 CS (CS2) Q17– Let k=2n. An n-bit binary counter drives an n-to-2n decoder. This is equivalent to a .
GATE 2014 CS (CS3) Q55– The synchronous JK flip-flop circuit shown starts with Q₂Q₁Q₀ = 000. Find the state…
GATE 2017 CS (CS2) Q52– A synchronous two-bit saturating up-counter has transitions 00→01,01→10,10→11,11→11. With…
GATE 2011 CS Q25– How many flip-flops are minimally required for a modulo-258 counter?
GATE 2011 CS Q60– The three D flip-flops form the shown counter. Immediately before a clock edge…