Course Objectives

Discrete mathematics is the study of properties of sets and systems that have a finite number of elements. The course will provide students with a fundamental understanding of some of the principal elements which will prove useful, amongst other things, in the study of information technology.

Course Description

Topics from code theory, combinatorics, graph theory, tree structures, languages and automata.

Learning Methods

3 hours of lectures and 1 hour of assignment work every week in the spring semester.

Assessment Methods

Obligatory assignments which must be approved before students will be permitted to sit the examination. Written examination, 4 hours.

Minor adjustments may occur during the academic year, subject to the decision of the Dean