...
UGC NET CS 2018-DEC Paper-2
September 19, 2024
Logic-Gates-and-operators
September 20, 2024
UGC NET CS 2018-DEC Paper-2
September 19, 2024
Logic-Gates-and-operators
September 20, 2024

Logic-Gates-and-operators

Question 2
Which of the following set of components is sufficient to implement any arbitrary Boolean function?
a) XOR gates, NOT gates
b) 2 to 1 multiplexers
c) AND gates, XOR gate
d) Three-input gates that output (A.B)+C for the inputs A, B and C.
A
a and d
B
b and c
C
c
D
All a, b, c and d
Question 2 Explanation: 
(A) XOR and NOT gates can only make XOR and XNOR which are not functionally complete.
(B) 2×1 multiplexer is functionally complete provided we have external 1 and 0 available.
(C) XOR can be used to make a NOT gate (a⊕1=a’) and (AND, NOT) is functionally complete. Again this required external 1.
(D) We cannot derive NOT gate here. So not functionally complete.
Hence, options (B) and (C) are true provided external 1 and 0 are available.
Correct Answer: B
Question 2 Explanation: 
(A) XOR and NOT gates can only make XOR and XNOR which are not functionally complete.
(B) 2×1 multiplexer is functionally complete provided we have external 1 and 0 available.
(C) XOR can be used to make a NOT gate (a⊕1=a’) and (AND, NOT) is functionally complete. Again this required external 1.
(D) We cannot derive NOT gate here. So not functionally complete.
Hence, options (B) and (C) are true provided external 1 and 0 are available.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!