recategorized by
1,759 views

1 Answer

1 votes
1 votes

For a mod N counter the number of flip flops required is less than or equal to 2 raised to power n where n is a positive integer.

N<= 2^n

Hence,

For a mod 10 counter, 10< 2^4. So 4 flip flops are required.

For a mod 16 counter, 16=2^4. So again 4 flip flops are required.

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.

Thus 5 flipflops are required.

Option B. 5

Answer:

Related questions

1 votes
1 votes
2 answers
1
admin asked Apr 2, 2020
712 views
If the input $\text{J}$ is connected through $\text{K}$ input of $\text{J-K}$, then flip-flop will behave as a D type flip-flopT type flip-flopS-R flip-flopToggle switch
1 votes
1 votes
1 answer
2
admin asked Apr 2, 2020
847 views
Which of the following conditions must be met to avoid race around problem?$\Delta t< t_{p}< T$$T>\Delta t t_{p}$$2t_{p}< \Delta t< T$none of these
0 votes
0 votes
2 answers
3
admin asked Apr 2, 2020
1,114 views
How many flip-flop are needed to divide the input frequency by $64$?$4$$5$$6$$8$
1 votes
1 votes
1 answer
4
admin asked Apr 2, 2020
1,728 views
Odd parity of word can be conveniently tested by OR gateAND gateNOR gateXOR gate