autumn 2017
SMN6192 Game- and Graph Theory / Discrete Mathematics - 5 ECTS
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.
Error rendering component
- About the course
- Campus: Narvik |
- ECTS: 5
- Course code: SMN6192
- Responsible unit
- Institutt for datateknologi og beregningsorienterte ingeniørfag
- Tidligere år og semester for dette emnet