Algorithms and Datastructures - Conditional Course
Summer Term 2024
Fabian Kuhn
Lecture Videos and Slides
| Topic | Recording | Slides | ||
| Week 0 (17.04.-24.04) | Introduction |
|
||
| Week 1 (24.04.-01.5.): | Sorting I |
|
|
|
| Week 2 (01.05.-08.05.): | Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (08.05.-15.05.): | Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (15.05.-22.05.): | Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (22.05.-29.05.): | Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (29.05.-05.06.): | Binary Search Trees I |
|
|
|
| Week 7 (05.06.-12.06.): | Binary Search Trees II |
|
|
|
| Week 8 (12.06.-19.06.): | Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (19.06.-26.06.): | Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (26.06.-03.07.): | Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (03.07.-10.07.): | Dynamic Programming |
|
|
|
| Week 12 (10.07.-17.07.): | String Matching (Text Search) |
|
|
|