Dr. Clincy Professor of CS

Slides:



Advertisements
Similar presentations
ECE 331 – Digital System Design
Advertisements

CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Digital Design.
Chapter 10.1 and 10.2: Boolean Algebra Based on Slides from Discrete Mathematical Structures: Theory and Applications.
Logic Design CS221 1 st Term Boolean Algebra Cairo University Faculty of Computers and Information.
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.
Chapter 2: Boolean Algebra and Logic Gates. F 1 = XY’ + X’Z XYZX’Y’XY’X’ZF1F
©2004 Brooks/Cole FIGURES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
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.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
1.7 The Distributive Property. You can use the distributive property to simplify algebraic expressions We can use the distributive property to re-write.
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
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
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.
©2010 Cengage Learning SLIDES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.
Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.
Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3.
ECE 331 – Digital System Design
Table 2.1 Postulates and Theorems of Boolean Algebra
Chapter 3 Notes – Part II Review Questions
CS Chapter 3 (3A and ) Part 1 of 8
Simplifying Expressions
CHAPTER 3 BOOLEAN ALGEBRA (continued)
CHAPTER 2 Boolean Algebra
Dr. Clincy Professor of CS
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Boolean Algebra – Part 1 ECEn 224.
CS Chapter 3 (3A and ) Part 1 of 8
Boolean Algebra.
Cover a section of Ch 4 Review both Exam 2 and Exam 3
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Review for Dept Final Review Exam 4
Dr. Clincy Professor of CS
Review for Dept Final Review Exam 4
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
CSE 311 Foundations of Computing I
Boolean Algebra.
Discrete Mathematics CS 2610
Dr. Clincy Professor of CS
COE 202: Digital Logic Design Combinational Logic Part 1
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
Example Question: Consider the expressions: (a) F = XY + XY'
Dr. Clincy Professor of CS
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 ) – Part 2 of 5
CHAPTER 3 BOOLEAN ALGEBRA (continued)
Dr. Clincy Professor of CS
Table 2.1 Postulates and Theorems of Boolean Algebra
ECB2212-Digital Electronics Boolean algebra
CS Chapter 3 (3A and ) – Part 3 of 5
Dr. Clincy Professor of CS
Lab Instructors will overview the MSP430
Dr. Clincy Professor of CS
Dr. Clincy Professor of CS
Board work.
Digital Systems Section 3 Boolean Algebra. Digital Systems Section 3 Boolean Algebra.
Boolean Algebra.
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: Review Exam 1 Dr. Clincy Lecture Slide 1 1

Consensus Theorem F(x,y,z) = xy + x′z + yz

Consensus Theorem Working backwards and adding a term Dr. Clincy

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 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 – 2PM Grading Scaled Used: Average Score = 31 (Average Grade = 75) Score SD = 19 (large) Grading Scaled Used: 80-61 A-grade (1 student) 60-41 B-grade (13 students) 40-21 C-grade (11 students) 20-1 D-grade (11 students) 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 8