A universal logic gate can implement any Boolean function by conn
A universal logic gate can implement any Boolean function by connecting sufficient number of them appropriately. Three gates are shown:
Which one of the following statements is TRUE?
A. Gate 1 is a universal gate.
B. Gate 2 is a universal gate.
C. Gate 3 is a universal gate.
D. None of the gates shown is a universal gate.
Please scroll down to see the correct answer and solution guide.
Right Answer is: C
SOLUTION
Concept:
- A Universal Gate is a gate by which every other gate can be realized.
- AND, OR, NOT, etc. are basic gates.
- NAND, NOR, etc. are the universal gate.
Because NAND & NOR are the universal gates, if we can get a NAND or a NOR gate expression from any gate then we can say that the gate is universal.
Analysis:
Gate-1 is ‘OR’ gate & Gate-2 is ‘AND’ gate which are basic gates hence these are not universal gates.
Gate-3 is shown below:
\({F_3} = \bar x + y = \overline {\overline {\bar x + y} } \;\;\;\;\;\left( {\because \overline{\overline A} = A} \right)\)
\({F_3} = \overline {x.\bar y}\) …3)
