## CS203 Switching Theory and Logic Design Second Module Full Note

__Module 2-Syllabus__
Introduction — Postulates of Boolean algebra – Canonical

and Standard Forms — logic functions and gates

methods of minimization of logic functions — Karnaugh

map method and QuinMcClusky method

Product-of-Sums Simplification — Don’t-Care

Conditions.

__BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION__

__BOOLEAN OPERATIONS AND EXPRESSIONS__Boolean

- Boolean Addition
- Boolean Multiplication

__LAWS AND RULES OF BOOLEAN ALGEBRA____Laws of Boolean Algebra____Commutative Laws____►The commutative law of addition for two variables is written as A+B = B+A____►The commutative law of multiplication for two variables is A.B = B.A____Associative Laws :____►The associative law of addition is written as follows for three variables: A + (B + C) = (A + B) + C____►The associative law of multiplication is written as follows for three variables: A(BC) = (AB)C____Distributive Law:____►The distributive law is written for three variables as follows: A(B + C) = AB + AC__

__Rules of Boolean Algebra____
__

**DEMORGAN'S THEOREMS**

**BOOLEAN ANALYSIS OF LOGIC CIRCUITS**
EmoticonEmoticon