retagged by
1,282 views
0 votes
0 votes
Assuming that only the X and Y logic inputs are available and their complements X' and Y' are not available, what is the minimum number of two-input NAND gates requires to implement X  ⊕ Y?

a) 2

b) 3

c) 4

d) 5
retagged by

1 Answer

Related questions

3 votes
3 votes
2 answers
1
sh!va asked Mar 2, 2017
6,972 views
Minimum number of 2-input NAND gates that will be required to implement the function: Y = AB + CD + EF is(a) 4(b) 5(c) 6(d) 7
0 votes
0 votes
0 answers
2
sh!va asked Mar 3, 2017
696 views
In the given network of AND and OR gates f can be written as: a) X0 X1 X2 .....Xn + X1 X2 . ....Xn + X2 X3 ....Xn.... Xnb) X0 X1 + X2 + X3 +....... +Xn-1 . XnC) X0+X1+ X2...
0 votes
0 votes
2 answers
3
sh!va asked Mar 3, 2017
3,404 views
The sum S of A and B in a half Adder can be implemented by using K NAND gates. The value of K isa) 3b) 4c) 5d) None of these
0 votes
0 votes
1 answer
4
sh!va asked Mar 3, 2017
1,162 views
The function shown in the figure when simplified will yield a result with _______ terms$2$$4$$7$$14$