Syllabus
CSE 326 Data Structures, Fall 2000


Lectures:  MWF 2:30-3:20  EE1 125
Section AA:  Thurs 12:30-1:20 LOW 112
Section AB:  Thurs 1:30-2:20  LOW 112

Midterm:  Nov 1 (tentative date)
Final: Dec 11

Henry Kautz, Instructor
kautz@cs.washington.edu
(206) 543-1896 Tues 2:30-3:30
office hours:
Tues 2:30-3:30
Fri 11:30-12:15
Sieg 417

Alexander Mohr, TA
amohr@cs.washington.edu
office hours:
Mon 10:30-11:30
Wed 1:30-2:30
Office hours held in Sieg 226b

Textbook:   M.A. Weis, Data Structures & Algorithms in C++
(2nd edition, 1999, ISBN: 0-201-36122-1)
We will be covering all of chapters 1-8 and parts of 9, 10, and 11.

Course Home Pagehttp://www.cs.washington.edu/education/courses/326/00au/
See links from Home Page for instructions on registering for course email.
Programming will be done on the CSE lab machines using Unix and g++.  See links from the home page for laboratory information.

Purpose of course:  Fundamental abstract data types and their implementations as data structures. Asymptotic analyses of algorithms involving these data structures.  Specific topics include:

Course Policies:
Grading
homework: 25%
projects:  25%
midterm:  20%
final:  30%