Discrete MathematicsLaajuus (3 ECTS)

Objective

After completing the course the student knows the basic concepts of logic, set theory, relations, graphs and algorithms, and their relationships to applications. He/she can construct and perceive structures in information technology with the aid of models offered by discrete mathematics.

Content

1) Logic and set theory
2) Relations and graphs
3) Algorithms

Qualifications

No pre-requisite studies.

Assessment criteria, satisfactory (1)

1) Logic and set theory
The student knows the concepts, notations, and principles of proposition and predicate logic, set theory, induction, and recursion. He/she can solve simple problems.
2) Relations and graphs
The student knows the concepts, notations, and principles of relations and graphs. He/she can solve simple problems.
3) Algorithms
The student knows the concepts, notations, and principles of algorithms and complexity. He/she can solve simple problems.

Assessment criteria, good (3)

1) Logic and set theory
The student has good knowledge of the concepts, notations, and principles of proposition and predicate logic, set theory, induction, and recursion. He/she can solve intermediate problems.
2) Relations and graphs
The student has good knowledge of the concepts, notations, and principles of relations and graphs. He/she can solve intermediate problems.
3) Algorithms
The student has good knowledge of the concepts, notations, and principles of algorithms and complexity. He/she can solve intermediate problems.

Assessment criteria, excellent (5)

1) Logic and set theory
The student has excellent knowledge of the concepts, notations, and principles of proposition and predicate logic, set theory, induction, and recursion. He/she can solve advanced problems.
2) Relations and graphs
The student has excellent knowledge of the concepts, notations, and principles of relations and graphs. He/she can solve advanced problems.
3) Algorithms
The student has excellent knowledge of the concepts, notations, and principles of algorithms and complexity. He/she can solve advanced problems.