##### synchronous counter

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 _____________.

how to approach this question ?

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 _____________.

how to approach this question ?

http://www.techtud.com/example/gate-2016-session-5-cs-q8

hope it helps, in case of any doubt ping me

sorry shivani1234 m not getting .pls explain how to differentiate ?

to design synchronous counter ,for any arbitrary sequence like 7,3,1,2,5,4,6,7,3,1,2,4,5,6 I simply using state table diagram and by minimization it is easy to design circuit.Also to identify minimum number of flip flop in synchronous counter I just calculating number of bits used in counter .

some pattern should be there for the formation of synchronous sequential counters

why we need 4 flip flop ?

For this type of question go with the following method:

Total number of bits required =number of bits to represent total states + no. of bits to represent maximum outgoing edgesTo identify 4 states we need bits

but if you see, from state 0 there are three outgoing states so the number of bits to represent 3 edges =

Total bits= 2+2=4