Instructor: Richard Ladner
Time: MWF 11:30-12:20
Place: EE1 045

Office Hours

Who When Where
Richard Ladner M 1:00 - 2:30 CSE 632
Ian Simon Tu 12:00-2:00 CSE 216

Sections

Section TA When Where
AA Ian Simon Th 12:30-1:20 LOW 115
AB Ian Simon Th 1:30-2:20 LOW 115

Reading from Data Structure and Algorithm Analyis in C by Weiss

September 28 - October 12: Chapters 1,2,7
October 13 - October 19: Chapters 3,4
October 20 - October 26: Chapter 4
October 26 - November 1:Chapter 4, Chapter 12.6
November 1 - November 8: Chapter 6
November 8 - November 15: Chapter 9.2, 9.3
November 15 - November 22: Chapter 8
November 22 - November 29: Chapter 5
November 30 - December 6: Chapter 9.5, 9.7

Assignments

Assignment 1 due 10/5/05.
Assignment 2 due 10/12/05.
Assignment 3 due 10/19/05.
Assignment 4 due 10/26/05.
Assignment 5 due 11/2/05.
Assignment 6 due 11/16/05.
Assignment 7 due 11/23/05.
Assignment 8 due Friday, 12/2/05.

Projects

Project 1 due 10/24/05.
Pair programming for Project 1. Please read to find your assignment and learn about the pair programming process.
Advice on Project Reports: Please read to help you plot your graphs and write your reports.
Project 2 due 11/14/05.
Pair programming for Project 2. Please read to find your assignment and learn about the pair programming process.
Project 3 due 12/5/05.
Pair programming for Project 3. Please read to find your assignment and learn about the pair programming process.

Lectures

Lecture 1: Introduction
Lecture 2: Fundamentals
Lecture 3: Sorting Introduction
Lecture 4: Cache Performance of Algorithms
Lecture 5: Pointers and Lists
Lecture 6: Trees
Lecture 7: AVL Trees
Lecture 8: Splay Trees
Lecture 9: K-D Trees and Quad Trees
Lecture 10: B-Trees
Lecture 11: Binary Heaps
Lecture 12: Binomial Queues
Lecture 13: Graph Algorithms, Graph Search
Lecture 14: Disjoint Union / Find
Lecture 15: Hashing
Lecture 16: Sorting Lower Bound, Radix Sort
Lecture 17: NP-completeness
Lecture 18: Minimum Spanning Tree
Lecture 19: Dictionaries for Data Compression

Mailing Lists

To sign yourself up for the class mailing list to receive e-mail from the instructors, visit the following link: cse326
To sign yourself up for the class discussion list, visit the following link: cse326-open

Exams

Collaboration Policy

For homework assignments, you are encouraged to brainstorm with other students as long as everyone is working towards a solution. Simply giving answers is not acceptable. All write ups must be done individually. If two solutions are so similar that they must have been written together then we will view that as inappropriate collaboration. Projects are to be done in pairs, with a common write up. For more details see the Academic Misconduct web page.

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to iansimon]