CPSC 141: Discrete Computational Mathematics I (2006)

Click for a printable .pdf-file containing the same information as this page.

Objective:

to provide an introduction to the mathematical language, reasoning and methods; to introduce material used directly in later Computer Science courses; and, importantly, to explain how to reason mathematically.

Times:

Lectures are Monday and Friday from 16:30 to 18:00 in 8-164. There are no assigned labs or tutorials with this course. See my schedule for office hours.

Homework:

Around eight assignments, approximately weekly. See the CPSC 141 Course Policies for acceptable formats for submission and more information.

Although not always up-to-date, here is a list of homework.

Marking Scheme:

Homework		20%
Midterm I		20%
Midterm II		20%
Final		40%

Text Books:

• Mathematical Structures for Computer Science: A Modern Treatment of Discrete Mathematics by Judith L. Gersting is required.
• Discrete and Combinatorial Mathematics: an Applied Introduction by Ralph P. Grimaldi is the old text for this course.

Syllabus:

Click the syllabus for a detailed list of topics.

Cheating:

Don't. First offenses result in a grade of -100% on the assignment in question and formal notification of the College Dean. Allowing someone to copy your work is cheating. The UNBC Calendar describes academic offenses and possible penalties in more detail. See also the CPSC 141 Course Policies.