Course - Elementary Discrete Mathematics - MA0301
Elementary Discrete Mathematics
Assessments and mandatory activities may be changed until September 20th.
About
About the course
Course content
The course is primarily for computer science students, but should also be of interest to students who take courses in mathematics. There are no prerequisites beyond high school mathematics. The course gives an introduction to combinatorics, set theory, logic, induction and recursion, relations and functions, graph theory, formal languages and finite state automata.
Learning outcome
1. Knowledge: The student has a basic knowledge of mathematical logic, set theory and combinatorial counting methods. The student has knowledge of recursion and induction, as well as relations, graphs and trees. Moreover, the student has basic knowledge of formal languages, grammars and finite automata.
2. Skills: The student can make practical use of elementary logic and set theory, can write simple proofs using induction, can apply combinatorial counting methods to solve practical problems, and can make practical use of finite automata. The student is able to recognize, understand and use concepts such as relations, graphs and trees in applications, for example in information technology.
Learning methods and activities
Lectures and compulsory exercises. The lectures may be given in English.
Compulsory assignments
- Exercises
Further on evaluation
Grade based on final written examination.
The re-sit examination may be given as an oral examination.
Recommended previous knowledge
High school mathematics.
Course materials
Will be announced at the start of the course.
Credit reductions
| Course code | Reduction | From |
|---|---|---|
| MNFMA012 | 7.5 sp | |
| MA0302 | 3.7 sp | Autumn 2007 |
| TMA4140 | 3.7 sp | Autumn 2007 |
| TMA4412 | 5 sp | Autumn 2025 |
Subject areas
- Mathematics