Week 1

• 23.10. Lecture 1: Introduction
• 26.10. Lecture 2: Algorithms 

Week 2

• 30.10. Lecture 3: Data Structures
• 02.11. Lecture 4: Algorithmic Complexity 

Week 3

• 6.11. Lecture 5: Sorting
• 9.11. Lecture 6: Priority Queue and HeapSort

Week 4 

• 13.11. Lecture 7: Hashing
• 16.11. Lecture 8: Binary Search Trees

Week 5

• 20.11. Lecture 9: Balanced Trees 
• 23.11. Lecture 10: Graphs 

Week 6: 

• 27.11. Lecture 11: Graph Algorithms
• 30.11. Lecture 12: Dynamic Programming

Week 7

• 04.12. Lecture 13: DP Examples
• 07.12. Lecture 14: (Uninformed) State Space Search Heuristic

Semester break

Week 8

• 08.01. Lecture 15: State Space Search (A* Algorithm)
• 11.01. Lecture 16: Adversarial State Space Search (Minimax)

Week 9

• 15.01. Lecture 17: Metaheuristic Search
• 18.01. Lecture 18: Constraint Satisfaction (Backtracking)

Week 10

• 22.01. Lecture 19: Expert Systems
• 25.01. Lecture 20: Numerical Optimization

Week 11

• 29.01. Lecture 21: Introduction to Machine Learning
• 25.01. Lecture 22: Parametric Classification

Week 12 

• 05.02. Lecture 23: Non-Parametric Classification
• 08.02. Lecture 24: Probeklausur