CISC 102 Lecture Notes - Lecture 2: Tranche, Complex Instruction Set Computing, Null Set

• School: Queen's University
• Department: Computing
• Course: CISC 102
• Professor: D. Rappaport

Document Summary

We convert the hand shake problem into an official math problem using proper notation. The basic building block will be the set. A set is a collection of distinct elements. B = {x | x is an integer, 0 x < 10} C = {x : x is an odd integer, 0 < x < 10} A c and c a then a = c. (think: if x y and y x, then x = y. ) If a = c then a c and c a. (the elements of a and c are the same. ) : is a proper subset of (think x < y. ) : is not a proper subset of. Suppose a = {1,2,3}, then 1 a. = the set of natural numbers: 1, 2, 3, . = the set of all integers: , -2, -1, 0, 1, 2, .