This preview shows pages 1–2. 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 31 March 27, 2009 Menu March 27, 2009 Topics: Set Theory (concluded) Functions Reading: Today: Epp 7.1, 7.2 (definitions) Reminders: Assignment 4 due Friday, April 3 (by 17:00) No labs final part-week of classes (April 68) submit all remaining lab work during the week of March 30April 3 Tutorials continue through April 8 Quiz 2 marks available next week on WebCT quizzes available for pickup in tutorial next week Final exam Friday, April 17, 7:00pm, SRC A READ the WebCT Vista course announcements board Set Theory (contd) Finally, we look at some additional concepts... We know that sets are unordered collections of objects. Sometimes, the order of elements matters. We need a different structure to deal with the ordering of constituent elements in (composite) objects. N-Tuples An ordered collection of n elements, a 1 ,a 2 ,a 3 ,...,a n , is represented by an ordered n-tuple written as ( a 1 ,a 2 ,a 3 ,...,a n ) Two n-tuples are equal if and only if each corresponding pair of elements are equal Examples: ( a, 1 , ) = ( a, 1 ,A A ) (1 , 2 , 3) 6 = (3 , 2 , 1) ( a,b,a ) 6 = ( a,b,b ) An important class of n-tuples are the 2-tuples....
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