Study Guide

Objective

You know how to analyze time and space requirements for algorithms, and choose a suitable algorithm for a given problem.
You know the classic algorithms: Queue, stack, and list.
You know different sorting algorithms.
You can implement classic algorithms using a programming language.

Content

How to measure the performance of an algorithm?
How do search trees, lists and hash tables work?
What is dynamic programming and recursion?
How to solve graph and shortest path problems? What does optimization and search for optimal solution mean?

Opiskelumateriaali

To be settled at the course kick off.

Yksilölliset oppimisväylät

Scheduled track:
You participate in lectures and exercises according to the weekly schedule.

Independent track:
You can show your competence e.g. by a certificate. To be settled at the course kick off.

TKI ja työelämäyhteistyö

To be settled later on.

Tentit ja muut määräajat

To be settled later on.

Opiskelijan työmäärä

135 h

Evaluation scale

1-5

Assessment methods and criteria

To be settled at the course kick off.