Print Course syllabus
Course syllabus - Discrete Mathematics, a Second Course
Scope
7.5 credits
Course code
MMA500
Valid from
Autumn semester 2026
Education level
Second cycle
Progressive Specialisation
A1N (Second cycle, has only first-cycle course/s as entry requirements)
Main area(s)
Mathematics/Applied Mathematics
Organisation
Department of Business and Mathematics
Ratified
2013-02-01
Revised
2025-11-03
Literature lists
Course literature is preliminary up to 8 weeks before course start. Course literature can be valid over several semesters.
-
Books
Diskret matematik: fördjupning
There is also a compendium with an English translation (see below).
ISBN: 91-44-02878-4
Compendiums
More Discrete Mathematics
Relations and Functions
Reference Literature
Objectives
The aim of the course is to give deeper and broader knowledge in discrete mathematics and its applications within various scientific disciplines. Special emphasis is put on development of high proficiency in mathematical problem solving and proof techniques.
Learning outcomes
At the end of the course the student is expected to be able to
- explain, in a way adapted to the mathematical level of the reader/listener, the concepts presented in this course,
- describe a handful of areas of applications
- give a detailed account of one area of application
- construct algebraic proofs that rely on relations, functions and group axioms
- construct combinatorial proofs that rely on bijections and properties of discrete structures like permutations and partitions
- construct graph theoretic proofs within the areas of planarity and colorability
- construct analytic proofs using generating functions
- analyze combinatorial games to formulate optimal strategies
- formulate a plan to attack a research problem in discrete mathematics, and decide the correctness of a solution to a problem.
Course content
Relations and functions. Group algebra. Permutations. Partitions and generating functions. Graph theory: planarity and colorability. Combinatorial game theory. Research in discrete mathematics. Application of student's own choice, e.g. in cryptography, computer science, games, social networks or matching.
Specific requirements
At least 30 credits in mathematics/applied mathematics including Discrete Mathematics, 7.5 credits, Basic Vector Algebra, 7.5 credits, and Basic Calculus, 7.5 credits, or equivalent, and 7.5 credits within the main field of computer science.
In addition, Swedish course 3 or Swedish level 3 and English course 6 or English level 2 are required. For courses given entirely in English exemption is made from the requirement in Swedish course 3 or Swedish level 3.
Examination
Exercise (INL1), 4.5 credits, marks Pass (G)
Examination (TEN1), 3 credits, marks 3, 4 or 5
A student who has a certificate from MDU regarding disability study support, can request adaptions for the examination. It is the examiner who takes decisions on any adaptions, based on the certificate and other conditions.
Grade
Grading scale: 5, 4, 3