MPCS 55001: Algorithms
Autumn 2021


announcements | organization


Announcements

First class: Tuesday September 28, 5:30–7:30 pm CDT

Required Textbook: Introduction to Algorithms (Third Edition) by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein (ISBN 978-0-262-03384-8) = CLRS

Recommended Textbook: Algorithms by Dasgupta, Papadimitriou, & Vazirani (ISBN 978-0-07-35340-8)

Grading scheme:

Course Policies:

Schedule of class meetings

September 28
Analysis of algorithms: insertion sort
Asymptotic notation
Divide-and-conquer method
5:30–7:30 pm Room: tbd
Reading assignment: CLRS chapters 1, 2, and 3; chapter 4, sections 4.3–4.5
October 5
Randomized algorithms: Quicksort
Randomized data structure: Hash tables
5:30–7:30 pm
Reading assignment: CLRS chapters 5 and 7; chapter 11, sections 11.1–11.4
October 12
Dynamic programming
5:30–7:30 pm
Reading assignment: CLRS chapter 15, sections 15.1–15.4
October 19
Binary search trees
Quiz 1
5:30–7:30 pm
Reading assignment: CLRS chapter 12, sections 12.1–12.3
October 26
Graph traversal: Breadth-first search and depth-first search
5:30–7:30 pm
Reading assignment: CLRS chapter 22, sections 22.1–22.4
October 30
Midterm Exam
10:00 am–12:00 pm
November 2
Shortest paths: Dijkstra's algorithm, Bellman-Ford algorithm; DAG shortest paths algorithm
5:30–7:30 pm
Reading assignment: CLRS chapter 24, sections 24.1–24.3
November 9
Minimum spanning trees: Prim's and Kruskal's algorithms
5:30–7:30 pm
Reading assignment: CLRS chapter 23; chapter 21, section 21.3
November 16
Quiz 2
Maximum-flow minimum-cut problem: Ford-Fulkerson and Edmonds-Karp algorithms
5:30–7:30 pm
Reading assignment: CLRS chapter 26, sections 26.1–26.3; Kleinberg & Tardos chapter 7, sections 7.1–7.2, 7.5
Edmonds-Karp pseudocode (courtesy of Colin Hudler)
November 30
NP-Complete Problems
5:30–7:30 pm
December 7
Final Exam
5:30–8:30 pm


Organization

Staff

Lectures


brady at cs dot uchicago dot edu