Schedules

This schedule is tentative and only serves as a guideline.

Week 1 (08/27, 08/29):

Introduction and mathematics

Week 2 (09/01, 09/03, 09/05):

More on mathematics

Week 3 (09/08, 09/10, 09/12):

Worst-case analysis: Definitions, techniques, and examples

Week 4 (09/15, 09/17, 09/19):

Average-case analysis: Definitions, techniques, and examples

Week 5 (09/22, 09/24, 09/26):

Amortized analysis: Definitions, techniques, and examples

Week 6 (09/29, 10/01, 10/03):

Greedy algorithms

Week 7 (10/06, 10/08, 10/10):

Divide-and-conquer algorithms

Week 8 (10/15, 10/17):

Divide-and-conquer algorithms

Week 9 (10/20, 10/22, 10/24):

Dynamic programming algorithms

Week 10 (10/27, 10/29, 10/31):

Dynamic programming algorithms

Week 11 (11/03, 11/05, 11/07):

Lower bound theory

Week 12 (11/10, 11/12, 11/14):

Lower bound theory

Week 13 (11/17, 11/19, 11/21):

NP-completeness

Week 14 (11/24):

NP-completeness

Week 15 (12/01, 12/03, 12/05):

Approximation algorithms