<p>Any PSO materials will be posted here. If you have any questions, my office hours are <strong>Tue 11:30-12:30, Thu 11:30-12:30, Fri 8:30-10:30.</strong></p>
<h1>Week 1 - Asymptotics</h1>
<p><a href="/teaching/cs251/pso1.pdf">Noted</a> (No Slides this week)</p>
<h1>Week 2 - Recurrences and 2Sum</h1>
<p><a href="/teaching/cs251/pso2Clean.pdf">Clean</a> <a href="/teaching/cs251/pso2Noted.pdf">Noted</a></p>
<h1>Week 3 - Linked Lists, Stacks, and Queues</h1>
<p><a href="/teaching/cs251/pso3Clean.pdf">Clean</a> <a href="/teaching/cs251/pso3Noted.pdf">Noted</a></p>
<h1>Week 4 - Heapify and Heapsort</h1>
<p><a href="/teaching/cs251/pso4Clean.pdf">Clean</a> <a href="/teaching/cs251/pso4Noted.pdf">Noted</a></p>
<h1>Week 5 - Sorting (Quick, Count, Selection and Friends)</h1>
<p><a href="/teaching/cs251/pso5Clean.pdf">Clean</a></p>
<h1>Week 6 - BST, Hash Tables, Merge n Quick Sort</h1>
<p><a href="/teaching/cs251/pso6Clean.pdf">Clean</a> <a href="/teaching/cs251/pso6Noted.pdf">Noted</a></p>
<h1>Week 7 - Trees, Trees, Trees, etc. (Special thanks to Jonathan for covering this week!)</h1>
<p><a href="/teaching/cs251/pso7Clean.pdf">Clean</a></p>
<h1>Week 8 - Graphs, BFS, DFS, Trees (as graphs)</h1>
<p><a href="/teaching/cs251/pso8clean.pdf">Clean</a></p>
<h1>Week 9 - Spring Break</h1>
<p><a href="https://www.youtube.com/watch?v=dNr7nXvntO8">Go to sleep bruh</a></p>
<h1>Week 10 - Connected Components, Dijkstra, toposort</h1>
<p><a href="/teaching/cs251/pso9clean.pdf">Clean</a> <a href="https://drive.google.com/file/d/1UkpVXRHA4h0h5hYQla0Ib7RUQbeqHeO_/view?usp=sharing">toposort demonstration</a></p>
<h1>Week 11 - Strong and Weakly Connected Components</h1>
<p><a href="/teaching/cs251/pso10Clean.pdf">Clean</a></p>
<h1>Week 12 - Dijkstra, Bellman-Ford, Union Find</h1>
<p><a href="/teaching/cs251/pso11Clean.pdf">Clean</a> <a href="/teaching/cs251/pso11Noted.pdf">Noted</a></p>
<h1>Week 13 - MST, Prim v. Kruskal, Topo == DAG</h1>
<p><a href="/teaching/cs251/pso12Clean.pdf">Clean</a></p>