De Morgans Law. Some expressions dont simplify easily For example ABC + A + C De Morgans laws can help with expressions of this kind. It comes in two.

Slides:

Advertisements

Similar presentations

Advertisements

Logic Gates A logic gate is an elementary building block of a digital circuit Most logic gates have two inputs and one output At any given moment, every.

Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Digital Logic.

CS 151 Digital Systems Design Lecture 5 Boolean Algebra.

GCSE Computing#BristolMet Session Objectives#5 MUST explain why data is represented in computer systems in binary SHOULD understand and produce simple.

topics Logic gates Gates types Universal gates

Lecture 11-1 FPGA We have finished combinational circuits, and learned registers. Now are ready to see the inside of an FPGA.

RS Flip Flops Benchmark Companies Inc PO Box Aurora CO

ADDER, HALF ADDER & FULL ADDER

Assignments The submission has to be by the end of this week Write your full name and the group number on the answer sheet.

Chapter 2 Logic Circuits.

Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed.

Registers and Counters. Register Register is built with gates, but has memory. The only type of flip-flop required in this class – the D flip-flop – Has.

Logic: From Greeks to philosophers to circuits. COS 116: 3/11/2008 Sanjeev Arora.

1 Digital Logic

Digital Logic Review: Part II

1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.

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

Negative and Zero Exponents Students will be able to use properties of negative and zero exponents to evaluate and simplify expressions.

Logic: From Greeks to philosophers to circuits. COS 116, Spring 2012 Adam Finkelstein.

DeMorgan Theorem, Computer Simulation Exercises

1.11, 1.12, 1.13, 1.14, 1.18, 1.20, 1.23, 1.24, 1.25, 1.32, 1.33.

Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.

Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

Thinking Mathematically Logic 3.6 Negations of Conditional Statements and De Morgan’s Laws.

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.

Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

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 Values The true story ;=P. Expressions.

Boolean 1.1 Boolean Logic 1 ©Paul Godin Created September 2007 Last Edit September 2009 gmail.com.

CS/COE0447 Computer Organization & Assembly Language

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 SIMPLIFICATION

Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.

DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.

WORKING PRINCIPLE OF DIGITAL LOGIC

Binary Logic Derrington KCL CPD/SKE Binary We’ve seen how data of all different sorts and kinds can be represented as binary bits… 0s and 1s 1 is.

Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 2 of 8 Dr. Clincy Professor of CS.

1 CS/COE0447 Computer Organization & Assembly Language Logic Design Appendix C.

1 Binary Signals Logic gate circuits are designed to input and output only two types of signals: “high” (1) and “low” (0), as represented by a variable.

Basic Laws, theorems, and postulates of Boolean Algebra

Computer Architecture & Operations I

Computer Architecture & Operations I

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

Simplifying Expressions

DIGITAL LOGIC CIRCUITS

Thinking Mathematically

TN 221: DIGITAL ELECTRONICS 1

Jeremy R. Johnson Wed. Sept. 29, 1999

DIGITAL LOGIC CIRCUITS

Reading: Hambley Chapters

Exercises Show that (P  Q)  (P)  (Q)

Basics Combinational Circuits Sequential Circuits Ahmad Jawdat

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

CS/COE0447 Computer Organization & Assembly Language

Digital Logic & Design Dr. Waseem Ikram Lecture No. 31.

Fundamentals of Computer Systems

13 Digital Logic Circuits.

Lecture No. 32 Sequential Logic.

De Morgan’s laws presentation

ECE 352 Digital System Fundamentals

CHAPTER 2 Set Theory.

Design of Digital Circuits Lab 1 Supplement: Drawing Basic Circuits

Presentation transcript:

De Morgans Law

Some expressions dont simplify easily For example ABC + A + C De Morgans laws can help with expressions of this kind. It comes in two flavours, both of which are useful. A.B = A+B A+B = A.B

Proving De Morgans Law Exercise Using Digital Works, make a circuit that shows De Morgans law

Proving De Morgans Law InputsOutputs ABABA.B A+B

Proving De Morgans Law InputsOutputs ABABA+B A.B

Using De Morgans Law 1.Change all AND expressions to OR, or vice versa 2.Complement the individual terms that were ANDed or ORed 3.Complement the whole expression

Example Apply to A+B Change or to ANDA.B Complement each termA.B Complement the whole thingA.B

Law of Double Negative I am not saying something not true A = A

Simplify these A.B A+B+C (A.B).(B.C).(C.D).(A.C)

Flip-Flops The circuit that implements memory

Simple J-K Flip Flop

Counter