Content, progress and pedagogy of the module

Disclaimer.
This is an English translation of the module. In case of discrepancy between the translation and the Danish version, the Danish version of the module is valid.

Learning objectives

Knowledge

The student must gain knowledge of the following theories and methods:

• methods for analyzing the correctness of algorithms, concrete and abstract time and space complexity of algorithms, including recursive algorithms
• fundamentals of data structures such as binary search trees, algorithmic principles such as iterative algorithms, divide-and-conquer and dynamic programming, fundamental searching and sorting algorithms 
• graphs and graph algorithms such as shortest path, connectivity components, spanning trees

Skills

• determine abstract complexity for concrete functions perform complexity and correctness analysis on simple algorithms including recursive algorithms
• select and use suitable algorithms for standard tasks, such as search, sorting and wayfinding

Competences

The student must, faced with a non-standard programming task, be able to

• develop algorithms and data structures to solve the task
• analyze the developed algorithms

Type of instruction

The training shall be organised according to the general teaching forms referred to in § 17

Extent and expected workload

The student is expected to spend 30 hours per ECTS, which for this activity means 150 hours.

Exam

Exams

Additional information

Contact: Study Board for Computer Science via cs-sn@cs.aau.dk  or 9940 8854