Propositional logic and the predicate calculus. 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. 3 credit hours
Instructor
Alan W Watkins, Engineering Online Teaching Associate Dept. of Computer Science
North Carolina State University
