Course - Elementary Discrete Mathematics - MA0301
Elementary Discrete Mathematics
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 prerequesities except 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
The course aims at giving an introduction to combinatorics and set theory, logic, induction and recursion, relations and functions and graph theory, such that the students can recognize, understand and use these concepts in applications, e.g. within information technology.
Learning methods and activities
Lectures and compulsory exercises. Grade based on final written examination.
Compulsory assignments
- Exercises
Recommended previous knowledge
High school mathematics.
Course materials
Will be announced at the start of the course.
Credit reductions
| Course code | Reduction | From |
|---|---|---|
| MA0302 | 7.5 sp | |
| MA0302 | 3.7 sp | |
| MNFMA012 | 7.5 sp | |
| TMA4140 | 3.7 sp | |
| TMA4140 | 7.5 sp |
Subject areas
- Mathematics