Question:

mod-64 ripple counter can be designed using 
 

Show Hint

For any MOD-\(N\) counter, number of flip-flops required is \( n = \log_2 N \). If \(N\) is a power of 2, simply find the exponent.
Updated On: Feb 15, 2026
  • 4
  • 5
  • 6
  • 7
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Step 1: Understand MOD number in counters.
A MOD-N counter counts from 0 to (N−1).
The number of flip-flops required in a ripple counter is determined by the relation:
\[ N = 2^n \] where \( n \) is the number of flip-flops.
Step 2: Apply formula for MOD-64.
Given \( N = 64 \).
So we solve: \[ 64 = 2^n \] Since \( 2^6 = 64 \), we get: \[ n = 6 \] Step 3: Conclusion.
Therefore, a MOD-64 ripple counter requires 6 flip-flops.
Hence, the correct option is (3).
Was this answer helpful?
0
0