x !
Archived Curricula Guide 2017–2019
Curricula Guide is archieved. Please refer to current Curricula Guides
TIETS09 Algorithmic Problem Solving 5 ECTS
Organised by
Degree Programme in Computer Sciences
Person in charge
University Lecturers Heikki Hyyrö and Timo Poranen
Preceding studies
Corresponding course units in the curriculum
School of Information Sciences
Curricula 2015 – 2017

Learning outcomes

After completing the course a student is expected to

- be able to design and implement efficiently basic algorithms related to dynamic programming, graphs, numeric algorithms, optimization and geometric algorithms.
- have a deepened understanding of the fundamental role that algorithm design and analysis have in solving real problems.
- be familiar with the most common programming contests, online practise environments and literature on algorithmic programming.


Programming contests, algorithmic programming, dynamic programming, graph algorithms, numeric algoritms, optimization, geometric algorithms.

Teaching methods

2 hours lectures, 4-8 hours seminar work, participation in a programming contest.

Modes of study

Option 1
Available for:
  • Degree Programme Students
  • Other Students
  • Open University Students
  • Doctoral Students
  • Exchange Students
Project / practical work 
In English
Participation in course work 
In English

Seminar, exercises, participation in a programming contest.



Study materials

See the course web page.

Belongs to following study modules

Faculty of Natural Sciences
Faculty of Natural Sciences
Faculty of Natural Sciences
Archived Teaching Schedule. Please refer to current Teaching Shedule.
Faculty of Natural Sciences