MMG610 Discrete Mathematics, 7.5 hec
The course treats areas of mathematics with a combinatorial character, which are important for mathematical schooling in general and applications in computer science in particular. You will learn about combinatorial concepts such as permutations, combinations, partitions, Stirling numbers, and "balls in bins". The course also includes recursive formulas, generating functions, graph theory and elementary algorithms.
The course is given
- in the second half of spring
- every other year
Course information 2009
- The course is cancelled this year.