CSE 326 Data Structures, Autumn 2002

Lecture Slides Assignments Email Archive Computing Info
Syllabus First-Day Survey Calendar of Topics  
Heap Queue Hash

Syllabus

SLN / Section Days Times Location
2532 / AA
MWF
Th
230-320
130-220
MEB 246 (room info)
MEB 246 (room info)
2533 / AB
MWF
Th
230-320
1230-120
MEB 246 (room info)
MOR 116 (room info)

Midterm:  2:30-3:20 p.m. Monday, Nov. 4, 2002

Final: 2:30-4:20 p.m. Monday, Dec. 16, 2002

Textbook:   M.A. Weis, Data Structures & Algorithms in Java

Henry Kautz, Instructor
<kautz@cs.washington.edu>
office hours:  
Monday 11:00am-Noon, Sieg 417
William Pentney, Graduate TA
<bill@cs.washington.edu>
office hours: 
Wednesday 5:30-6:30pm, Sieg 226b
Friday 11:30am-12:30pm, Sieg 226a
Jeremy Moody, Undergraduate TA
<jmoody@cs.washington.edu>
office hours: 
Tuesday 10:30-11:30am, Sieg 226a

Purpose of Course

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

In addition to this fundamental material, you will also learn the basics of developing and evaluating programs using Unix and tools such as csh, grep, and gnuplot.

Course Mechanics

Grading

The following are rough estimates, not guarantees:

Assignments will frequently include optional "bonus point" sections.