7.1 De Morgan's Laws Bond Chapter 7.1 Part 2.

Slides:



Advertisements
Similar presentations
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
Advertisements

CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
1 Microprocessors vs. Custom Digital Circuits Why would anyone ever need to design new digital circuits? Microprocessors are readily available, inexpensive,
Boolean Algebra and Logic Gate
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.
1 CA 208 Logic Ex4 Commutativity (P  Q)  Associativity P  (Q  R)  (P  Q)  R Distributivity P  (Q  R)  Idempotency.
Chapter 9: Boolean Algebra
Digital Logic Review: Part II
1 Set Theory. 2 Set Properties Commutative Laws: Associative Laws: Distributive Laws:
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Digital Logic Design ESGD2201
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.
Boolean Algebra and Digital Circuits
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
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.
Why? What’s Boolean algebra used for? –“The purpose of Boolean algebra is to facilitate the analysis and design of digital circuits.” Express a truth table.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.
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.
4. Computer Maths and Logic 4.2 Boolean Logic Simplifying Boolean Expressions.
Boolean Algebra AND gate A B | AB 0 0 | | | | 1 OR gate A B | A + B 0 0 | | | | 1 NOT gate _ A | A or A’ 0 | 1 1 |
Discrete Mathematics CS 2610 September Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x 1,..x n )  B.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
Introduction to Set theory. Ways of Describing Sets.
Simplifying Boolean Expressions. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xyx XOR y FFF FTT TFT TTF xNOT x FT TF.
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
1 CSE370, Lecture 3 Lecture 3: Boolean Algebra u Logistics u Last lecture --- Numbers n Binary numbers n Base conversion n Number systems for negative.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
BOOLEAN ALGEBRA Kamrul Ahsan Teacher of
Commutative and Associative Properties. Properties are rules in mathematics. You can use math properties to simplify algebraic expressions!
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
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.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
Boolean Algebra and Logic Gates
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
Digital Logic Design Dr. Oliver Faust Chapter 4
Lecture 18: Boolean Algebra Boolean Functions. w = Chris is allowed to watch television x = Chris's homework is finished y = it is a school night z =
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.
Boolean Operations and Expressions Addition = = = = 1 Multiplication 0 * 0 = 0 0 * 1 = 0 1 * 0 = 0 1 * 1 = 1.
Hoda Roodaki Boolean Algebra Hoda Roodaki
Computer Architecture & Operations I
Computer Architecture & Operations I
Logic Gates and Boolean Algebra
De Morgan’s Theorem,.
Properties of Operations
Boolean Algebra & De Morgan's Theorems
Drill #3 Evaluate each expression if a = 6, b = ½, and c =
Algebra 1 Section 2.2 Add real numbers
Boolean Algebra.
Circuits & Boolean Expressions
Lecture 3: Boolean Algebra
CSE 311 Foundations of Computing I
Boolean Algebra.
Discrete Mathematics CS 2610
Propositional Equivalences
Boolean Algebra.
CSE 370 – Winter Combinational Logic - 1
Chapter 2 Introduction to Logic Circuits
De Morgan’s laws presentation
Lecture 3: Boolean Algebra
Boolean Algebra Rayat Shikshan Sanstha’s
Boolean Algebra Rayat Shikshan Sanstha’s
Lecture 3: Boolean Algebra
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Circuits & Boolean Expressions
Boolean Algebra.
Presentation transcript:

7.1 De Morgan's Laws Bond Chapter 7.1 Part 2

De Morgan’s Laws These enable Boolean conversions to form expressions using only NOR gates/functions or NAND ones.

How to Convert Boolean Expressions Three Steps: Change the operator (AND –> OR; OR –> AND) NOT each element NOT the whole expression

Rule 1 (De Morgan's 1st Law) A + B = A . B Or A + B = A . B = A . B

Rule 2 (De Morgan’s 2nd Law) A . B = A + B Or A . B = A + B = A + B

Boolean Identities Identity Name AND Form OR Form Identity 1 . A = A Null Law 0 . A = 0 1 + A = 1 Idempotence Law A . A = A A + A = A Inverse Law A . A = 0 A + A = 1 Commutative Law A . B = B . A A + B = B + A Associative Law (A . B).C = A.(B . C) (A+B) + C = A + (B + C) Absorption Law A.(A + B) = A . A + A . B = A.(1 + B) = A . 1 = A A + (A . B) = A.(1 + B) = A . 1 = A De Morgan’s Law A . B = A + B A + B = A . B Double Complement Law A = A

Example June 2009 Q4c Simplify: A + B + B . A = A . B + B . A