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 acquire knowledge of the following theories and methods:

• mathematical fundamentals such as recursion, induction, concrete and abstract complexity
• internal and external data structures, algorithm principles such as searching, search trees, internal and external sorting, dynamic programming, divide-and-conquer
• graphs and graph algorithms such as shortest path, connected components, spanning trees

Skills

• determine abstract complexity for concrete functions
• conduct complexity and correctness analysis on simple algorithms, including recursive algorithms
• select and apply appropriate algorithms for standard tasks, such as searching, sorting, and pathfinding

Competences

The student must, when 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 type of instruction is organised in accordance with the general instruction methods of the programme, cf. § 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 +45 9940 8854