SI433: ADVANCED COMPUTER ALGORITHMS, SPRING 2001

DR. CHRISTOPHER BROWN

COURSE SYLLABUS

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

  1. Intro, Growth Rates & Comparing Algorithms (pp. 1-11, 21-41)
  2. Algorithmic Analysis - Guiding Algorihmic Improvement
  3. Divide & Conquer, Recurrence Relations (pp. 53-64, 153-163, 185-189, Extra Material)
  4. Divide & Conquer, Recurrence Relations (cont.)
  5. Basic Graph Algorithms (pp. 86-98, 463-497)
  6. X Week: Review and Exam
  7. Dynamic Programming (pp. 299-328)
  8. Dynamic Programming (pp. 550-565)
  9. Greedy Algorithms (pp. 329-350)
  10. Greedy Algorithms (pp. 498-532)
  11. Number Theoretic Algorithms, RSA, ethics & cryptography (pp. 808-813,831-836)
  12. X Week: Review and Exam
  13. Amortized Analysis (pp. 356-374)
  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 2002-01-06