Question

How many flip flop are required to build a binary counter that count from 0 to 1023?

Answer 1

✌✌✌✌✌✌✌✌✌✌✌✌✌✌✌✌

Explanation:

✌✌✌✌✌✌✌✌✌✌✌✌✌✌✌✌

Answer 2

Explanation:

For a mod N counter, the number of flip-flops that are required is less than or equal to 2 to the power 'n', where n is a positive integer, i.e. N ≤ 2ⁿ.

Therefore, for a mod 32 counter, it can be calculated as:-

32 = 2⁵, where n = 5

So, 5 flip-flops are required to make a mod-32 binary counter.