Discrete Mathematics with Game- and Graph Theory

Theoretical. The course can be taken as a single course.

• Combinatorics including combinations
• Properties of integers
• Types of proofs
• Relations and functions, equivalence relations
• Finite state machines and minimization of these
• Recurrence relations with unarranged problems
• Graph theory
• Introduction to gaming

An undergraduate Bachelor Engineering program with minimum 25 credits mathematics, 5 credits statistics, 7,5 credits physics

Application code: 9371

Knowledge (K):

After completing the linear algebra course the candidate:

• Has advanced knowledge of concepts within discrete mathematics.
• 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.
• Can analyse formulated discrete problems and identify methods to solve these.

Skills (S):

After completing the linear algebra course the candidate:

• 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.
• Can analyse and deal critically with theories and arguments within the field and use these to structure and formulate scholarly arguments.
• Can identify arguments that can be utilized to solve practical problems like unarranged recurrence relations and game related tasks.

General competence (GC):

After completing the linear algebra course the candidate:

• Can analyse relevant discrete mathematics problems.
• Can apply the knowledge and skills within discrete mathematics to complete assignments.
• Can communicate about different aspects in discrete mathematics, particularly explaining in mathematical terms how to deal with counting problems.
• Can use the knowledge for concepts, theories and methods in discrete mathematics in relevant engineering areas.

Anbefalte forkunnskaper

IGR1518 Mathematics 1 (3-semester), IGR1600 Mathematics 1, IGR1601 Mathematics 2, IGR1613 Mathematics 3 / Physics 2, TEK-1507 Mathematics 1, TEK-1510 Mathematics 1 (3-semester), TEK-1516 Mathematics 2 for engineers, TEK-2800 Mathematics 3 for Engineers, TEK-2801 Physics 2

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 ects
• SMN6192 Game- and Graph Theory / Discrete Mathematics 5 ects

The course is taught intensively for two non-consecutive weeks. A combination of lectures followed by task solving sessions and flipped classroom arrangements will be used.

A video and task scheme is offered for students who cannot attend lectures. Support is provided during task solving sessions.

During the flipped classroom arrangement, students have access to shorter videos made by the teacher and work with tasks related to the videos, preferably working with their peers in groups. Support is provided by the teacher during these sessions, both to discuss content of the videos and to support task-solving processes.

The second teaching week contains a project work for two days. Submission of the project work is mandatory.

Language of instruction and examination

This course is open to incoming exchange students.

Study level: Master’s

Admission prerequisites:
This course has admission prerequisites, which are listed under the Admission requirements section. Please review this information carefully before adding the course to your Learning Agreement.

For details on how to apply for exchange, course selection guidelines, or to contact the Incoming Admissions Team, please visit: Admissions for Student Exchange.

More info about the coursework requirements

A project work in Graph Theory must be submitted individually and must be approved in order to sit for the exam.

This mandatory work requirement will not be re-attempted.

Re-sit examination