Register

UGC NET CSE | June 2009 | Part 2 | Question: 04

• retagged by
2,179 views

1 Answer

Best answer
3 votes
3 votes
J K Qn Qn+1
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0

Solve By K-Map gives

 Qn+1=J.Q’n+K’.Qn

Answer B

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
rishu_darkshadow asked Sep 22, 2017
2,783 views
UGC NET CSE | June 2009 | Part 2 | Question: 14
A reduced state table has $18$ rows. The minimum number of Flip-flops needed to implement the sequential machine is : $18$ $9$ $5$ $4$
A reduced state table has $18$ rows. The minimum number of Flip-flops needed to implement the sequential machine is :$18$$9$$5$$4$
User Avatar
1 votes
1 votes
3 answers
2
rishu_darkshadow asked Sep 22, 2017
3,849 views
UGC NET CSE | June 2009 | Part 2 | Question: 13
The octal equivalent of hexadecimal $\text{(A.B)}_{16}$ is : $47.21$ $12.74$ $12.71$ $17.21$
The octal equivalent of hexadecimal $\text{(A.B)}_{16}$ is :$47.21$$12.74$$12.71$ $17.21$
User Avatar
1 votes
1 votes
2 answers
3
rishu_darkshadow asked Sep 22, 2017
2,751 views
UGC NET CSE | June 2009 | Part 2 | Question: 05
In order to implement a $\text{n}$ variable switching function, a $\text{MUX}$ must have : $2^{n}$ inputs $2^{n}+1$ inputs $2^{n-1}$ inputs $2^{n}-1$ inputs
In order to implement a $\text{n}$ variable switching function, a $\text{MUX}$ must have :$2^{n}$ inputs$2^{n}+1$ inputs$2^{n-1}$ inputs$2^{n}-1$ inputs
User Avatar
1 votes
1 votes
2 answers
4
rishu_darkshadow asked Sep 22, 2017
2,923 views
UGC NET CSE | June 2009 | Part 2 | Question: 03
The Boolean expression $\bar{x}\bar{y}z+yz+xz$ is equivalent to : x y z $x+y+z$
The Boolean expression $\bar{x}\bar{y}z+yz+xz$ is equivalent to :xyz$x+y+z$
User Avatar
Link Copied!