The course is connected to the following study programs

  • Computer Engineering, Bachelor's Programmme

Course contents

Finite algebraic structures, with applications to information processing and communications engineering. Logics with applications. Number theory and modular arithmetic with applications. Finite state machines and formal languages. Groups, coding theory and finite fields with applications.

Learning outcomes

On successful completion of the course, the students should be able to understand fundamental concepts, notation and results of algebra, mathematical logic, number theory and formal languages, and be able to apply them to information and communication technology.

Examination requirements

Students must pass the compulsory assignments in order to take the examination. Information about the compulsory assignments will be given in the LMS at the start of the course.

Teaching methods

Lectures, seminars, exercises and self-study.

The work load for the average student is approximately 270 hours.

Evaluation

The study programme manager, in consultation with the student representative, decides the method of evaluation and whether the courses will have a midterm- or end of term evaluation, see also the Quality System, section 4.1. Information about evaluation method for the course will be posted on Canvas.

Offered as Single Standing Module

Yes. Subject to availability or capacity.

Assessment methods and criteria

Written examination, 4 hours. Graded assessment.

Reduction of Credits

This course’s contents overlap with the following courses. A reduction of credits will occur if one of these courses is taken in addition:

Course Reduction of Credits
MA-429 – Discrete Mathematics 7.5
MA-418 – Discrete Mathematics 5
MA-180 – Discrete Mathematics 1 5
MA-224 – Discrete mathematics 2 5
Last updated from FS (Common Student System) July 1, 2024 1:36:09 AM