The number of flip-flops required in a modulo N counter is
-
log 2(N) +1
-
[log2(N)2]
-
[log2(N)]
-
log2(N - 1)
C
Correct answer
Explanation
A modulo N counter cycles through N distinct states (0 to N-1). To represent N states, we need ⌈log₂N⌉ flip-flops. For example, a mod-8 counter needs 3 flip-flops (2³=8), a mod-5 counter needs 3 flip-flops (2²=4 < 5 ≤ 8=2³). The ceiling function ensures we have enough capacity.