RWN
Week Day Date Topics Readings in N & N
---- --- ---- ------ -----------------
1 W 1/4 Algorithms Ch 1, App A
F 6 Divide and Conquer 2.1-2.3
M 9 Growth of Functions, Recurrences 1.4,A.5,B
2 W 11 Correctness 1.3, A.3
F 13 Sorting, esp. quickort 2.4,Ch 7
M 16 More on Divide and Conquer Ch 2
3 W 18 Dynamic Programming I 3.1-3.3
F 20 Dynamic Programming II 3.4-3.5
M 23 Greedy Methods 4.1, 4.2
4 W 25 Greedier Methods 4.3-5
F 27 Backtracking Ch 5
M 30 Branch and Bound Ch 6
5 W 2/1 Review
F 3 Midterm Exam
M 6 Midterm Break
6 W 8 Random Number Generation A.8
F 10 Computational Geometry
M 12 Sorting Lower Bound, Networks Ch 7
7 W 15 Shuffling
F 17 Complexity of Searching Ch 8
M 20 Hashing 8.4
8 W 22 Encryption 2.6
F 24 Computational Complexity Ch 9
M 27 NP-completeness 9.4
9 W 3/1 Reductions
F 3 Scheduling 4.3
M 6 Code Optimization
10 W 8 Review
F 10 Final Exam (in class)
W 15 12 noon, Final Exam (take-home) due
Opportunity Percentage
Midterm 15-20%
Final 30-35%
Homework, Pop quizzes 20-25%
Programs, Projects, Portfolios 25-30%
Total 100%
(Percentages will be selected so as to maximize your individual weighted total.)
(Attendance: More than two unexcused absences will affect the grade.)
(Late work policy: Work submitted n days late will be devalued by the reciprocal of
the n+1st harmonic numbers. These factors will be prorated.)
Text: Foundations of Algorithms by Neapolitan and NaimipourReferences: Numerous references can be found in the library. Bibliography