|
Course Syllabus
Grading Policy Additional paper for graduate students |
Course Structure
| Online Reading | Textbook Reading | Written Assignment | Exam Topics |
| Algorithm Analysis | 1.4 - 1.6 | Homework 1 | . |
| Recurrence Equations | 3.6 - 3.7 | Homework 2 | Exam 1 |
| Sorting Algorithms | 4.1 - 4.8, 4.11 | Homework 3 | . |
| Selection Algorithms | 5.1 - 5.4 | Homework 4 | Exam 2 |
| Graph Traversal | 7.1 - 7.4 | Homework 5 | . |
| Greedy Algorithms | 8.1 - 8.4 | Homework 6 | Exam 3 |
| Dynamic Algorithms | 10.1 - 10.5, 9.4 | Homework 7 | . |
| Parallel Algorithms | 14.1 - 14.5 | Homework 8 | . |
| NP-Complete Problems | 13.1 - 13.8 | . | Exam 4 |