MA 6003 Elements of Discrete Mathematics

3 Credits

This course covers logic, sets and functions, algorithms, analysis of algorithms. Mathematical models, primitives of naïve set theory. Covered topics: Mathematical reasoning, methods of proof, mathematical induction, recursive definitions, recursive algorithms, Counting, the Pigeonhole principle, discrete probability, recurrence relations, generating functions, inclusion-exclusion. Introduction to graph theory, counting and algorithm analysis, relations, graphs, Boolean algebras, circuits. Turing Machines, algorithm complexity. Introduction to algebraic structures.

Prerequisite(s): Adviser’s approval.
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0