Computer Science 420/520
Applied Algorithms
Spring 2009

Weizhen Mao
Department of Computer Science
College of William and Mary


General Information | Schedules | Announcements | Lectures | Homework| Projects

General Information

Instructor: Weizhen Mao, McGl 114, 221-3472, wm@cs.wm.edu.


Lectures: TTh 9:30-10:50, Tucker 106.


Office hours: TTh 11:00-12:30 and 2:00 -2:30, McGl 114.


TA: Yixun Liu, enjoywm@cs.wm.edu.


Textbook:
None, but lecture notes and related papers will be distributed in class.

Course description:
The algorithmic aspects of the following topics will be covered, either briefly or in detail, in this course:
  • Molecular biology: Sequence comparison, fragment assembly, and physical mapping;
  • Operations research: Resource allocation, load balancing, and job scheduling;
  • Finance: One-way trading and portfolio selection;
  • Networks: Call admission and circuit routing;
  • Geometry: Line intersection and closest points;
  • Combinatorics: Generating instances of objects.


Course work:
  • Class attendance and participation: 10\%
  • Semi-regular homework assignments (which allow collaboration with classmates): 30\%
  • Project which includes research, implementation, two presentations, and a paper: 60\%


Grading policy:
Grades will be assigned based on how well the course work (listed above) is completed. The emphasis will be on the quality of the project.

Disability:
If you have a disability that may effect your participation in this course and wish to discuss academic accommodations, please contact me as soon as possible.

Last modified: January 26, 2009.