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:

• Mathematical basic concepts such as recursion, induction, concrete and abstract complexity  
   
• internal and external data structures, algorithm principles such as search, search trees, internal and external sorting, dynamic programming, part-and-intake  
   
• Graphs and graph algorithms such as shortest road, consistency components, unfolding tree

Skills

• Determine abstract complexity for concrete features implement complexity and correctness analysis on simple algorithms, including recursive algorithms  
   
• Select and use appropriate algorithms for standard tasks, such as search, sorting and finding

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 27.5 hours per ECTS, which for this activity means 137.5 hours.

Exam

Exams