Expected learning outcomes
- 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.
- The candidate knows relevant methods and terminology in discrete mathematics.
- The candidate is capable of applying his/her knowledge in different courses.
- The candidate is capable of understanding and analyzing problems related to abstract algebra, combinatorics and graph theory.
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.
* Logic, proofs, sets, algorithms, induction and recursion, combinatorics, discrete probabilities
* Connectivity, shortest path, (minimal) spanning trees
* Finite-state machines, Turing machines
* Groups, rings, fields
Teaching Methods (additional text)
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).
Form(s) of Assessment
Oral exam, individually
Form(s) of Assessment (additional text)
Candidates will get an oral exam (max 45 minutes) with written preparation (max 60 minutes). Candidates will be given a number of assignments within the topics of the course and 60 minutes to prepare written answers. After this the candidates will be questioned about their answer in the oral part.
If the number of students is too high, then the oral exam is replaced by a 3 hour written exam. The students will be notified about this one month prior to the exam at the latest.
Alphabetical Scale, A(best) – F (fail)
Evaluated by either internal and external examiner or 2 internal examiners.
The whole course must be repeated.
Ordinary calculator and dictionary
- Kenneth H. Rosen:
Discrete Mathematics and its Applications, 6th ed.
McGraw-Hill International Edition (2007).
- William J. Gilbert and W. Keith Nicholson
Modern Algebra with Applications, 2nd ed.
In case there will be less than 5 students that will apply for the course, it will be at the discretion of Studieprogramansvarlig whether the course will be offered or not an if yes, in which form.