Dr. Clincy Professor of CS

Slides:



Advertisements
Similar presentations
EOC Practice #7 SPI EOC Practice #7 Operate (add, subtract, multiply, divide, simplify, powers) with radicals and radical expressions including.
Advertisements

Boolean Algebra Lecture 7: Supporting Material Dr Kathryn Merrick Tuesday 24 th March, 2009.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Chapter 9: Boolean Algebra
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Digital Design.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
1.2 – Evaluate and Simplify Algebraic Expressions A numerical expression consists of numbers, operations, and grouping symbols. An expression formed by.
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.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
Radicals and Conjugates
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
1.7 The Distributive Property. You can use the distributive property to simplify algebraic expressions We can use the distributive property to re-write.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
+ Properties of Real Numbers. + Properties Relationships that are always true fro real numbers are called properties. Properties are rules used to rewrite.
Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 2 of 8 Dr. Clincy Professor of CS.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.
Dr. Clincy Professor of CS
CS Chapter 3 (3A and ) Part 1 of 8
Chapters 4 & 5 Addressing Will go over Exam 1
CHAPTER 2 Boolean Algebra
Biconditional - 2 CS-708.
Dr. Clincy Professor of CS
2-4 The Distributive Property
CS Chapter 3 (3A and ) Part 1 of 8
Boolean Algebra.
Cover a section of Ch 4 Review both Exam 2 and Exam 3
Review for Dept Final Review Exam 4
Jeremy R. Johnson Wed. Sept. 29, 1999
Dr. Clincy Professor of CS
Finish Monday’s Lecture (Lecture 12) Roll out Project 2 Go over Exam 2
Review for Dept Final Review Exam 4
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
1-7: The Distributive Property
Combinatorial Logic Circuit
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
Discrete Math (2) Haiming Chen Associate Professor, PhD
CS Chapter 3 (3A and ) Part 3 of 8
Dr. Clincy Professor of CS
Today’s Agenda Go over exam #2 Go over exam #3 Lab 8 for 1 hour
Dr. Clincy Professor of CS
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
COMP541 Combinational Logic - II
CS Chapter 3 (3A and ) Review
CS Chapter 3 (3A and ) – Part 2 of 5
Dr. Clincy Professor of CS
Lecture 5 Logistics Last lecture Today’s lecture
ECB2212-Digital Electronics Boolean algebra
CS Chapter 3 (3A and ) Review
CS Chapter 3 (3A and ) – Part 3 of 5
Dr. Clincy Professor of CS
Lab Instructors will overview the MSP430
CS Chapter 3 (3A and ) Review
Dr. Clincy Professor of CS
Selection—Making Decisions
equivalent expression
Distributive Property
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
Presentation transcript:

Dr. Clincy Professor of CS CS 3501 - Chapter 3 (3A and 10.2.2) Dr. Clincy Professor of CS Today: Brief lecture Today: Cover Exam 1 Dr. Clincy Lecture Slide 1 1

Boolean Algebra Through our exercises in simplifying Boolean expressions, we see that there are numerous ways of stating the same Boolean expression. These “synonymous” forms are logically equivalent. Logically equivalent expressions have identical truth tables. In order to eliminate as much confusion as possible, designers express Boolean functions in standardized or canonical form. Dr. Clincy Lecture

Boolean Algebra There are two canonical forms for Boolean expressions: sum-of-products and product-of-sums. Recall the Boolean product is the AND operation and the Boolean sum is the OR operation. In the sum-of-products form, ANDed variables are ORed together. For example: In the product-of-sums form, ORed variables are ANDed together: Dr. Clincy Lecture

Boolean Algebra It is easy to convert a function to sum-of-products form using its truth table. We are interested in the values of the variables that make the function true (=1). Using the truth table, we list the values of the variables that result in a true function value. Each group of variables is then ORed together. The sum-of-products form for our function is: We note that this function is not in simplest terms. Our aim is only to rewrite our function in canonical sum-of-products form. Dr. Clincy Lecture

Boolean Algebra It is easy to convert a function to sum-of-products form using its truth table. We are interested in the values of the variables that make the function true (=1). Using the truth table, we list the values of the variables that result in a true function value. Each group of variables is then ORed together. The sum-of-products form for our function is: We note that this function is not in simplest terms. Our aim is only to rewrite our function in canonical sum-of-products form. Dr. Clincy Lecture

Boolean Algebra It is easy to convert a function to product-of-sums form. We are interested in the values of the variables that make the function true (=0). Using the truth table, we list the values of the variables that result in a false function value. Each group of variables is then ANDed together. The product-of-sum form for our function is: f(x,y,z)=(x+y+z)(x+y+z’)(x’+y+z’) Dr. Clincy Lecture

CS3503 Exam 1 Results – 5PM Grading Scaled Used: Average Score = 47 (Average Grade = 75) Score SD = 23 (extremely large) Grading Scaled Used: 100-84 A-grade (1 student) 83-60 B-grade (8 students) 59-36 C-grade (5 students) 35-12 D-grade (6 students) 11-0 F-grade (2 students) In getting your grade logged, be sure and pass back the exam after we go over them – Exam Policy – lose points for not passing back Dr. Clincy 7