Advanced AlgorithmsLaajuus (3 ECTS)

Objective

Student will be able to create an application which uses efficiently sorting, searching, hash and graph algorithms.

Content

Analysis of algorithms, sorting algorithms, hash tables, graph algorithms, performance measurement

Assessment criteria, satisfactory (1)

The student understands the operation principles of elementary sorting algorithms, elementary searching algorithms, hash table and directed and undirected graphs. Understands also the basic idea of greedy optimization algorithm.

Assessment criteria, good (3)

The student is able to answer to the question: “Can I use algorithm X to solve my problem? If so, how do I implement it?” Student knows that there are benefits and drawbacks using different algorithms, and he is able to select optimal implementations in particular cases.

Assessment criteria, excellent (5)

The student is able to analyze a variety of algorithms with regard to resource requirements. Understand how to use parallelism to solve computationally complicated problems.

Assessment criteria, approved/failed

The student understands the operation principles of elementary sorting algorithms, elementary searching algorithms, hash table and directed and undirected graphs. Understands also the basic idea of greedy optimization algorithm.

Further information

Prerequisite: Algorithms and Datastructures