De Morgan’s first theorem shows the equivalence of *(A) OR gate and Exclusive OR gate.(B) NOR gate and Bubbled AND gate.(C) NOR gate and NAND gate(D) NAND gate and NOT gate
Question
De Morgan’s first theorem shows the equivalence of *(A) OR gate and Exclusive OR gate.(B) NOR gate and Bubbled AND gate.(C) NOR gate and NAND gate(D) NAND gate and NOT gate
Solution
De Morgan's first theorem does not show the equivalence of any of the options you provided. De Morgan's theorem states that the negation of a conjunction is the disjunction of the negations; and the negation of a disjunction is the conjunction of the negations. In simpler terms, it shows the equivalence between a NAND gate (NOT-AND) and a combination of NOT and OR gates, and between a NOR gate (NOT-OR) and a combination of NOT and AND gates.
Similar Questions
EX-OR gate is equivalent to gate circuit ofa.NOR gate followed by a NOT gateb.NOT gate followed by a NOR gatec.OR gate followed by a NOT gated.EX-NOR gate followed by a NOT gate
The combination of which two gates can be used to implement any logic function? Choose the most appropriate answer.NOR and XOR gatesNAND and NOR gatesXOR and NAND gatesOR and AND gates
An exclusive NOR gate is logically equal to*Inverter followed by an XOR gateNOT gate followed by an exclusive XOR gateExclusive OR gate followed by an inverterThe complement of a NOR gate
State and prove following laws of Boolean algebra.(a) De-Morgan’s Law(b) Distributive Law
How many basic logic gates are there? Question 3Answera.2 b.3 c.4 d.5
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.