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, ...

*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.

Set theory underpins modern mathematical logic by providing a unified language for defining fundamental mathematical objects and analysing their properties. At its core lies the Zermelo–Fraenkel ...

Discrete structures are omnipresent in mathematics, computer science, statistical physics, optimisation and models of natural phenomena. For instance, complex random graphs serve as a model for social ...