Discrete mathematics treats areas of mathematics with a combinatorial character, which are important for mathematical schooling in general and applications in computer science in particular.
The course treats elementary number theory and group theory, especially permutations and finite fields, as well as binomial coefficients and other combinatorial computations. You will also learn about 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.