retagged by
2,029 views

1 Answer

0 votes
0 votes
$18$ can be represented by using $5$ bits in binary. So to uniquely identify every state of MOD-$18$ counter, we need $5$ flip flops.

Alternatively,  $log_{2}\left ( \left \lceil 18 \right \rceil \right )$  $=$  $5$ flip flops are required.

Option C is correct.

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 28, 2020
643 views
Simplified form of Boolean expression $\text{xy+(~x)z+yz}$ is :$\text{xy+(~x)z}$$\text{(~x)y+(~x)z}$$\text{(~x)y+xz}$$\text{xy+xz}$
2 votes
2 votes
1 answer
2
1 votes
1 votes
2 answers
3
go_editor asked Mar 28, 2020
1,231 views
The number of edges in a complete graph with $‘n’$ vertices is equal to :$n(n-1)$$\large\frac{n(n-1)}{2}$$n^2$$2n-1$
0 votes
0 votes
1 answer
4
go_editor asked Mar 28, 2020
527 views
A context free grammar is :type $0$type $1$type $2$type $3$