Welcome to the course web page for CMPSC 465!
| Office | Phone | Email @psu.edu | Office Hours | |
|---|---|---|---|---|
| Prof. Adam D. Smith | IST 338K | x3-0076 | asmith+465 |
Tue. 4-5pm Wed. 3:45pm-5pm |
| T.A. Abhradeep Guha Thakurta | IST 357 | azg161+465 | Thu. 5-7pm |
| Lec. | Date | Notes | Topics | Reading (numbers marked 2e refer to the second edition) | Homework | |
|---|---|---|---|---|---|---|
| 1 | Mon, Aug. 24 | Introduction | CLRS Ch. 1,2.1,2.2 | HW 1 out: pdf, tex | ||
| 2 | Wed. Aug. 26 | Insertion sort analysis | CLRS Ch. 2.1-2.2, Levitin Ch. 1 (on Angel) | |||
| 3 | Fri., Aug. 28 | Asymptotic growth of functions | CLRS Chap. 3 | HW 2 out: pdf, tex | ||
| 4 | Mon, Aug. 31 | More on asymptotic growth | ||||
| 5 | Wed. Sep. 2 | Divide and Conquer: Merge-Sort | CLRS Ch. 2 | |||
| 6 | Fri. Sep. 4 | More divide and conquer, recurrence trees | CLRS Chap. 4.4 (2e: 4.2) | HW 3 out: pdf, tex | ||
| 7 | Wed. Sep. 9 | More divide and conquer: Karatsuba | - | |||
| 8 | Fri. Sep. 11 | Recurrences: Substitution method | CLRS Chap. 4.3 (2e: 4.1) | HW 4 out: pdf, tex | ||
| 9 | Mon. Sep. 14 | Recurrences: Master theorem | CLRS Chap. 4.5 (2e: 4.3) | |||
| 10 | Wed. Sep. 16 | Basic data structures | CLRS Chap. 10.1 to 10.3 | Programming assignment on Angel | ||
| 11 | Fri. Sep. 18 | Heaps introduction | CLRS Chap. 6.1, 6.2 | HW 5 out: pdf, tex | ||
| 12 | Mon. Sep. 21 | Heaps continued | CLRS Chap. 6 | |||
| 13 | Wed. Sep. 23 | Trees; Binary Search Trees | CLRS Chap. 10.4 and 12.1 to 12.3 | |||
| 14 | Fri. Sep. 25 | More binary search trees | ||||
| 15 | Mon. Sep. 28 | Review | ||||
| 16 | Wed. Sep. 30 | Review | ||||
| Thu. Oct 1 | Midterm 1 in 10 Sparks at 8:15pm | |||||
| 17 | Fri. Oct. 1 | Red-Black Trees, part 1 | CLRS Chap. 13.1-13.2 | HW 6 out: pdf, tex | ||
| 18 | Mon. Oct. 5 | Red-Black Trees, part 2 | CLRS Chap. 13.3 | |||
| 19 | Wed. Oct. 7 | Augmented Data Structures: OS trees | CLRS Chap. 14 | HW 7 out: pdf, tex | ||
| 20 | Mon. Oct. 12 | Augmented Data Structures: Interval Trees | CLRS Chap. 14 | |||
| 21 | Wed. Oct. 14 | Graphs intro | CLRS Appendix B.2 | |||
| 22 | Fri. Oct. 16 | Breadth-first search | CLRS Chap 22.1-2 | HW 8 out: pdf, tex | ||
| 20 | Mon. Oct. 19 | More breadth-first search | CLRS Chap. 22.2 | |||
| 21 | Wed. Oct. 21 | Depth-first search | CLRS Chap. 22.3 | |||
| 22 | Fri. Oct. 23 | Midterm discussion | - | HW 9 out: pdf, tex | ||
| 20 | Mon. Oct. 26 | Topological Sorting; Strongly Connected Components | CLRS Chap. 22.4 | |||
| 21 | Wed. Oct. 28 | Strongly Connected Components | CLRS 22.5 | |||
| 22 | Fri. Oct. 30 | Shortest paths: Dijkstra's algorithm | CLRS Chap. 24.3 | |||
| End of Midterm 2 material | ||||||
| 20 | Mon. Nov. 2 | Dijkstra: example + failure for negative weight edges | CLRS Chap. 24.3 | |||
| 21 | Wed. Nov. 4 | Minimum Spanning Trees, part 1 (basic properties) | CLRS 23 | |||
| Thu. Nov. 5 | Midterm 2 in 26 Hosler at 8:15pm | |||||
| 22 | Fri. Nov. 6 | Minimum Spanning Trees, part 2 (Prim's algorithm + examples) | CLRS 23 | |||
| 23 | Mon. Nov. 9 | Greedy Algorithms: Interval Scheduling | ||||
| 24 | Wed. Nov. 11 | Greedy Algorithms: Interval Partitioning | HW 10 out: pdf, tex | |||
| 25 | Fri. Nov. 13 | Greedy Algorithms: Minimizing lateness | ||||
| 26 | Mon. Nov. 16 | Dynamic programming: Weighted Interval Scheduling | ||||
| 27 | Wed. Nov. 18 | Greedy Algorithms: Rod cutting | ||||
| 28 | Fri. Nov. 20 | Greedy Algorithms: Least Common Subsequence | HW 11 out: pdf, tex | |||