A binary ripple counter is designed to count $(0)_{10}$ to $(64)_{10}$. Which of the following is/are the number of flip-flops required to design the counter?
Counting from 0 to 64 gives $65$ different states. $n$ flip-flops give $2^n$ states: $2^6=64<65$, so 6 flip-flops are not enough, but $2^7=128\ge65$. So 7 flip-flops are required.
More Sequential Circuits questions
GATE 2026 EC Q35– The negative edge triggered JK flip-flop in the Figure has J and K inputs tied to Logic…
GATE 2026 EC Q49– A shift-left Shift Register (SR) and a D flip-flop are connected to a synchronized clock…
GATE 2025 EC Q45– A positive-edge-triggered sequential circuit is shown below. There are no timing…
GATE 2025 EC Q62– In the circuit shown below, the AND gate has a propagation delay of 1 ns. The…
GATE 2024 EC Q41– The propagation delay of the 21 MUX shown in the circuit is 10 ns. Consider the…
GATE 2024 EC Q42– The sequence of states (Q 1Q 0) of the given synchronous sequential circuit is .