A divide by 490 counter requires how many flip flops ?

The correct answer is 'option 3'

Concept:

For a counter with ‘n’ flip flops:

• The total number of states = 2n (0 to 2n – 1)
• The largest number that can be stored in the counter = 2n – 1

To construct a counter with any MOD number, the minimum number flip flops required must satisfy:

Modulus ≤ 2n

Where n is the number of flip-flops and is the minimum value satisfying the above condition.

Solution:

2ⁿ>490

\(\implies n\ge 9\)