Table of contents

The course is connected to the following study programs

  • Computer Engineering, Bachelor's Programmme
  • Artificial Intelligence, 5-year master programme

Teaching language

English

Recommended previous knowledge

MA-180-G Discrete mathematics 1, or the equivalent.

Learning outcomes

On successful completion of the course, the student should:

  • have advanced knowledge of logics, computability, relations and grammar including their application.
  • have a basic understanding of number theory and group theory and their relationship.
  • be able to use recursion and induction.
  • be able to describe formal languages using automata and grammars.
  • be able to identify and create mathematical relations.
  • be able to create and solve recurrence relations.
  • understand number theory and group theory related to defining and using the RSA algorithm.
  • be able to use linear codes and analyse possibilities of error correction.

 

General knowledge:

  • be able to lead mathematical proofs.
  • be able to understand and use mathematical models.

Contents

General: induction, proof, recursion, correctness

Relations: equivalence, order, recurrence relation Formal models: finite state machines, regular expressions, Turing machines, grammars, number theory, (mathematical) groups, linear codes, RSA-algorithm.

Theorems: Lagranges theorem, Eulers theorem, Fermats (little) theorem

Teaching and learning methods

Lectures, self-study, exercises and compulsory assignments. An overview of compulsory assignments is given at the beginning of the semester.

Expected workload for the average students is approximately 200 hours.

Examination requirements

Compulsory assignments must be approved in order to take the examination. Information about compulsory assignments will be given in Canvas at the start of the semester.

Examinations

6 hours written examination. Graded assessment.

Student evaluation

The person responsible for the course decides, in cooperation with student representative, the form of student evaluation and whether the course is to have a midway or end of course evaluation in accordance with the quality system for education, chapter 4.1.

Offered as a free-standing course

Yes. Subject to availability or capacity.

Admission Requirement if given as a free-standing course

Higher Education Entrance Qualification including mathematics R1 and R2 and physics Fysikk 1, or a pass in the preliminary course examination for engineers (which is also offered at University of Agder).

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-221 – Discrete mathematics. 5
Last updated from FS (Felles studentsystem) Oct. 15, 2026 8:36:39 AM