# made easy

3 votes
106 views

For a Mod10
counter, Jhonson counter uses X FF′s, ring counter uses y FF′s, and
ripple counter uses Z FF′s. Then X + Y + Z will ________.

## 1 Answer

3 votes

Best answer

For MOD-M
1. In Johnson counter  M=2n
2. In ring counter M=n
3. In ripple conuter M=$2^n$

therefore, X = 5 ,  Y=10 and Z=4
ans = X+Y+Z = 19

selected
0

## Related questions

0 votes
0 answers
1
234 views
The number of Essential Prime implicants are ______________.
1 vote
1 answer
2
291 views
A Finite State Machine(FSM) is implemented using the D-FFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$. Assume that $X_{in}$ is held at constant logic level throughout the operation of FSM. Where the FSM is ... the four possible states if $X_{in}=0$ How do we check $X_{in}$ here? Can we check it arbitrarily, or checked with prev states??
0 votes
1 answer
3
299 views
$1)$ Master-Slave FF is designed to avoid race around condition $2)$ Master-Slave FF is used to store $2$ bit information Which of the following statement is correct? What is meaning of $2-bit$ information??
2 votes
2 answers
4
463 views
A $3\times 8$ decoder with $2$ enable inputs is used to address $8$ block of memory. What will be the size of each memory block when addressed from a $16$ bit bus with $2$ MSB’s used to enable the decoder?