We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byTerrence Grewe
Modified over 2 years ago
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 00 01 10 11
Proving De Morgans Law InputsOutputs ABABA+B A.B 00 01 10 11
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
Assignments The submission has to be by the end of this week Write your full name and the group number on the answer sheet.
Basic Laws, theorems, and postulates of Boolean Algebra 1Rachaen M. Huq EEE301 – Digital Electronics Rachaen M. Huq Dept. of EEE, BRACU.
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.
RS Flip Flops Benchmark Companies Inc PO Box Aurora CO
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
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.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
Thinking Mathematically Logic 3.6 Negations of Conditional Statements and De Morgan’s Laws.
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.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
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.
Negative and Zero Exponents Students will be able to use properties of negative and zero exponents to evaluate and simplify expressions.
Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.
CS 151 Digital Systems Design Lecture 5 Boolean Algebra.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
DKT 122 / 3 DIGITAL SYSTEMS 1 CHAPTER 4 : BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
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.
CHAPTER - 4 WORKING PRINCIPLE OF DIGITAL LOGIC A logic gate is an elementary building block of a digital circuit. It is a circuit with one output and one.
DeMorgan Theorem, Computer Simulation Exercises
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Boolean Values The true story ;=P. Expressions.
GCSE Computing#BristolMet Session Objectives#5 MUST explain why data is represented in computer systems in binary SHOULD understand and produce simple.
1 CS/COE0447 Computer Organization & Assembly Language Logic Design Appendix C.
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.
1 Digital Logic
Boolean 1.1 Boolean Logic 1 ©Paul Godin Created September 2007 Last Edit September 2009 gmail.com.
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
CHAPTER 2 Boolean Algebra
ADDER, HALF ADDER & FULL ADDER
Digital Logic Review: Part II
1.11, 1.12, 1.13, 1.14, 1.18, 1.20, 1.23, 1.24, 1.25, 1.32, 1.33.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Logic: From Greeks to philosophers to circuits. COS 116: 3/11/2008 Sanjeev Arora.
Fractions + & – Mixed Numbers Can you simplify the following with ease? 1 5 / / 4 or 2 7 / / 3 If not then run through this slide show,
(CSC 102) Discrete Structures Lecture 5.
Zero and Negative Exponents. Raising a Number to the Zero Power Anything raised to the zero power is 1, except 0 to the zero power. 0 to the zero.
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.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
Data types and their representation Jordi Cortadella Department of Computer Science.
Week 1 - Wednesday. Course overview Propositional logic Truth tables AND, OR, NOT Logical equivalence.
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.
© 2017 SlidePlayer.com Inc. All rights reserved.