Introduction to Discrete Mathematics

CS 240



Basic concepts of logic, sets, partial order and other relations, and functions. Basic concepts of mathematics (definitions, proofs, sets, functions, and relations) with a focus on discrete structures: integers, bits, strings, trees, and graphs. Propositional logic, Boolean algebra, and predicate logic. Mathematical induction and recursion. Invariants and algorithmic correctness. Recurrences and asymptotic growth analysis. Fundamentals of counting. Prerequisite:  Math 217, 221, or 275.

Crosslisted Departments: 


Subscribe to RSS - Introduction to Discrete Mathematics