Question:medium

The modulo \(2^N\) counter consist of the following number of states and flip-flops respectively

Show Hint

Number of states generated by a binary counter: \[ M=2^N \] where \(N\) is the number of flip-flops.
Updated On: Jun 25, 2026
  • \(2N-1\) and \(N-1\)
  • \(2^{2N}\) and \(N-1\)
  • \(2^{N-1}\) and \(N-1\)
  • \(2^N\) and \(N\)
Show Solution

The Correct Option is D

Solution and Explanation

Was this answer helpful?
0