‹ Back to the paper
Question 5(c)
2 marks
Computer ScienceISC 2020 Specimen Computer Science Paper 1Short answerComputer Hardware
Answer the following in short.
Define Universal gates. Give one example and show how it works as an OR gate.
Answer
Answer
Universal gate: a gate from which any other gate (AND, OR, NOT, etc.) and hence any logic circuit can be built. NAND and NOR are the universal gates.
Example: NAND gate as an OR gate. Using De Morgan's law, $A + B = ((A + B)')' = (A' \cdot B')'$, which is the NAND of $A'$ and $B'$.
Connections: a NAND gate with both inputs joined to A gives $A'$ (NOT); another with both inputs joined to B gives $B'$; the outputs $A'$ and $B'$ feed a third NAND gate whose output is $(A' \cdot B')' = A + B$. So three NAND gates work as a two input OR gate.