Computing Science 260

Computing Science 260 CMPT260
Discrete Structures 3 (3-1.5s-0-0-0)

An introduction to sets, functions and relations, proof techniques, logic, Boolean Algebra principles, minimization, graphs and trees, iteration and recursion, complexity analysis, and applications.

Note: Open to first-year students.

Further information: Course availability and times