Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.

Slides:

Advertisements

Similar presentations

The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.

Advertisements

Propositional Equivalences

Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.

Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:

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

Combinational Logic Circuits Chapter 2 Mano and Kime.

Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.

1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.

Logic Design Fundamentals - 1 Lecture L1.1. Logic Design Fundamentals - 1 Basic Gates Basic Combinational Circuits Basic Sequential Circuits.

Basic Logical Operations (fascinating)

Universal Gates Sum of Products Products of Sum

Boolean Algebra and Logic Gate

Section 4.2: Functions that Test Conditions (continued)

Lab 6 – Part C2 Circuit for Problem 3.6 p 20. a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s.

Basic Logic Gates and De Morgan's Theorem Discussion D5.1 Appendix D.

Boolean Algebra Module M4.1 Section 5.1. Boolean Algebra and Logic Equations Switching Algebra Theorems Venn Diagrams.

Chapter 9: Boolean Algebra

Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.

10/25/2004EE 42 fall 2004 lecture 231 Lecture #23 Synthesis Next week: Converting gates into circuits.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

Hardware Logic Diagrams - The Basics - Marshall Thomas CIS 21JA – Fall Quarter 2012.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

COMPSCI 210 Semester Tutorial 2: Logic 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.

TABLES AND VALUES Section 1.5. Open Sentence Equation.

Digital Electronics Digital Electronics G.S.UTHAYAKUMAR ST.JOSEPH’S COLLEGE OF ENGINEERING,CHENNAI-119.

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

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.

Logic Design (CE1111 ) Lecture 2 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

The First lesson on Digital Logic Rachaen M. Huq1 Rachaen Huq. Dept. of EEE, BRACU.

Section 9.4 – Mathematical Induction Mathematical Induction: A method to prove that statements involving natural numbers are true for all natural numbers.

。 33 投资环境 3 开阔视野提升竞争力。 3 嘉峪关市概况。 3 。 3 嘉峪关是一座新兴的工业旅游城市，因关得名，因企设市，是长城文化与丝路文化交汇点，是全国唯一一座以长城关隘命名的城市。嘉峪关关城位于祁连山、黑山之间。 1965 年建市，下辖雄关区、镜铁区、长城区，全市总面积 2935.

Hoda Roodaki Boolean Algebra Hoda Roodaki

Dr. Ameria Eldosoky Discrete mathematics

NAND as a complete system and Karnaugh Maps

Proportional Lengths Unit 6: Section 7.6.

Thinking Mathematically

Truth Tables and Equivalent Statements

Chain Rules for Functions of Several Variables

Section 11-7 Ratios of Areas.

Discussion D5.1 Section Sections 13-3, 13-4

Basic Logical Operations (Fascinating)

Discrete Mathematics Lecture # 2.

Jeremy R. Johnson Wed. Sept. 29, 1999

Conditional Statements

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

CSE 311 Foundations of Computing I

Propositional Equivalences

CSE 370 – Winter Combinational Logic - 1

Section 5-1 Parallelograms.

Statements Containing Multiple Quantifiers

13 Digital Logic Circuits.

Lecture 5 Logistics Last lecture Today’s lecture

Discussion D5.1 Section Sections 13-3, 13-4

Discussion D5.1 Section Sections 13-3, 13-4

Basic Logic Gates.

Basic Logic Gates.

SECTION 2-4 : SOLVING EQUATIONS WITH THE VARIABLE ON BOTH SIDES

Truth tables Mrs. Palmer.

Section 2.3 Systems of Linear Equations:

Variables and Equations

Boolean Algebra By: Asst Lec. Besma Nazar Nadhem

Chapter 2 Sets Active Learning Lecture Slides

Boolean Algebra.

Presentation transcript:

Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1

What kind of gate is this? X Y Z = X Y !X !Y W Z X Y Z W !X !Y

What kind of gate is this if 0 = TRUE and 1 = FALSE? X Y Z = X Y !X !Y W Z X Y Z W !X !Y X Y Z 0 = TRUE = T

What kind of gate is this? X Y Z = X Y !X !Y W Z X Y Z W !X !Y

What kind of gate is this if 0 = TRUE and 1 = FALSE? X Y !X !Y W Z X Y Z 0 = TRUE = T X Y Z = X Y Z W !X !Y

Generalized De Morgan’s Theorem NOT all variables Change & to # and # to & NOT the result F = X & Y # X & Z # Y & Z F = !((!X # !Y) & (!X # !Z) & (!Y # !Z)) F = !(!(X & Y) & !(X & Z) & !(Y & Z))

NAND Gate

X Y X Z Y Z F F = X & Y # X & Z # Y & Z

F = !(!(X & Y) & !(X & Z) & !(Y & Z)) NAND Gate