CP 214

Finite and discrete algebraic structures relating to computers: sets, functions, relations. Machine-oriented logic. Topics include: propositional and predicate calculus, Boolean algebra, combinatorial counting (including Pigeonhole principle, permutations and combinations), relations (including equivalence relations, partial orders), induction and recursive programs, countable and uncountable sets, Cantor’s theorem, introduction to graph theory. Cross-listed with GENG132. <br>