COMP 335 Lecture Notes - Lecture 1: Partial Function, Set Notation, Codomain

• School: Concordia University
• Department: Computer Sci.
• Course: COMP 335
• Professor: Lata Narayanan

Document Summary

Every tuesday there is a quiz before class via clicker. Best 9 out of 10 quizzes will be graded. Set: unordered collection of objects, elements are not repeated. 0 : empty set, set contains no elements. Set builder notation: {x | x=2i for some i. Si and sj are disjoint for all 1<=i, j b, an assignment of elements of b to elements of a. Pa(cid:396)titio(cid:374) of a set: we sa(cid:455) s(cid:1005), s(cid:1006), sk is a pa(cid:396)titio(cid:374) of a set s if: K(i=1) u = s (their union is s) Infinite sets: we say a is infinite if it is not finite. P(s) or 2s: power set of s, set of all subsets of s. example: s = {1,2,3}, 2s = {empty, {1}, {2},{3},{1,2},{1,3},{2,3},{1,2,3}