Single-Course Dansk 5 ECTS

Algorithms and Data Structures

Overall Course Objectives

The course introduces fundamental concepts and techniques for the construction and analysis of efficient algorithms and data structures. To be able to apply, evaluate, and combine basic algorithms and data structures. To apply asymptotic analysis and notation. To model problems using algorithmic techniques.

See course description in Danish

Apply asymptotic analysis and notation.
Apply and analyze basic algorithms, such as sorting and searching.
Apply and analyze basic graph algorithms, such as DFS, BFS, and Dijkstra’s algorithms.
Apply and analyze basic data structures such as stacks, queues, heap, and binary search trees.
Identify the underlying algorithmic concept in a given problem.
Use graphs to model a given problem.
Modify known algorithms and data structures to efficiently solve a given problem.
Compare algorithms and data structures and use this to select an appropriate, efficient solution to a given problem.

Introduction to algorithms, data structures, asymptotic analysis and notation, graphs and other combinatorial structures, and modelling.

01904/62506/02312/02314/62507, An introductory course in programming + an introductory course in discrete mathematics. (e.g. 01904).

Lectures and exercises. The materials and the exam will be primarily in English.