Any PSO materials will be posted here. If you have any questions, my office hours are Tue 11:30-12:30, Thu 11:30-12:30, Fri 8:30-10:30.
Week 1 - Asymptotics
Noted (No Slides this week)
Week 2 - Recurrences and 2Sum
Week 3 - Linked Lists, Stacks, and Queues
Week 4 - Heapify and Heapsort
Week 5 - Sorting (Quick, Count, Selection and Friends)
Week 6 - BST, Hash Tables, Merge n Quick Sort
Week 7 - Trees, Trees, Trees, etc. (Special thanks to Jonathan for covering this week!)
Week 8 - Graphs, BFS, DFS, Trees (as graphs)
Week 9 - Spring Break
Week 10 - Connected Components, Dijkstra, toposort
Week 11 - Strong and Weakly Connected Components
Week 12 - Dijkstra, Bellman-Ford, Union Find
Week 13 - MST, Prim v. Kruskal, Topo == DAG
Clean Noted (There is a typo in q1, fixed in noted pdf)