Design and Analysis of Algorithms, Honors
CS 3511, Fall 2023
Time: Mon/Wed 12:30-1:45pm.
Location: Weber SST III 2
Office hours: TBD
TA: TBD
Instructor: Jan van den Brand
This is a tentative webpage. Additional information will be added as we get closer to the start of the fall term.
Homework
There will be problem sets/homework with both programming assignments (ie implement an algorithm) and theory/proof-based problems.
You are encouraged to collaborate and work in groups, but you must write your own solutions.
Grade Breakdown
Weighted average between problem sets and exams. The ratio is TBD.
Schedule
The tentative list of topics is as follows. Each topic consists of 1-2 weeks of classes.
Lecture notes will be provided.
| Divide and Conquer |
| Greedy |
| Matching and Flows |
| Dynamic Programming |
| Linear Programming |
| NP Completeness |
| Randomness |