Discrete mathematics is about precision in reasoning as much as it is about solving problems. Proof techniques like induction, contradiction, and direct reasoning are used to establish results in ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Understand the mathematical foundations of the structures and processes in today's society. The degree is designed both for mathematicians who wish to make themselves more marketable by adding ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.