Digital Principles and Computer Organization: Chapter 2: Boolean Algebra, Logic Gates and Minimization Techniques

DeMorgan's Theorems

<< Previous

Next >>

Questions: 1. State and prove DeMorgon's theorem. 2. State the DeMorgan's law and write any one application

DeMorgan's Theorems

DeMorgan suggested two theorems that form an important part of Boolean algebra. In the equation form, they are:

1. : The complement of a product is equal to the sum of the complements. This is illustrated by truth Table 2.2.1.

2. : The complement of a sum is equal to the product of the complements. The truth Table 2.2.2 illustrates this law.

Application : DeMorgan's theorem is useful in the implementation of the basic gate operations with alternative gates, particularly with NAND and NOR gates which are readily available in IC form.

Review Questions

1. State and prove DeMorgon's theorem.

2. State the DeMorgan's law and write any one application.

Digital Principles and Computer Organization: Chapter 2: Boolean Algebra, Logic Gates and Minimization Techniques : Tag: Digital, Computer : - DeMorgan's Theorems

<< Previous

Next >>

Digital Principles and Computer Organization: Chapter 2: Boolean Algebra, Logic Gates and Minimization Techniques

Boolean Postulates and Laws

DeMorgan's Theorems

Principle of Duality

Logic Gates - types, logic symbol, expression, truth table

Universal Gates (NAND, NOR Gate)

Boolean Expressions

Implementations of Logic Functions using Gates

Karnaugh Map Minimization

Simplification of SOP Expression

Simplification of POS Expressions

Summary of Rules for K-Map Simplification

Limitations of Karnaugh Map

NAND-NAND Implementation

NOR-NOR Implementation

Integrated Circuits - Types, Classification, Advantages

Boolean Algebra, Logic Gates and Minimization Techniques: Two Marks Important Questions and Answers - Digital Principles and Computer Organization

Boolean Algebra, Logic Gates and Minimization Techniques: Important Questions - Digital Principles and Computer Organization