Class Information
Lecturer
Textbook
Syllabus
- Introduction - Getting Started
- Divide-and-conquer
- Dynamic programming
- Greedy algorithms
- Amortized analysis
- Minimum spanning trees
- Single-source shortest paths
- Maximum flow
- Midterm exam
- Multithreaded algorithms
- Linear programming
- Polynomials and the FFT
- Number-theoretic algorithms
- String matching
- All-pairs shortest paths
- Computational geometry
- Approximation algorithms
- Final exam
Grading
-
Homework: 30%
Midterm: 30%
Final Exam: 30%
In-Class performance: 10%
Prerequisite
-
Programming experiences with C or Java
|
|
|
