Catalog Entries

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. Credits: 3.000 Levels: Undergraduate Schedule Types: Lecture, Final Exam

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.
Credits: 3.000

Levels: Undergraduate
Schedule Types: Lecture, Final Exam

Return to Previous	New Search		XML Extract

Skip to top of page

UNBC Direct Access Web

Catalog Entries

© 2023 Ellucian Company L.P. and its affiliates.

Catalog Entries		2024 January Semester Sep 23, 2023