Data structures and algorithms (5 cr)

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?

Evaluation

Students can

a. use professional vocabulary systematically.
b. look for information in the key information sources of the field.
c. identify interrelated tasks.
e. use the key models, methods, software and techniques of the professional field.

Evaluation scale

1-5