Boolean Algebra

We’ve Covered

 Analog vs Digital
 Gates
 Truth Table
 Logical Symbols
 Logical Expression
 Boolean Algebra is use to perform logical operations in digital Computers
using logical operators
 AND
 OR
 NOT
Tautology & Fallacy

 If Output of Boolean expression is always true or 1, It is called Tautology.

 Example A+A’ which produces always true
 If Output of Boolean expression is always false or 0, It is called Fallacy.
 Example A.A’ which produces always true
 Truth Table Practice:
 Evaluates : XY’ (Z+YZ’) + Z’
 Verify P + (PQ)’ is tautology
 Verify (X+Y)’ = X’Y’
Principal of Duality

 The duality principle can be obtained by interchanging AND and OR oeprators

and replacing 0 by 1 and 1 by 0.
 For Example compare idnetites
 X.Y+Z’ = (X’+Y’).Z
Basic Theorems

 Properties of 0

 Properties of 1
 Commutative Law

 Associate Law

 Distributive Law
 Indempotence (Identity) Law

 Absorption (Redundacne) Law

 Complementary Law

 Involution

 De Morgan’s Theorem