Database-Management-System
December 7, 2023Database-Management-System
December 7, 2023Database-Management-System
|
Question 28
|
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?
|
XOR gates, NOT gates
|
|
|
2 to 1 multiplexors
|
|
|
AND gates, XOR gates
|
|
|
Three-input gates that output (A⋅B) + C for the inputs A⋅B and C
|
|
|
Both B and C
|
Question 28 Explanation:
(A) Not complete because, XOR can be used to make only NOT gate and NOT gate is already available. Hence not complete.
(B) 2 to 1 multiplexors is functionally complete.
(C) XOR gate can be used to make a NOT gate. So, (AND, NOT) is functionally complete.
(D) With given gates and inputs NOT gate cannot be derived.
Hence, not complete.
(B) 2 to 1 multiplexors is functionally complete.
(C) XOR gate can be used to make a NOT gate. So, (AND, NOT) is functionally complete.
(D) With given gates and inputs NOT gate cannot be derived.
Hence, not complete.
Correct Answer: E
Question 28 Explanation:
(A) Not complete because, XOR can be used to make only NOT gate and NOT gate is already available. Hence not complete.
(B) 2 to 1 multiplexors is functionally complete.
(C) XOR gate can be used to make a NOT gate. So, (AND, NOT) is functionally complete.
(D) With given gates and inputs NOT gate cannot be derived.
Hence, not complete.
(B) 2 to 1 multiplexors is functionally complete.
(C) XOR gate can be used to make a NOT gate. So, (AND, NOT) is functionally complete.
(D) With given gates and inputs NOT gate cannot be derived.
Hence, not complete.