Algorithms and Data Structures 1

• 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.

• 6 – 20 (Thurs 8-12)

02002/02003/02100/02101/02102/01017/01019, An introductory course in programming + an introductory course in discrete mathematics. Or similar competences.

Lectures and exercises. Teaching will be available in both English and Danish as far as possible.