Course Objectives

The course will provide students with a fundamental understanding of some parts of discrete mathematics, which is the study of properties of sets and systems that have a finite number of elements.

Course Description

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

Learning Methods

3-4 hours of lectures per week in the spring semester. The course is not taught every year.

Assessment Methods

Mid-term assessment in the form of obligatory assignments which must be approved before students will be permitted to sit the individual written 4-hour final examination.

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