Discrete Math (2) Haiming Chen Associate Professor, PhD

Slides:



Advertisements
Similar presentations
1.3 Predicates and Quantifiers
Advertisements

ECE 2110: Introduction to Digital Systems Combinational Logic Design Principles.
מבנה המחשב + מבוא למחשבים ספרתיים תרגול 1#
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
Lecture 3. Boolean Algebra, Logic Gates
Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.
22C:19 Discrete Math Introduction and Scope Propositions Fall 2011 Sukumar Ghosh.
Adapted from Discrete Math
Boolean Algebra أ. زينب آل كاظم 1. Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations.
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Intro to Discrete Structures
Boolean Algebra – I. Outline  Introduction  Digital circuits  Boolean Algebra  Two-Valued Boolean Algebra  Boolean Algebra Postulates  Precedence.
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2010 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
Course overview Course title: Discrete mathematics for Computer Science Instructors: Dr. Abdelouahid Derhab Credit.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Discrete Mathematics 이재원 School of Information Technology
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
CS 2210 (22C:019) Discrete Structures Introduction and Scope: Propositions Spring 2015 Sukumar Ghosh.
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Spring 2011 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
CSC-2259 Discrete Structures Konstantin Busch Louisiana State University K. Busch - LSU.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
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.
Chapter 1: The Foundations: Logic and Proofs
Discrete Structures – CNS 2300
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
Boolean Algebra M. AL- Towaileb1. Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations.
CSci 2011 Recap ^Propositional operation summary not andorconditionalBi-conditional pq ppqqpqpqpqpqpqpqpqpq TTFFTTTT TFFTFTFF FTTFFTTF FFTTFFTT.
ECE2030 Introduction to Computer Engineering Lecture 5: Boolean Algebra Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
Discrete Mathematics Lecture # 1. Course Objectives  Express statements with the precision of formal logic.  Analyze arguments to test their validity.
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
Department of Computer Engineering. 2 By Ahmad Bilal Digital Logic & Design.
Boolean Algebra.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Computer Science 210 Computer Organization
COMP 283 Discrete Structures
22C:19 Discrete Structures Introduction and Scope: Propositions
ECE 2110: Introduction to Digital Systems
CS 2210:0001 Discrete Structures Introduction and Scope: Propositions
Chapter 1 – Logic and Proof
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
CHAPTER 2 Boolean Algebra
Predicates & Quantifiers
… and now for the Final Topic:
Discrete Math (2) Haiming Chen Associate Professor, PhD
CSCI 3310 Mathematical Foundation of Computer Science
CMSC Discrete Structures
Applications of Propositional Logic
Boolean Algebra L Al-zaid Math1101.
Computer Science 210 Computer Organization
Mathematics for Computer Science MIT 6.042J/18.062J
Yes, No, Maybe... BooleanAlgebra 12/10/2018.
Boolean Algebra Introduction CSCI 240
A Brief Summary for Exam 1
COMS 361 Computer Organization
Discrete Math (2) Haiming Chen Associate Professor, PhD
Discrete Structures Prepositional Logic 2
CMSC Discrete Structures
Presentation transcript:

Discrete Math (2) Haiming Chen Associate Professor, PhD Department of Computer Science, Ningbo University http://www.chenhaiming.cn

Data Structure & Algorithm Content Part I Logic and Proofs Boolean Algebra Part II Sets, Functions, Sequences, and Matrices Relations Trees Graphs Algorithms Induction and Recursion Modeling Computation Part III Number Theory Discrete Probability Counting Advanced Counting Techniques Data Structure & Algorithm

Review Logic and Proofs Sets, Functions, Sequences, Sums, and Matrices Propositional Logic Predicates and Quantifiers Proofs and Proof Methods Sets, Functions, Sequences, Sums, and Matrices Number Theory and Cryptography Translating from English into Logical Expressions

Logic Expression You can access the Internet from campus only if you are a computer science major or you are not a freshman Express the statements “Some student in this class has visited Mexico” and “Every student in this class has visited either Canada or Mexico” using predicates and quantifiers.

Logic Equivalences

Logic and Bit OperationsP11 A bit can be used to represent a truth value, because there are two truth values, namely, true and false. 1 represents T (true), 0 represents F (false). A variable is called a Boolean variable if its value is either true or false.

Boolean Algebra Boolean Operators Precedence for boolean operators Chapter 12 Boolean Operators Complement Boolean sum Boolean product Precedence for boolean operators Complement > Boolean product > sum

Example

Boolean Function Represented using expressions made up from variables and Boolean operations. Every Boolean function can be represented by a Boolean expression

Boolean Function Complement of the Boolean function F Boolean sum F + G Boolean product FG

Identities of Boolean Algebra

Duality The dual of a Boolean expression is obtained by interchanging Boolean sums and Boolean products and interchanging 0s and 1s.

Duality principle An identity between functions represented by Boolean expressions remains valid when the duals of both sides of the identity are taken

Example

Homework Page 818, Exercise 5, 25, 28