COMP 180 - Discrete Structures

When Offered: F, S, SS

3 Credit(s)
3 Lecture Hour(s)
0 Lab Hour(s)

Students will be introduced to formal systems, including propositional and predicate logic, that can be used to reason about computer algorithms. Students will develop an understanding of how to read and construct valid proofs of the properties of algorithms. Important discrete data structures, such as sets, relations, discrete functions, graphs and trees, will be introduced.

Prerequisite(s): MATH 110 or MATH 131.