|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.|
|CPSC 141 - Discrete Computational Mathematics|
This course provides an introduction to set theory, elements of combinatorics and probability theory, logical and formal reasoning using predicate and propositional calculus, together with narrative proof techniques. Other topics include well ordered sets, recursive definitions and mathematical induction; introductory number theory including the division algorithm, Euclidean algorithm, prime numbers and the fundamental theorem of arithmetic; properties of functions and relations including bijections, projections, inverses, composition, and Cartesian products.
Schedule Types: Lecture, Final Exam