Redirected
edited by
1,219 views
0 votes
0 votes

A binary $3$-bit down counter uses $J$-$K$ flip-flops, $FF_{i}$ with inputs $J_{i}$, $K_{i}$ and outputs $Q_{i}$, $i$ = $0, 1, 2$ respectively. The minimized expression for the input from following is :

  1. $J_{0} = K_{0} = 0$
  2. $J_{0} = K_{0} = 1$
  3. $J_{1} = K_{1} = Q_{0}$
  4. $J_{1} = K_{1} = \overline{Q}_{0}$
  5. $J_{2} = K_{2} =Q_{1} Q_{0}$
  6. $J_{2} = K_{2} =\overline{Q}_{1} \overline{Q}_{0}$
  1. I, III, V
  2. I, IV, VI
  3. II, III, V
  4. II, IV, VI
edited by

2 Answers

Answer:

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Mar 24, 2020
1,170 views
ECL is the fastest of all logic families. High speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven...
0 votes
0 votes
4 answers
2
go_editor asked Mar 24, 2020
1,448 views
Convert the octal number $0.4051$ into its equivalent decimal number.$0.5100098$$0.2096$$0.52$$0.4192$
0 votes
0 votes
6 answers
3
go_editor asked Mar 24, 2020
1,530 views
The hexadecimal equivalent of the octal number $2357$ is :$2EE$$2FF$$4EF$$4FE$
1 votes
1 votes
5 answers
4
go_editor asked Mar 24, 2020
1,558 views
If $X$ is a binary number which is power of $2$, then the value of $X \& (X-1)$ is :$11\dots11$$00\dots00$$100\dots0$$000\dots1$