CSCI 653: syllabus

I reserve the right to make suitable adjustments to the syllabus as the semester progresses.

lecture date day topic clrs
1.   9/01 Tuesday Mathematical foundations:
review
§3.2
Appendix A.1 
Appendix C.1
2.   9/03 Thursday Mathematical foundations:
asymptotic notation and proof techniques
§3.1
Appendix A.2
3.   9/08 Tuesday Mathematical foundations:
solving recurrences
§4
4.   9/10 Thursday Analysis of algorithms:
overview
§1
5.   9/15 Tuesday Analysis of algorithms:
worst-case analysis
§2.1 & §31.2
6.   9/17 Thursday Analysis of algorithms:
average-case analysis
§2.2
7.   9/18 Friday
3-4:20 p.m.
Analysis of algorithms:
average-case analysis

8.   9/24 Thursday Analysis of algorithms:
amortized analysis
§17.1-17.4.1
9.   9/29 Tuesday Analysis of algorithms:
amortized analysis
§21
10.  10/01 Thursday Greedy algorithms §16.1-16.2
11.  10/06 Tuesday Greedy algorithms §16.5
12.  10/08 Thursday Divide-and-conquer algorithms §2.3



Fall Break
13.  10/15 Thursday Divide-and-conquer algorithms §28.2
14.  10/20 Tuesday Divide-and-conquer algorithms §7.1-7.3; 8.2-8.3; & 9.3 
15.  10/22 Thursday Divide-and-conquer algorithms §33.4
16.  10/27 Tuesday Dynamic programming algorithms §15.2-15.3
17.  10/29 Thursday Dynamic programming algorithms §15.4
18.  11/03 Tuesday Dynamic programming algorithms §15.5
19.  11/05 Thursday Dynamic programming algorithms §15.3
20.  11/10 Tuesday Lower bound theory §8.1
21.  11/12 Thursday Lower bound theory §9.1
22.  11/17 Tuesday NP-completeness §34.1
23.  11/19 Thursday NP-completeness §34.2
24.  11/24 Tuesday NP-completeness §34.3



Thanksgiving Break
25.  12/01 Tuesday NP-completeness §34.4
26.  12/03 Thursday Approximation algorithms §35.3

12/10 Thursday Final exam 9:00 a.m.-noon

Last updated Monday, 17-Aug-2009.
Copyright © Virginia Torczon. All Rights Reserved.

The Department of Computer Science
The College of William & Mary