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

Clean Noted

Week 3 - Linked Lists, Stacks, and Queues

Clean Noted

Week 4 - Heapify and Heapsort

Clean Noted

Week 5 - Sorting (Quick, Count, Selection and Friends)

Clean

Week 6 - BST, Hash Tables, Merge n Quick Sort

Clean Noted

Week 7 - Trees, Trees, Trees, etc. (Special thanks to Jonathan for covering this week!)

Clean

Week 8 - Graphs, BFS, DFS, Trees (as graphs)

Clean

Week 9 - Spring Break

Go to sleep bruh

Week 10 - Connected Components, Dijkstra, toposort

Clean toposort demonstration

Week 11 - Strong and Weakly Connected Components

Clean

Week 12 - Dijkstra, Bellman-Ford, Union Find

Clean Noted

Week 13 - MST, Prim v. Kruskal, Topo == DAG

Clean Noted (There is a typo in q1, fixed in noted pdf)

Week 14 - Compression, Pattern Matching

Clean (UPDATED TO FIX BOYER-EXAMPLE) Noted

Week 15 - KD Trees, Point Trees (Last PSO!!)

Clean Noted