Question:

A mod-10 counter requires

Show Hint

For a mod-\(N\) counter, \[ \boxed{ n=\left\lceil\log_2N\right\rceil } \] where \(n\) is the minimum number of flip-flops required.
Updated On: Jul 14, 2026
  • \(2\) flip-flops
  • \(3\) flip-flops
  • \(4\) flip-flops
  • \(10\) flip-flops
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Step 1: Use the flip-flop requirement formula. The minimum number of flip-flops required is \[ 2^n \geq N, \] where \(N\) is the modulus. Here, \[ N=10. \]

Step 2:
Determine the value of \(n\). Since \[ 2^3=8<10, \] and \[ 2^4=16\ge10, \] the required number of flip-flops is \[ \boxed{4.} \] Therefore, \[ \boxed{(C)} \] is the correct answer.
Was this answer helpful?
0
0