1. Introduction to Algorithm Analysis
2. Chapter four notes
3. Chapter five notes
4. Runtime estimate for Quicksort
5. Loop invariants
6. Chapter 19
7. Chapter 20
8. Chapter 21
9. Chapter 22
10. Computing Combinations by Recursion
11. 0-1 Knapsack problem
12. Chapter 14
13. Chapter 15
14. Chapter 34
15. Using OpenMP to write parallel C++ code
16. Chapter 16
17. Fibonacci Heaps
18. RSA Algorithm

The first midterm exam is coming up on Friday, Feb. 2. Here are details on how to prepare.

The second midterm exam is coming up on Monday, Feb. 26. Here are details on how to prepare.

The final exam is coming up on Tuesday, March 12 from 9:00 to 11:30. Here are details on how to prepare.

1. Chapters 2 and 4: due Jan 10
2. Chapters 5 and 7: due Jan 17
3. Proof of correctness: due Jan 24
4. Proof of correctness part two: due Jan 29
5. Chapter 20 and 21 problems: due Jan 31
6. Chapter 22 problem: due Feb 7
7. Chapter 21 second chance: due Feb 12
8. Chapter 14 problem: due Feb 21
9. Parallel Quicksort: due March 6

Syllabus

The syllabus for this course is here.