CSC 226 Discrete Mathematics for Computer Scientists Section: 601
Propositional logic and the predicate calculus. Logic gates and circuits. Methods of proof. Elementary set theory. Mathematical induction. Recursive definitions and algorithms. Solving recurrences. The analysis of algorithms and asymptotic growth of functions. Elementary combinatorics. Introduction to graph theory. Ordered sets, including posets and equivalence relations. Introduction to formal languages and automata. Most seats reserved for CSC and CPE major and Computer Programming minors.
Engineering Online UGRD
Computer Certificate Program
Alan W Watkins