CS 401 Computer Algorithms
Time and location:
Tuesday Thursday 3:30-4:45pm, Burnham Hall, Room 308
office hours: Tuesday 2:00pm-3:00pm, SEO 1240
office hours: Thursday 11:00am-1:00pm, SEO 1326
The goal of this course is to present fundamental techniques in the design and analysis of algorithms, including the greedy method, dynamic programming, and divide and conquer.
These methods are presented in the context of various algorithmic problems, such as shortest paths, minimum spanning trees, and network flows.
The course also discusses limitations in the design of algorithms for certain computationally intractable problems, using the language of NP-completeness.
Algorithm Design, by Jon Kleinberg and Eva Tardos.
There will be one midterm, a final exam, and several homeworks.
The final exam will be comprehensive.
The homeworks will be posted on piazza.
Each homework will be due before the beginning of a predetermined lecture.
No late assignments will be accepted.
The final score is computed using the formula: 0.35 × homeworks + 0.3 × midterm + 0.35 × final.
The final letter gade will be curved.
All the scores and grades will be posted on blackboard.
Aug 28, 2017. Lecture 1: Introduction (Chapter 1). [Slides, Stable matching demo]
Aug 30, 2017. Lecture 2: Analysis of algorithms (Chapter 1). [Slides]
Sep 4, 2017. Lecture 3: Review of big-O notation (Chapter 2.1, 2.2, 2.3, 2.4).
Sep 6, 2017. Lecture 4: Review of recurrence tree and Master theorem. [Slides]
Sep 11, 2017. Lecture 5: Review of graphs (Chapter 3). [Slides]
Sep 13, 2017. Lecture 6: Greedy algorithms (Chapter 4.1). [Slides]
Sep 18, 2017. Lecture 7: Greedy algorithms (Chapter 4.2, 4.3).
Sep 20, 2017. Lecture 8: Greedy algorithms (Chapter 4.3).
Sep 25, 2017. Lecture 9: Greedy algorithms: Minimum Spanning Tree (Chapter 4.4, 4.5). [Slides]