Computer Science 303
Algorithms
Fall, 2001

Weizhen Mao
Department of Computer Science
College of William and Mary


General Information | Schedules | Announcements | Lectures | Assignments | Project | Exams

Schedules

Week 1 (08/30):
Introduction
Week 2 (09/04 and 09/06):
Algorithm analysis method
Week 3 (09/11 and 09/13):
Elementary data structures
Week 4 (09/18 and 09/20):
Trees
Week 5 (09/25 and 09/27):
Hashing
Week 6 (10/02 and 10/04):
Priority queues
Week 7 (10/09 and 10/11):
Discussions, reviews, exercises, and midterm exam
Week 8 (10/18):
Discussion of midterm and project
Week 9 (10/23 and 10/25):
Sorting algorithms
Week 10 (10/30 and 11/01):
More sorting algorithms
Week 11 (11/06 and 11/08):
Some interesting algorithms and their analysis
Week 12 (11/13 and 11/15):
More interesting algorithms
Week 13 (11/20):
Algorithm design techniques
Week 14 (11/27 and 11/29):
More algorithm design techniques
Week 15 (12/04 and 12/06):
Open for make-up lectures and discussions

Last modified: August 30, 2001