Discrete Mathematics and Algorithms

Catalog description

This course offers a deep dive into the mathematical foundations critical for computing and cybersecurity. It is meticulously designed to equip students with a robust understanding of discrete structures and their applications in computing. The curriculum covers a broad spectrum of topics, from the basics of logic and set theory to the complexities of graph theory and computability, mathematical induction and recursion, number theory, modular arithmetic, counting, permutations, and combinations. Through a blend of theoretical and practical approaches, students will gain valuable insights into algorithmic thinking, mathematical reasoning, and their implications in computer science. Prerequisite(s): A MAT 112.