CSE logo University of Washington Department of Computer Science & Engineering
 CSE 326: Data Structures, Autumn 2003
  Main Page    Previous Quarters    CSE Home   About Us    Search    Contact Info 

Course Content
 Calendar & Lecture Slides
 Quiz Section (N/A)
 Using Course Email
 Announcement List Archive
 Discussion List Archive
 Academic Accomodations
 Anonymous Feedback
 Grading Policy
 Collaboration Policy
 Programming Guidelines
 Written HW Guidelines
 Computing Info
 Turnin Info
    Data Structures in action - lists, stacks, queues, trees, dictionaries, heaps, graphs, sets... they are everywhere!


  • Final: Monday, 12/15/03, in class, 2 hours, closed book/notes

  • Homework 3: Disjoint Sets, Sorting and Graphs
  • Project 3: Shake-n-Bacon: Data Mining Using Trees and Tables
  • Midterm: Monday, 11/3/03, in class
  • Homework 2: Search Trees, Hash Tables
  • Project 2: The Search for a-MAZE-ing donuts! Last update: 10/23/2003
  • Homework 1: Asymptotic Analysis, Priority Qs
  • Project 1: Sound Blaster!     Last update: 10/3/2003
  • UNIX tutorial: Tuesday, Sep 30, 3:30-4:30 in Allen 002, by Albert Wong

Course Staff and Office Hours:
Ashish Sabharwal, Instructor

Mon and Thu, 10:30-11:20
Room 214, Allen Center
Ethan Phelps-Goodman, Teaching Assistant
Tue, 11:00-12:00
Room 216, Allen Center
Albert Wong, Teaching Assistant
Fri, 12:30-1:20
Lab 002, Allen Center

Class Schedule:
Lectures (Ashish) MWF 2:30-3:20 EE1 037
Section AA (Ethan) Thurs 1:30-2:20MEB 245
Section AB (Albert) Thurs 12:30-1:20MEB 245
Midterm: Mon, Nov 3, 2:30-3:20 EE1 037
Final Exam: Mon, Dec 15, 2:30-4:20 EE1 037


In this course, we will explore several fundamental algorithms and data structures in computer science, and learn to implement them. Some of the data structures we will encounter include linked lists, stacks, queues, trees, heaps, hash tables, and graphs. We will study and analyze algorithms for searching, traversing trees, hashing, manipulating priority queues, sorting, finding shortest paths in graphs, and much more. Note: You may have seen some of this material before. However, the treatment of algorithms and data structures in this course will be much more rigorous and in-depth compared to CSE 143. (From the catalog: Prerequisite: CSE 321. No credit to students who have completed CSE 373, CSE 374, or EE 374)

    Data Structures and Algorithm Analysis in Java, by Mark Allen Weiss.

ISBN: 0201357542

Click here for errata by the author. Please note these changes in your copy of the textbook.

Mailing Lists: There are three email aliases for the class. See Using Course Email for detailed information and how to subscribe. Briefly, cse326-announce@cs is the mailing list for important course announcements. Everyone should subscribe to this list. cse326@cs is the class discussion mailing list. Signing up for this list is recommended. cse326-staff@cs is the email alias for the course staff, i.e. the instructor and the TAs. Address your queries about homeworks or other material to this alias rather than to only the instructor or a TA. This will reduce the delay in replying.

Anonymous Feedback: Your comments (both positive AND negative) are very valuable to us. It is our aim to give you a high quality of education in this course, so please send any and all comments to this anonymous feedback form. It is completely confidential. You can choose to send feedback to the instructor, to the TAs, or to both.

CSE logo Department of Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to cse326-staff at cs.washington.edu]