Q.State and prove De Morgan's First and Second theorems.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →Concept understanding — De Morgan's Theorems
De Morgan's two theorems relate the complement operation to AND and OR. The FIRST theorem: the complement of a sum equals the product of the complements, -- so a NOR gate () is functionally identical to a bubbled AND gate. The SECOND theorem: the complement of a product equals the sum of the complements, -- so a NAND gate () is functionally identical to a bubbled OR gate. Both are proved by direct truth-table comparison (evaluating both sides for all four input combinations and checking the output columns match row for row). Their practical consequence is that NAND alone, or NOR alone, is 'universal' -- since either can reproduce a NOT gate (tie both inputs together) and, via the theorems, the other two basic gates as well, any digital logic function can be built from NAND gates only, or from NOR gates only. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.