SI433: ADVANCED COMPUTER ALGORITHMS, SPRING 2001

DR. CHRISTOPHER BROWN

COURSE SYLLABUS

List of topics by week (pages from Introduction to Algorithms, Cormen, Leiserson, Rivest ):

  1. Intro, Growth Rates & Comparing Algorithms (pp. 1-11, 21-41)
  2. Divide & Conquer, Recurrence Relations (pp. 53-64, 153-163, 185-189, Extra Material)
  3. Divide & Conquer, Recurrence Relations (cont.)
  4. Basic Graph Algorithms (pp. 86-98, 463-497)
  5. Dynamic Programming (pp. 299-328)
  6. Dynamic Programming (pp. 550-565)
  7. X Week: Review and Exam
  8. Greedy Algorithms (pp. 329-350)
  9. Greedy Algorithms (pp. 498-532)
  10. Amortized Analysis (pp. 356-374)
  11. Amortized Analysis (Extra Material)
  12. X Week: Review and Exam
  13. Number Theoretic Algorithms, RSA, ethics & cryptography (pp. 808-813,831-836)
  14. NP-Completeness (pp. 916-946)
  15. NP-Completeness (pp. 964-978)

Three projects will be given, one from each of the three marking periods.



Christopher W Brown
2001-01-04