Read our cookies policy and privacy statement for more information.
×Davis, California•
Discrete mathematics of particular utility to computer science. Proofs by induction. Propositional and first-order logic. Sets, functions, and relations. Big-O and related notations. Recursion and solutions of recurrence relations. Combinatorics. Probability on finite probability spaces. Graph theory.
Units: 4.0
Hours: Lecture—3 hour(s); Discussion—1 hour(s).