MMG610 Discrete Mathematics, 7.5 hec


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.

Syllabus

 
 
The course is given
  • in the second half of spring
  • every other year
 

Course information 2018

 

Course information 2016

Course information 2014

 

Course information 2012

 
 

Course information 2010

 
 

Course information 2009

 

 
  • The course is cancelled this year.
 
 
 

Course information 2008

 
 
 
 

 
 

Published: Tue 18 Feb 2020.