Discussion
The number of distinct states in a 3-bit binary counter is
Answer: C
Correct answer: 8
A counter with \( n \) bits passes through \( 2^{n} \) distinct states, so with three bits \[ 2^{3} = 8, \] running from 000 to 111 - decimal 0 to 7 - before returning to 000. That return is why such a device is called a modulus-8 counter, and why its highest output is the clock frequency divided by eight. Counters are therefore used as frequency dividers as often as they are used to count. The same relation works in reverse: a counter of modulus \( N \) needs the smallest \( n \) for which \( 2^{n} \ge N \). A decade counter of modulus 10 needs four flip-flops, and the six surplus states are removed by feedback that clears the counter when it reaches ten. It is the identical arithmetic that fixes the number of select lines on a multiplexer, the outputs of a decoder and the address lines of a memory - one relation worth being fluent in.
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