CPSC 141
Discrete Computational Mathematics
Lec A1 selected
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.
Sections
Lecture
Lec A1
Mon, Wed, Fri 11:30-12:20
Syllabus
Have the syllabus for CPSC 141? Share it and everyone gets the grading, textbooks and rules.