Back to Course List

EECS 203: Discrete Mathematics

Instructor: Varies from term to term

Coverage
Introduction to the mathematical foundations of computer science. Topics covered include: propositional and predicate logic, proof methods, set theory, functions, sequences and summations, introduction to algorithms, growth of functions and asymptotic notation, mathematical induction, counting, pigeonhole principle, permutations and combinations, relations and their properties, closure of relations, partial orderings, and introduction to graph theory.

Syllabus
• Logic and proofs
• Sets and functions
• Algorithms and complexity
• Mathematical induction
• Counting, permutations and combinations
• Relations and partial orderings
• Graphs and connectivity