This page contains archived versions of the Stanford CS161 (Design and Analysis of Algorithms) webpage in the quarters I've taught it. All internal links should be valid, though external
links may no longer be functional.
2012-2013 Academic Year
This was my first offering of CS161 and it was great to finally teach an algorithms course! I learned a lot in the process and got a chance to see what happens downstream of CS103. The course was well-received, and in the future I'm hoping to get the chance to iterate and improve upon it!
- Total students enrolled: 116
- Lecture Topics:
- Week 1: Asymptotics, BFS, Dijkstra's Algorithm
- Week 2: DFS, Topological Sort, Kosaraju's Algorithm, Mergesort
- Week 3: Binary Heaps, Master Theorem, Linear-Time Selection
- Week 4: Quickselect, Quicksort, Karger's Algorithm
- Week 5: Hash Tables, Activity Selection, Prim's Algorithm
- Week 6: Kruskal's Algorithm, Weighted Activity Selection, Needleman-Wunsch
- Week 7: Bellman-Ford, TSP DP, 0/1 Knapsack
- Week 8: FPTAS's, Where to Go from Here