Section Name Description
Lectures File L1: Introduction
File L2: Algorithms
File L3: Data Structures
File L4: Algorithmic Complexity
File L5: Sorting
File L6: Heap
File L7: Hashing
File L8: Binary Search Tree
File L9: Balanced Trees (AVL)
File L10: Graphs
File L11: Graph Algorithms
File L12: Dynamic Programming
File L13: DP Problems
File L14: State Space Search
File L15: Heuristic State Space Search
File L16: Adversarial Search (Game Playing)
File L17: Metaheuristic Search (Discrete Optimization)
File L18: Constraint Satisfaction and Backtracking
File L19: Knowledge-Based Reasoning (Expert Systems)
File L20: Numeric(al) Optimization
File L21: Introduction to Machine Learning
File L22: Parametric Classification
File L23: Non-Parametric Classification
Klausur File Probeklausur
File Hauptklausur (13.2.): Results and Grades
File Nachholklausur (11.4.): Results and Grades
Exercises Folder Exercise 0 - Introduction to Python
File Exercise 01 - Stack & Queue - Solutions
Folder Exercise 02 - Complexity & Sorting - Solutions
File Exercise 03 - Heaps & Hashing - Solutions
File Exercise 04 - Binary & Balanced Trees - Solutions
Folder Exercise 05 - Graphs - Solution
File Exercise 06 - Dynamic Programming - Solutions
Folder Exercise 07 - State Space Search - Solution
File Exercise 08 - Adversarial Search - Solution
Folder Exercise 09 - Constrained Satisfaction - Solution
Folder Exercise 10 - Expert Systems & Numerical Optimization (Solution)