Discrete Structures

Catalog description

Boolean algebra and predicate calculus; proof methods; sets, functions, and relations; combinatorics; graph theory and algorithms; mathematical induction and recursion; probability and average case analysis of algorithms. Prerequisite(s): three years of high school mathematics. (lecture: 3 hours; recitation: 1 hour). Prerequisite(s): COMP 1300 may be taken as a prerequisite or corequisite.