![Computer Logical Organization Tutorial](/computer_logical_organization/images/computer-oragnization-mini-logo.jpg)
- Computer Organization Tutorial
- CO - Home
- CO - Overview
- CO - Digital Number System
- CO - Number System Conversion
- CO - Binary Codes
- CO - Codes Conversion
- CO - Complement Arithmetic
- CO - Binary Arithmetic
- CO - Octal Arithmetic
- CO - Hexadecimal Arithmetic
- CO - Boolean Algebra
- CO - Logic Gates
- CO - Combinational Circuits
- CO - Sequential Circuits
- CO - Digital Registers
- CO - Digital Counters
- CO - Memory Devices
- CO - CPU Architecture
- Computer Organization Resources
- CO - Quick Guide
- CO - Useful Resources
- CO - Discussion
De Morgan's Theorems
De Morgan has suggested two theorems which are extremely useful in Boolean Algebra. The two theorems are discussed below.
Theorem 1
![De Morgan Theorem 1](/computer_logical_organization/images/demorgan_theorem1.jpg)
The left hand side (LHS) of this theorem represents a NAND gate with inputs A and B, whereas the right hand side (RHS) of the theorem represents an OR gate with inverted inputs.
This OR gate is called as Bubbled OR.
![De Morgan Theorem 1 Diagram](/computer_logical_organization/images/demorgan_theorem1_diagram.jpg)
Table showing verification of the De Morgan's first theorem −
![De Morgan Theorem 1 Verification Table](/computer_logical_organization/images/demorgan_theorem1_table.jpg)
Theorem 2
![De Morgan Theorem 2](/computer_logical_organization/images/demorgan_theorem2.jpg)
The LHS of this theorem represents a NOR gate with inputs A and B, whereas the RHS represents an AND gate with inverted inputs.
This AND gate is called as Bubbled AND.
![De Morgan Theorem 2 Diagram](/computer_logical_organization/images/demorgan_theorem2_diagram.jpg)
Table showing verification of the De Morgan's second theorem −
![De Morgan Theorem 2 Verification Table](/computer_logical_organization/images/demorgan_theorem2_table.jpg)
boolean_algebra.htm
Advertisements