Presentation is loading. Please wait.

Presentation is loading. Please wait.

Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.

Published byJonah Stevens Modified over 9 years ago

Similar presentations

Presentation on theme: "Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose."— Presentation transcript:

1 Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose inverters or NOT gates are used. oA complement of a variable is represented by a bar over the letter. For example, the complement of a variable A will be denoted by www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS1

2 Law 1: = 1 Law 2: = 0 Law 3: If A = 0, Law 4: If A = 1, Law 5: www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS2

3 AND Laws Law 6: A.0=0 Law 7: A.1=A Law 8: A.A=A Law 9: www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS3

4 OR Laws Law 10: A +0 = A Law 11: A +1 = 1 Law 12: A +A = A Law 13: www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS4

5 Commutative Laws –This states that the order in which the variables are OR’ed and AND’ed will make no difference in the output. Law14: A. B = B. A Law 15 : A + B = B + A www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS5

6 Associative Laws  This law states that the order in which the variables are grouped will not make any difference in the output. Law 16: A + (B + C) = (A + B) + C www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS6

7 Law 17: A.(B.C) = (A.B).C www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS7

8 Distributive Laws These laws allow the factoring or multiplying out of expressions. Law 18: A.(B +C) = (A.B) + (A.C) Law 19: A + (B.C) = (A + B) (A + C) www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS8

9 De Morgan's Theorems 1. 2. The complement of any Boolean expression is found by using these two rules. www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS9

10 Steps for complementation: 1. Replace ‘+’ symbols with ‘.’ symbols and ‘.’ symbols with ‘+’ symbols. 2. Complement each term. www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS10

11 Proof of De Morgan's Theorems www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS11

12 www.bookspar.com | Website for Students | VTU NOTES | QUESTION PAPERS12

Download ppt "Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose."

Similar presentations

CS 151 Digital Systems Design Lecture 5 Boolean Algebra.

CS 151 Digital Systems Design Lecture 5 Boolean Algebra.
CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.

CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
Boolean Algebra and Logic Gate

Boolean Algebra and Logic Gate
Chapter 3 Boolean Algebra and Logic Gate (Part 2).

Chapter 3 Boolean Algebra and Logic Gate (Part 2).
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.

Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
ENGIN112 L5: Boolean Algebra September 12, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra.

ENGIN112 L5: Boolean Algebra September 12, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.

1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Section 1-5 Algebra: Variables and Expressions. Vocabulary Algebra: Is a language of symbols, including variables Variable: Is a symbol, usually a letter,

Section 1-5 Algebra: Variables and Expressions. Vocabulary Algebra: Is a language of symbols, including variables Variable: Is a symbol, usually a letter,
Algebraic Properties: The Rules of Algebra Be Cool - Follow The Rules!

Algebraic Properties: The Rules of Algebra Be Cool - Follow The Rules!
RULES OF BOOLEAN ALGEBRA. BASIC RULES OF BOOLEAN ALGERBA Sr. No.Theorem 1.0’=1  1’=0 2.A+0=A 3.A+1=1 4.A+A=A 5.A+A’=1 6.(A’)’=A 7.A+AB=A 8.A+A’B=A+B.

RULES OF BOOLEAN ALGEBRA. BASIC RULES OF BOOLEAN ALGERBA Sr. No.Theorem 1.0’=1  1’=0 2.A+0=A 3.A+1=1 4.A+A=A 5.A+A’=1 6.(A’)’=A 7.A+AB=A 8.A+A’B=A+B.
Chapter 5 Boolean Algebra and Reduction Techniques 1.

Chapter 5 Boolean Algebra and Reduction Techniques 1.
Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.

Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.
Digital Logic Design ESGD2201

Digital Logic Design ESGD2201
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.

Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.

Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
CHAPTER 2 Boolean Algebra

CHAPTER 2 Boolean Algebra
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.

Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.

LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.

Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.

Similar presentations

Ads by Google