retagged by
810 views
1 votes
1 votes

The minimum number of Flip-Flops required to construct a binary Modulo $n$ counter is ________

  1. $n$
  2. $n-1$
  3. $2^n – 1$
  4. $\lceil \log_2 n \rceil$
retagged by

3 Answers

Best answer
2 votes
2 votes

n flip flops can be used to make modulo  2 counter.

So according to the question the answer must be  ceil(log2(n))

selected by
0 votes
0 votes
The "MOD" or "MODULUS" of a counter is the number of unique states. The MOD of the n flip flop ring counter is n.
0 votes
0 votes

binary modulo n means the possible no.of states = n and mark them as 0,1,2,3,....n-1.

therefore you need to indicate n states with k flipflops

if n=2p then k=p

if n $\neq$ 2p then k= ⌈log2n⌉

Answer:

Related questions

1 votes
1 votes
1 answer
2
Bikram asked Sep 20, 2016
498 views
The output of a gated S-R flip-flop changes only if the:flip-flop is setcontrol input data has changedflip-flop is resetinput data has no change
2 votes
2 votes
2 answers
3