n flip-flops encode at most 2ⁿ states. Eight give only 256, insufficient for 258; nine give 512 and can implement a truncated 258-state cycle. Thus the minimum is nine, A.
More Sequential Circuits questions
GATE 2011 CS (CS1) Q60– The three D flip-flops form the shown counter. Immediately before a clock edge…
GATE 2011 CS (CS1) Q61– All three flip-flops in the shown counter start zero. How many distinct PQR states are…
GATE 2010 CS (CS1) Q42– Two positive-edge-triggered T flip-flops have T=1. The external clock drives flip-flop 0,…
GATE 2015 CS (CS2) Q17– Find the minimum number of JK flip-flops for a synchronous counter with output sequence…
GATE 2021 CS (CS2) Q38– A synchronous circuit replaces the first 1 of every maximal run of consecutive ones by 0,…
GATE 2026 CS (CS1) Q37– Consider a 2-bit saturating up/down counter that performs the saturating up count when the…