MATH 2230

Discrete Mathematics II

Lec 001 and Tut T01 selected

This is the second of two discrete mathematics courses for computing science students. Topics in this course include cardinality of sets, recursion, recurrence relations, generating functions, inclusion-exclusion, equivalence relations, partial orders, partitions, graphs, trees, and complexity of algorithms.

Sections

Lecture

Lec 001

Wed, Fri 10:30-12:20

Wed, Fri10:30-12:20New Westminster - North Bldg. N421715620

Tutorial, pick one

Tut T01

Mon 11:30-12:20

Mon11:30-12:20New Westminster - North Bldg. N123116802

Tut T02

Wed 9:30-10:20

Wed9:30-10:20New Westminster - North Bldg. N123116803

Syllabus

Have the syllabus for MATH 2230? Share it and everyone gets the grading, textbooks and rules.