Discrete Structures – CNS 2300

Slides:



Advertisements
Similar presentations
1.5 Set Operations. Chapter 1, section 5 Set Operations union intersection (relative) complement {difference}
Advertisements

Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.
Union Definition: The union of sets A and B, denoted by A B, contains those elements that are in A or B or both: Example: { 1, 2, 3} {3, 4, 5} = { 1,
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
Instructor: Hayk Melikya
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Set Operators Goals Show how set identities are established Introduce some important identities.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
SET.   A set is a collection of elements.   Sets are usually denoted by capital letters A, B, Ω, etc.   Elements are usually denoted by lower case.
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Copyright © Zeph Grunschlag, Set Operations Zeph Grunschlag.
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
Sets 1.
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
modified from UCI ICS/Math 6D, Fall Sets+Functions-1 Sets “Set”=Unordered collection of Objects “Set Elements”
1 Set Operations CS/APMA 202, Spring 2005 Rosen, section 1.7 Aaron Bloomfield.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
1 Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets,
Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.
CompSci 102 Discrete Math for Computer Science
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sets Operations.
Discrete Structures – CNS 2300
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Introduction to Set theory. Ways of Describing Sets.
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
Properties of Sets Lecture 26 Section 5.2 Tue, Mar 6, 2007.
Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.
Discrete Mathematics CS 2610 January 27, part 2.
Discrete Mathematics Set.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 7 Relations.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Set Operations Section 2.2.
Discrete Mathematics Lecture # 10 Venn Diagram. Union  Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements.
Chapter 7 Sets and Probability Section 7.1 Sets What is a Set? A set is a well-defined collection of objects in which it is possible to determine whether.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 1 The Foundations: Logic, Sets,
Thinking Mathematically Venn Diagrams and Set Operations.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
CPCS 222 Discrete Structures I
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Set Operators Goals Show how set identities are established
Applied Discrete Mathematics Week 1: Logic and Sets
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Copyright © Zeph Grunschlag,
Discrete Mathematical The Set Theory
CSNB 143 Discrete Mathematical Structures
Chapter 11 (Part 1): Boolean Algebra
Set, Combinatorics, Probability & Number Theory
Sets Section 2.1.
CSE15 Discrete Mathematics 02/15/17
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Exercises Show that (P  Q)  (P)  (Q)
Set Operations Section 2.2.
Week #2 – 4/6 September 2002 Prof. Marie desJardins
L5 Set Operations.
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Presentation transcript:

Discrete Structures – CNS 2300 Text Discrete Mathematics and Its Applications (5th Edition) Kenneth H. Rosen Chapter 1 The Foundations: Logic, Sets, and Functions

Section 1.7 Set Operations

Unions of Sets Let A and B be sets. The union of the sets A and B, denoted by , is the set that contains those elements that are either in A or in B, or in both. union A B

Unions of Sets Let A and B be sets. The union of the sets A and B, denoted by , is the set that contains those elements that are either in A or in B, or in both. A = {2, 4, 6, 8, 10} B = {1, 2, 3, 4, 5} ={1, 2, 3, 4, 5, 6, 8, 10}

Intersection of Sets Let A and B be sets. The intersection of the sets A and B, denoted by , is the set containing those elements in both A and B. intersection A B

Intersection of Sets Let A and B be sets. The intersection of the sets A and B, denoted by , is the set containing those elements in both A and B. A = {2, 4, 6, 8, 10} B = {1, 2, 3, 4, 5} ={2, 4}

Disjoint Sets Two sets are called disjoint if their intersection is the empty set. intersection empty A B

Disjoint Sets Two sets are called disjoint if their intersection is the empty set. A = {4, 6, 8, 10} B = {1, 2, 3, 5} ={ }

Difference of Sets Let A and B be sets. The difference of A and B, denoted by A-B, is the set containing those elements that are in A but not in B The difference of A and B is also called the complement of B with respect to A. difference A B

Difference of Sets Let A and B be sets. The difference of A and B, denoted by A-B, is the set containing those elements that are in A but not in B The difference of A and B is also called the complement of B with respect to A. A = {2, 4, 6, 8, 10} B = {1, 2, 3, 4, 5} A-B ={6, 8, 10}

Complement of a Set Let U be the universal set. The complement of the set A, denoted by A, is the complement of A with respect to U. In other words, the complement of the set A is U - A. A U complement

Complement of a Set Let U be the universal set. The complement of the set A, denoted by A, is the complement of A with respect to U. In other words, the complement of the set A is U - A.

Set Identities x*1 = x Identity laws x+0 = x Domination laws x*0 = 0 Idempotent laws -(-x)= x Double negation law

Set Identities x+y = y+x Commutative laws x*y = y*x Associative laws Distributive laws DeMorgan’s laws

Set Identities

Proving Equivalences Use set builder notation and logical equivalences. Use membership tables.

Generalized Unions and Intersections The union of a collection of sets is the set that contains those elements that are members of at least one set in the collection. The intersection of a collection of sets is the set that contains those elements that are members of all the sets in the collection.

Computer Representation of Sets Bit vector representation Representations that contain the actual elements of the set.

Problems from the text Homework will not be collected. However, you should do enough problems to feel comfortable with the concepts. For these sections the following problems are suggested. Pages 94-96 1-21 odd 41, 43

finished