Data Structures and Algorithms
for Computational Science

Computer Science 409
Spring 2000

Course Description Office Hours Homework Schedule
Programming Links Handouts Programming Grading Criteria


Recently Placed on the Web

Staff and Office Hours

CS410 STAFF Name Email Office

Paul Chew 494 Rhodes

Wei Wei 4121 Upson
Monday, 2:30-3:30 4121 Upson Wei Wei
Tuesday, 10:00-11:00 494 Rhodes Paul Chew
Wednesday, 2:30-4:00 4121 Upson Wei Wei
Thursday, 10:00-11:00 494 Rhodes Paul Chew


A chronological list of documents handed out in class.

Web Documents

A chronological list of documents placed on the class web pages.


Lecture topics, corresponding readings, and related Web material appear in the Schedule.

Information on Homework

Graded homework will be available in class or during office hours.
Homework Topic Due Solution
HW01 big-O, arrays and linked lists Thursday, Feb 3 HW01 Solution
HW02 hashing Thursday, Feb 10 HW02 Solution
HW03  BSTs, 234-Trees Thursday, Feb 17 HW03 Solution
HW04 programming (Rectangle) Thursday, Feb 24 HW04 Solution
HW05 Priority Queues and Heaps Thursday, Mar 2 HW05 Solution
HW06 Divide & Conquer Thursday, Mar 16 HW06 Solution
HW07 Dynamic Programming Thursday, Mar 30 HW07 Solution
HW08 programming (Binary PQ) Thursday, Apr 6 not yet available
HW09 Greedy Method; Amortization Thursday, Apr 13 HW09 Solution
HW10 Amortization, Reductions Thursday, Apr 20 HW10 Solution
HW11 programming (Suffix Tree) Tuesday, May 2 HW11 Solution
HW12 Max Flow, Reductions Thursday, May 4 HW12 Solution

Information on Programming

Other Links

Brief Course Description

Homework (and Exam Question) Grading Criteria: