Level/category

General studies

Teaching language

Swedish

Type of course

Compulsory

Recommended year of study

2

Total number of ECTS

5 cr

Competency aims

The aim of the course is to provide the students with basic knowledge and skills in discrete mathematics needed in the IT field.

Learning outcomes

At the end of the course the student is expected to: - know elementary set theory - know recurrence relations - know relations and functions - know the definition and properties of (binary) trees and understand how trees can be used in a sorting algorithm - understand induction och recursion - be able to build and solve problems with a truth table - be able to use the laws of logic - be able to use the Euclidean algorithm - be able to solve simple problems with graph theory - be able to find the shortest path, minimal spanning tree and maximize the flow in a graph

Course contents

1. Fundamentals of Logic 2. Set Theory 3. Mathematical Induction 4. The Euclidean algorithm 5. Recurrence Relations 6. Relations and Functions 7. Introduction to Graph Theory 8. Trees 9. Optimization and Matching. Minimal Spanning trees. Transport Networks

Prerequisites and co-requisites

Elementary Mathematics

Previous course names

2005-2006 Mathematics 4

Additional information

Compulsory exercises

Recommended or required reading

Ralph P. Grimaldi, Discrete and Combinatorial Mathematics an Applied Introduction, 4ed.

Study activities

  • Lectures - 30 hours
  • Exercise based learning - 60 hours
  • Individual studies - 30 hours
  • - 13 hours

Workload

  • Total workload of the course: 133 hours
  • Of which autonomous studies: 43 hours
  • Of which scheduled studies: 90 hours

Mode of Delivery

Participation in tuition

Assessment methods

  • Exams
  • Demonstrations and presentations

Assessment requirements

To pass the course the student should pass the following examinations: Examination 1 .... Examination 2.... etc. (examinations include written examination tests, demonstrations and presentations, reports and produktions, essays, and also presence at specified occasions) The examinations contribute to the final grade as follows: ...

Teacher

Skön Kim

Examiner

Skön Kim

Home page of the course

https://people.arcada.fi/~kskon/intern/Diskret%20matematik/

Group size

No limit

Course completion date

Date for course completion will be announced later

Assignments valid until

12 months after course has ended

Assessment methods

  • Date of examination will be announced later - Exams
  • Date will be announced later - Demonstrations and presentations

Course and curricula search