Discussion
The expression for number of modulo of a ripple counter with 'n' flip-flop is :
Answer: A
A ripple counter with \(n\) flip-flops has a maximum modulus of \(2^{n}\).
Each flip-flop stores one bit, so \(n\) flip-flops hold \(n\) bits and can represent \(2^{n}\) distinct states. A straight binary ripple counter steps through all of them, 0 to \(2^{n} - 1\), before returning to 0, so it divides the clock by \(2^{n}\). For example, a 4-bit ripple counter counts 0 to 15 and is a mod-16 counter.
\(2^{n} - 1\) is the largest count reached, not the number of states, which is the common slip. \(n\) is the number of states of a ring counter with \(n\) flip-flops, and \(n^{2}\) has no meaning here.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development