autumn 2017
SMN6192 Game- and Graph Theory / Discrete Mathematics - 5 ECTS

Application deadline

Applicants from Nordic countries: 1 June for the autumn semester and 1 December for the spring semester. Exchange students and Fulbright students: 1 October for the spring semester and 15 April for the autumn semester.

Type of course

The course may be taken as a single subject

Admission requirements

A relevant undergraduate bachelor Engineering programme with minimum 30 credits Mathematics/statistics topics

Application code: 9371


Obligatory prerequisites

IGR1600 Mathematics 1, IGR1601 Mathematics 2or IGR1518 Mathematics 1 - 3 terms, IGR1601 Mathematics 2

Course overlap

If you pass the examination in this course, you will get an reduction in credits (as stated below), if you previously have passed the following courses:

SMN6192 Discrete Mathematics 5 stp

Course content

Combinatorics, properties of integers and number theory, graph theory, applied algebra, relations and functions, equivalence relations, recurrence relations with unarranged problems, finite state machines and minimization of these.

Recommended prerequisites

IGR1613 Mathematics 3 / Physics 2

Objectives of the course

Knowledge: After completing the course the candidate: K1: Has advanced knowledge of concepts within discrete mathematics. This includes combinatorics, properties of integers and number theory, graph theory, applied algebra, relations and functions, equivalence relations, recurrence relations with unarranged problems, finite state machines and minimization of these. K2: Has thorough knowledge of central arguments, combinatorial counting methods and methodologies within the listed concepts in discrete mathematics and know how to apply these in mathematical problems. K3: Can analyse formulated discrete problems and identify methods to solve these.

Skills: After completing the course the candidate: S1: Can recognize and identify discrete problems, make use of a variety of counting methods, elementary number theory, finite state machines, recurrence relations and graphs and trees in order to solve problems. S2: Can analyse and deal critically with theories and arguments within the field and use these to structure and formulate scholarly arguments. S3: Can identify arguments that can be utilized to solve practical problems like unarranged recurrence relations and game related tasks.

General competence: After completing the course the candidate: GC1: Can analyse relevant discrete mathematics problems. GC2: Can apply the knowledge and skills within discrete mathematics to complete assignments. GC3: Can communicate about different aspects in discrete mathematics, particularly explaining in mathematical terms how to deal with counting problems. GC4: Can use the knowledge for concepts, theories and methods in discrete mathematics in relevant engineering areas.

Teaching and Learning Methods: The discrete mathematics course is structured with a concentrated timetable in which students work only with this subject for two non-consecutive week, having two other courses and a reading in between. The course is R&D-based, utilizing different teaching strategies to improve the learning discrete mathematics. This includes traditional lectures, video recording of lectures, a project work and task solving sessions and self-studies. Exercises are carefully selected to underpin the theory.

Workload: A larger project work in Graph Theory must be submitted and approved. Form of assessment: A final summative exam. Selected solutions from the exam will be graded externally.


Language of instruction and examination

English

Teaching methods

Lectures and task solution sessions. Video lectures.

Project work in Graph Theory to be approved

Final, summative exam.


Assessment

An assignment in Graph Theory is to be completed and approved before the final exam.

3 hour written exam accounts for 100% of the grade in the course. Grading will be done by A-F grading scale, F is Fail. A re-sit exam will be arranged for this course.


Recommended reading/syllabus

Grimaldi: Discrete and Combinatorial Mathematics. Addison-Wesley

Theory and examples on It's learning

Lecture notes

Additional literature

K.H. Rosen: Discrete and its applications.

E. Kreyszig: Advanced engineering mathematics.

Error rendering component

  • About the course
  • Campus: Narvik |
  • ECTS: 5
  • Course code: SMN6192
  • Tidligere år og semester for dette emnet