Discrete Mathematics

General concepts:
* Logic, proofs, sets, algorithms, induction and recursion, combinatorics, discrete probabilities
Graphs:
* Connectivity, shortest path,  (minimal) spanning trees
Modeling computation:
* Finite-state machines, Turing machines
Abstract algebra:
* Groups, rings, fields

Knowledge:

- The candidate possesses knowledge of important topics within abstract algebra.

- The candidate possesses knowlegde of important topics within combinatorics.

- The candidate possesses knowlegde of fundamental topics within graph theory.

Skills:

- The candidate knows relevant methods and terminology in discrete mathematics.

- The candidate is capable of applying his/her knowledge in different courses.

General competence:

- The candidate is capable of understanding and analyzing problems related to abstract algebra, combinatorics and graph theory.

Objectives:

 - After the course, the students should acquire:

- Understanding of the most important topics of abstract algebra

- Understanding of the most important topics of combinatorics, including fundamentals of graph theory.

Forelesninger|

Oppgaveløsning

Veiledning

Utfyllende informasjon:

The course is given as a self reading course, where there is time for the students during lectures to raise questions on the theory and/or the exercises.The course will be made accessible for both campus and remote students. Every student is free to choose the pedagogic arrangement form that is best fitted for her/his own requirement. The lectures in the course will be given on campus and are open for both categories of students. All the lectures will also be available on Internet through GUC¿s learning management system (ClassFronter).

Obligatoriske arbeidskrav:

None.