1. Introduction to Algorithm Analysis
2. Chapter four notes
3. Chapter five notes
4. Runtime estimate for Quicksort
5. Chapter 19
6. Chapter 20
7. Chapter 21
8. Chapter 22: Dijkstra Implementation
9. Proof of correctness
10. Computing Combinations by Recursion
11. 0-1 Knapsack problem
12. Chapter 14
13. Chapter 15
14. Chapter 26: notes on OpenMP
15. Chapter 34
16. Chapter 35
17. RSA Algorithm
18. Chapter 18
19. Chapter 16

The first midterm exam will be held in class on Friday, Feb. 7. Here some information on what the exam will cover.

The second midterm exam will be held in class on Friday, Feb. 28. Here some information on what the exam will cover.

The final exam will be held Monday, March 17 from 3:00 to 5:30. Here some information on what the final will cover.

1. Chapters 2 and 4: due Jan. 15
2. Chapters 5 and 7: due Jan 22
3. Chapter 20 and 21 problems: due Jan 29
4. Prim's algorithm:due Feb. 5
5. Chapter 14 problem: due Feb 19
6. Parallel LCS: due Feb 24
7. Problem 34-3: due March 5

Syllabus

The syllabus for this course is here.