This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CPSC 121 Lecture 29 March 23, 2009 Menu March 23, 2009 Topics: Set Theory (cont’d) Reading: Today: Epp 5.2 Next: Epp 5.3 Epp 7.1 Reminders: Assignment 4 due Friday, April 3 (by 17:00) Look for Online Quiz 11 Final exam Friday, April 17, 7:00pm, SRC A READ the WebCT Vista course announcements board Sets can be combined in many ways to produce new sets. Let’s review: Set Operations Let A and B be sets contained in a universal set, U The union of sets A and B is given by A ∪ B = { x ∈ U  x ∈ A ∨ x ∈ B } The intersection of sets A and B is given by A ∩ B = { x ∈ U  x ∈ A ∧ x ∈ B } The difference of sets A and B is given by A B = { x ∈ U  x ∈ A ∧ x / ∈ B } The symmetric difference of sets A and B is given by A ⊕ B = { x ∈ U  x ∈ A ⊕ x ∈ B } ASIDE: Epp uses A 4 B to denote symmetric difference (see page 292) Questions about Set Operations Let A = { 1 , 2 , 6 } , B = { 6 , 3 , 4 , 1 } and C = { , 3 , 5 } Question: What is A ∪ C ? Answer: { , 1 , 2 , 3 , 5 , 6 } Question: What is A ∩ B ? Answer: { 6 , 1 } Question: What is A ∩ C ? Answer: ∅ Two sets whose intersection is the empty set are called disjoint Questions about Set Operations (cont’d) Consider arbitrary finite sets...
View
Full
Document
This note was uploaded on 01/09/2010 for the course CPSC 121 taught by Professor Belleville during the Spring '08 term at The University of British Columbia.
 Spring '08
 BELLEVILLE

Click to edit the document details