Announcements Course Information
Text and Course Summary Homework
and Notes
1. Assignment 10 is ready!
2. Quiz 3 will happen on 12/8 in class.
Shaf 300, MW 12-1:15PM
Baruch Awerbuch baruch@cs.jhu.edu
Office: NEB 318
Office Hours: MW 11:00~12:00 (right before the class)
Ming
Chuang ming@cs.jhu.edu
Office: NEB 215
Office Hours: Tuesday 4:00~5:00
Friday 1:00~2:00
Greg Anderson greg825@jhu.edu
Introduction to Algorithms, Second Edition,by Cormen, Leiserson, and Rivest, McGraw Hill, 2001.
o Asymptotic notation and recurrence relations
o Sorting and selection
o Lower-bound techniques
o Union-find trees
o Dynamic programming
o Graphs and graph algorithms
o Hashing
o Strings and string processing
o On-line Computing
o NP-completeness
o Homeworks: 40%
o Three Exams: 60%
o Late submissions:
We do not accept late assignments.
o Students are allowed to discuss assignments, however all scratch-work should be destroyed after the discussion and everyone should write the assignment on his/ her own.
o Illegible assignments will not be graded.