CS 210 – Algorithms and Data Structures (Summer 2026): videos
All lecture videos · module page · YouTube playlist
92 videos, 28 h 36 min
| Video | Date | Title | Length | Transcript |
|---|---|---|---|---|
| 0 | 2026-04-13 | Welcome, Administrative part, overview, assessment, AI use, Campuswire, Slido, exam question gallery | 1:22:04 | transcript & video |
| 1-1 | 2026-04-20 | Ketzerische Fragen | 11:33 | transcript & video |
| 1-2 | 2026-04-20 | Skalierbarkeit | 7:40 | transcript & video |
| 1-3 | 2026-04-20 | Abstraktion | 13:08 | transcript & video |
| 1-4 | 2026-04-20 | Die Sprache der Experten | 5:29 | transcript & video |
| 2-1 | 2026-04-20 | Standardbibliotheken | 11:49 | transcript & video |
| 2-2 | 2026-04-22 | algs4 Library, StdIn, StdOut | 23:41 | transcript & video |
| 2-3 | 2026-04-22 | Malen nach Zahlen, StdDraw | 20:31 | transcript & video |
| 2-4 | 2026-04-22 | Mehr zu entdecken, StdAudio | 6:04 | transcript & video |
| 3-0 | 2026-04-27 | Motivation | 5:20 | transcript & video |
| 3-1 | 2026-04-27 | 3SUM | 33:46 | transcript & video |
| 3-2 | 2026-04-27 | Folgen und Grenzwerte | 20:50 | transcript & video |
| 3-3 | 2026-04-27 | Asymptotische Notation | 13:53 | transcript & video |
| 3-4 | 2026-04-29 | Asymtotiken aus Plots? | 3:19 | transcript & video |
| 3-5 | 2026-04-29 | Rechenregeln für Asymptotiken | 33:55 | transcript & video |
| 3-6 | 2026-04-29 | Rekursionsgleichungen | 18:55 | transcript & video |
| 3-7 | 2026-04-29 | Das Master-Theorem | 11:21 | transcript & video |
| 3-8 | 2026-05-04 | Die Rekursionsbaum-Methode | 33:54 | transcript & video |
| 3-8 | 2026-05-04 | Stochastik-Grundlagen | 25:31 | transcript & video |
| 4-1 | 2026-05-04 | Dynamic Connectivity | 10:32 | transcript & video |
| 4-2 | 2026-05-06 | Dynamische Äquivalenzklassen | 10:31 | transcript & video |
| 4-3 | 2026-05-06 | Quick Find | 16:51 | transcript & video |
| 4-4 | 2026-05-06 | Quick Union | 14:26 | transcript & video |
| 4-5 | 2026-05-06 | Weighted QuickUnion und Pfadkomprimierung | 24:44 | transcript & video |
| 4-6 | 2026-05-06 | Union-Find-Anwendung in Perkolationstheorie | 11:21 | transcript & video |
| 5-1 | 2026-05-11 | Grundbegriffe der Algorithmik | 21:56 | transcript & video |
| 5-2 | 2026-05-11 | Datenmodelle | 7:47 | transcript & video |
| 5-3 | 2026-05-11 | Asymptotische Vergleiche | 7:28 | transcript & video |
| 5-4 | 2026-05-11 | Maschinenmodelle und word-RAM | 18:05 | transcript & video |
| 5-5 | 2026-05-11 | Kostenmodelle | 4:36 | transcript & video |
| 6-1 | 2026-05-13 | Algorithm Science | 13:40 | transcript & video |
| 6-2 | 2026-05-13 | Laufzeitexperimente | 29:02 | transcript & video |
| 6-3 | 2026-05-13 | Mathematische Analyse von Algorithmen | 20:34 | transcript & video |
| 6-4 | 2026-05-18 | Typische Wachstumsraten | 11:40 | transcript & video |
| 6-5 | 2026-05-18 | Binäre Suche | 24:48 | transcript & video |
| 6-6 | 2026-05-18 | Speicherverbrauch von Java-Programmen | 12:18 | transcript & video |
| 7-1 | 2026-05-18 | Was ist sortieren? | 23:57 | transcript & video |
| 7-2 | 2026-05-20 | Primitive Sortieralgorithmen | 42:33 | transcript & video |
| 7-3 | 2026-05-20 | Analyse Primitive Sortierverfahren | 22:34 | transcript & video |
| 7-4 | 2026-05-20 | Merging | 11:32 | transcript & video |
| 7-5 | 2026-05-27 | Mergesort | 28:12 | transcript & video |
| 7-6 | 2026-05-27 | Optimierungen für Mergesort | 23:20 | transcript & video |
| 7-7 | 2026-05-27 | Quicksort | 26:35 | transcript & video |
| 7-8 | 2026-06-01 | Analyse von Quicksort | 51:30 | transcript & video |
| 7-9 | 2026-06-01 | Untere Schranke fürs Sortieren | 24:40 | transcript & video |
| 7-10 | 2026-06-03 | Heapsort | 5:45 | transcript & video |
| 7-11 | 2026-06-03 | Java’s Sortierverfahren | 24:28 | transcript & video |
| 8-1 | 2026-06-03 | Abstract Data Types & Collections | 16:36 | transcript & video |
| 8-2 | 2026-06-03 | Lineare Listen | 25:10 | transcript & video |
| 8-3 | 2026-06-08 | Stacks und Queues | 9:40 | transcript & video |
| 8-4 | 2026-06-08 | Array-basierte Listen | 34:13 | transcript & video |
| 8-5 | 2026-06-08 | Einfach verkettete Listen | 33:44 | transcript & video |
| 8-6 | 2026-06-10 | Einfach verkettete Liste PythonTutor Visualisierung | 4:54 | transcript & video |
| 8-7 | 2026-06-10 | Doppelt verkettete Liste | 19:40 | transcript & video |
| 8-8 | 2026-06-10 | Dynamische Arrays | 28:21 | transcript & video |
| 8-9 | 2026-06-10 | Java Collections Framework | 14:36 | transcript & video |
| 9-1 | 2026-06-10 | (Ordered) Symbol Tables | 7:53 | transcript & video |
| 9-2 | 2026-06-15 | Symbol Table Java Konventionen | 16:02 | transcript & video |
| 9-3 | 2026-06-15 | Elementare Symbol Tables | 8:10 | transcript & video |
| 9-4 | 2026-06-15 | Binäre Heaps | 16:50 | transcript & video |
| 9-5 | 2026-06-15 | Operationen in Binären Heaps | 20:46 | transcript & video |
| 9-6 | 2026-06-15 | Binäre Suchbäume | 9:15 | transcript & video |
| 9-7 | 2026-06-17 | Einfügen und Löschen in BSTs | 27:11 | transcript & video |
| 9-8 | 2026-06-17 | Ordered Symbol Table Operations in BSTs | 23:20 | transcript & video |
| 9-9 | 2026-06-17 | 2-3-Bäume | 15:39 | transcript & video |
| 9-10 | 2026-06-17 | Rot-Schwarz-Bäume | 5:36 | transcript & video |
| 9-11 | 2026-06-22 | Red-Black Trees Operations | 44:17 | transcript & video |
| 9-12 | 2026-06-22 | Löschen in 2-3 Bäumen | 26:43 | transcript & video |
| 9-13 | 2026-06-22 | Überblick B-Bäume | 4:30 | transcript & video |
| 10-0 | 2026-06-24 | Hashing | 8:27 | transcript & video |
| 10-1 | 2026-06-24 | Hash-Funktionen | 12:25 | transcript & video |
| 10-2 | 2026-06-24 | Vom Hash zum Array-Index | 7:23 | transcript & video |
| 10-3 | 2026-06-24 | Chaining Hashing | 17:06 | transcript & video |
| 10-4 | 2026-06-24 | Linear Probing Hashing | 15:37 | transcript & video |
| 10-5 | 2026-06-24 | Hashing im Kontext | 8:09 | transcript & video |
| 10-6 | 2026-06-24 | Universal Hashing | 11:30 | transcript & video |
| 11-1 | 2026-06-29 | Graph-Anwendungen | 26:58 | transcript & video |
| 11-2 | 2026-06-29 | Graphen Terminologie & Definitionen | 10:58 | transcript & video |
| 11-3 | 2026-06-29 | Ungerichtete Graphen API | 10:24 | transcript & video |
| 11-4 | 2026-06-29 | Repräsentationen von Graphen | 10:51 | transcript & video |
| 11-5 | 2026-06-29 | Tiefensuche (Teil 1) | 8:56 | transcript & video |
| 11-6 | 2026-07-01 | Tiefensuche (Teil 2) | 20:17 | transcript & video |
| 11-7 | 2026-07-01 | Breitensuche, Zusammenhangskomponenten | 20:23 | transcript & video |
| 11-8 | 2026-07-01 | Gerichtete Graphen | 16:18 | transcript & video |
| 11-9 | 2026-07-01 | Topologisches Sortieren | 20:25 | transcript & video |
| 11-10 | 2026-07-06 | Starke Zusammenhangskomponenten | 15:23 | transcript & video |
| 11-11 | 2026-07-06 | Minimale Spannbäume | 25:41 | transcript & video |
| 11-12 | 2026-07-06 | Kürzeste Wege | 33:02 | transcript & video |
| 11-13 | 2026-07-08 | Dijkstras Algorithmus | 21:38 | transcript & video |
| 12-1 | 2026-07-06 | Forschungsvortrag Teil 1: Java’s Dual-Pivot Quicksort | 24:16 | transcript & video |
| 12-2 | 2026-07-06 | Forschungsvortrag Teil 2: Powersort | 24:31 | transcript & video |
| 12-3 | 2026-07-08 | Übersicht Lehre der AG Algorithmik | 4:08 | transcript & video |