Welcome to my classes!
Monday, 9:15am
HG D 5.1
Here you will find all weekly lesson materials, notes, and resources to help you succeed. Check the lessons below!
Week 11 – Bellman-Ford, MST
Bellman-Ford, MST, Boruvka, Prim, Old Exam Exercises
Week 10 – BFS and Dijkstra
BFS, Shortest Paths in weighted Graphs, Dijkstra
Week 9 – DFS
DFS Tree, Pre/Post order, Topological Sorting, Counting connected components
Week 8 – Graphs
Graph Basics, Eulerian walks, Hamiltonian paths, General proof patterns
Week 7 – More DP
Subset Sum, Knapsack, LAT, Summy Array, Museum Tour, Positional Sum
Week 6 – 2-3-Trees and DP
MSS, Jump Game, LGT, Edit Distance, Climbing Staris, Burglar
Week 5 – Sorting Algorithms II
Quick Sort, Heap Sort and Max-Heaps in general
Week 4 – Sorting Algorithms
Bubble Sort, Selection Sort, Insertion Sort, Merge Sort
Week 3 – Maximum Subarray Sum
And Omeaga/Theta Notation and some more induction
Week 2 – O-Notation
Some more Induction and O-Notation
Week 1 – Asymptotic Growth
Administration basics and introduction to induction and asymptotic growth