CSE 326 Data Structures
Winter 1996

Instructor:

Oren Etzioni, etzioni@cs.washington.edu

Lectures

MWF 1:30pm - 2:20pm in LOW 101
Office Hours

Monday 4:00-4:50

Teaching Assistant:

Ori Gershony , ori@cs.washington.edu

Quiz Sections

Thursdays 9:30am - 10:20am in MEB 247
Thursdays 2:30pm - 3:20pm in LOW 113
Office Hours

Monday 12:30-1:20, Thursday 1:30-2:20 in 326A Sieg

Course Information

Assignments and Other Handouts

Written homework sets will generally be due on Fridays in class. There will also be a few programming assignments.

Homework Sets:
- How to turn in programs on paper
- Homework 0 (OPTIONAL)
- Homework 1
  - Notes on homework 1
- Homework 2 Example inputs for Problem3 , Problem4 , Problem5a , Problem5b
  - Notes on homework 2 and sample solutions for Problem 2 , Problem 3 , Problem 4 , Problem 5.1 , Problem 5.2
- Homework 3
  - Notes on homework 3
- Homework 4
- Homework 5
  - Notes on homework 5
- Homework 6
  - Notes on homework 6
- Homework 7 (OPTIONAL)
  - Notes on homework 7
- Final Project
Programming Projects:
Lecture Notes:
- Chapters 1,2 (Introduction)
- Chapter 3 (Lists, Stacks, and Queues)
- Chapter 4 (Trees)
- Chapter 5 (Hashing)
- Chapter 6 (Priority Queues)
- Chapter 7 (Sorting)
- Chapter 8 (Disjoint Set ADT)
- Chapter 9 (Graph Algorithms)
Midterm Exam:
- Solutions
Final Exam:

Previous 326 Course Webs:

etzioni@cs.washington.edu, ori@cs.washington.edu