Algorithms und Datenstruktures - Conditional Course
Summer Term 2020
Fabian Kuhn
Lecture Videos and Slides
| Topic | Recording | Slides | ||
| Introduction |
|
|
||
| Week 1 (11.5.-15.5.): | Sorting I |
|
|
|
| Week 2 (18.5.-22.5.): | Runtime analysis, Big-O Notation, Sorting II |
|
|
|
| Week 3 (25.5.-29.5.): | Abstract Data Types, Simple Data Structures, Binary Search |
|
|
|
| Week 4 (1.6.-5.6.): | Hashing I: Separate Chaining, Open Addressing |
|
|
|
| Week 5 (8.6.-12.6.): | Hashing II: Hash Functions, Universal Hashing, Rehash, Cuckoo Hashing |
|
|
|
| Week 6 (15.6.-19.6.): | Binary Search Trees I |
|
|
|
| Week 7 (22.6.-16.6.): | Binary Search Trees II |
|
|
|
| Week 8 (29.6.-3.7.): | Graph Algorithms I: BFS and DFS Traversal |
|
|
|
| Week 9 (6.7.-10.7.): | Graph Algorithms II: Minimum Spanning Trees |
|
|
|
| Week 10 (13.7.-17.7.): | Graph Algorithms III: Shortest Paths |
|
|
|
| Week 11 (20.7.-24.7.): | Dynamic Programming |
|
|
|
| Week 12 (27.7.-31.7.): | String Matching (Text Search) |
|
|
|