Mr. Alan Watkins

Computer Science


CSC 226 Discrete Mathematics for Computer Scientists

3 Credit Hours

Propositional logic and 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.

Syllabus Lecture Videos Course Website