Algoritmien jatkokurssiLaajuus (3 op)

Osaamistavoitteet

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

Sisältö

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

Arviointikriteerit, tyydyttävä (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.

Arviointikriteerit, hyvä (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.

Arviointikriteerit, kiitettävä (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.

Arviointikriteeri, hyväksytty/hylätty

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.

Lisätiedot

Prerequisite: Algorithms and Datastructures