CS1570NotesOct13Oct15
CS1570NotesOct20
CS1570NotesOct22
CS1570NotesOct29
CS1570NotesOctober27
CS1570NotesSept10
CS1570NotesSept15
CS1570NotesSept17
CS1570NotesSept22
CS1570NotesSept24
CS1570NotesSept29Oct1
SummaryFirstMonth
midterm1 review solutions
midterm2 sheet
Part I . Greedy Algorithms. Divide and Conquer. Dynamic Programming. Random Sampling.Part II . Online Data Structures (e.g. Union-Find) with Amortized Analysis. Text Compression (e.g. Lempel-Ziv). Bipartite Matchings. Flows. Linear Programming (Simplex). Markov Chain Monte Carlo.Part III (Time Allowing) . Clustering. Beyond Worst-Case Models. Approximation Algorithms. Energy Minimization. Stable Matching. etc. # Date Topic Notes 1 Sep 10 (Thurs) Greedy Algorithms Part I Start 2 Sep 15 (Tues) Divide and Conquer 3 Sep 17 (Thurs) Dynamic Programming 4 Sep 22 (Tues) Advanced Greedy Algorithms 5 Sep 24 (Thurs) Advanced Divide and Conquer 6 Sep 29 (Tues) Advanced Dynamic Programming 7 Oct 01 (Thurs) Advanced Dynamic Programming 8 Oct 06 (Tues) Group Problem Solving Midterm 1 Review 9 Oct 08 (Thurs) Midterm 1 10 Oct 13 (Tues) Amortized Analysis + Group Problem Solving Part II Start 11 Oct 15 (Thurs) Amortized Analysis 12 Oct 20 (Tues) Splay Trees 13 Oct 22 (Thurs) Bipartite Matching 14 Oct 27 (Tues) Bipartite Matching 15 Oct 29 (Thurs) Network Flows - Nov 03 (Tues) No Class (Election Day) 16 Nov 05 (Thurs) Midterm 2 17 Nov 10 (Tues) Part III Start 18 Nov 12 (Thurs) 19 Nov 17 (Tues) 20 Nov 19 (Thurs) 21 Nov 24 (Tues) No Class (Thanksgiving) - Nov 26 (Thurs) No Class (Thanksgiving) 22 Dec 01 (Tues) 23 Dec 03 (Thurs) 24 Dec 08 (Tues) Course Recap (Reading Period) Dec 10 (Thurs) No Class (Reading Period) Dec 14 (Mon) Final Exam