Elementary Discrete Mathematics

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.

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.

Lectures and compulsory exercises. The lectures may be given in English.