INTRODUCTION TO MICROPEOCESSOR
MICROPROCESSOR BASICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
always equal to the number of flip-flops
|
|
|
can be equal to the number of flip-flops
|
|
|
can never be equal to the number of flip-flops
|
|
|
is always more than the number of flip flops
|
|
|
is always less than the number of flip flops
|
Detailed explanation-1: -The modulus of a counter is given as: 2n where n = number of flip-flops. So a 3 flip-flop counter will have a maximum count of 23 = 8 counting states and would be called a MOD-8 counter.
Detailed explanation-2: -The number of flip-flops required here are 3.
Detailed explanation-3: -The modulus of a counter is the number of states in its count sequence. The maximum possible modulus is determined by the number of flip-flops. For example, a four-bit counter can have a modulus of up to 16 (2^4). Counters are generally classified as either synchronous or asynchronous.
Detailed explanation-4: -For a mod 19 counter, 19<2^5. So again 5 flip flops are required. For a mod 32 counter, 32=2^5. So 5 flip flops are required.
Detailed explanation-5: -The 3-bit Synchronous binary up counter contains three T flip-flops & one 2-input AND gate. All these flip-flops are negative edge triggered and the outputs of flip-flops change affect synchronously. The T inputs of first, second and third flip-flops are 1, Q0 & Q1Q0 respectively.