Students should be taking the course MA407 Algorithms and Computation or have taken an equivalent course to provide a basic knowledge of algorithms, and should have experience with proofs and proof ...

Students may wish to have one of the recommended textbooks: N L Biggs, Discrete Mathematics (2nd edn) or P J Eccles, An Introduction to Mathematical Reasoning, but these are not required. Further ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...

In this course, we will study how to specify the behavior of a system formally and how to establish its correctness rigorously. With an introduction to discrete math, set theory, and temporal logic, ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science ... Part I: Proofs, and Mathematical Preliminaries Introduction ...

An introduction to discrete mathematics, including combinatorics and graph theory. The necessary background tools in set theory, logic, recursion, relations, and functions are also included. Masters ...

An introduction to descriptive statistics, graphing and data analysis, probability laws, discrete and continuous probability distributions, correlation and regression, inferential statistics. No ...

Students can pursue a Master's Degree in Mathematical Sciences with an emphasis in discrete mathematics, pure mathematics, statistics, or computational and applied mathematics. Applicants are not ...