CSE 326:
Data Structures

Autumn 1997

Richard Karp


Have happy holidays and a relaxing break!


Table of Contents


General Information

Schedule

Contact Information

Office Office Hours Email Address
Richard Karp, Instructor Sieg 315 Wed., 3:30-4:30
Thu., 11:00-12:00
karp@cs.washington.edu
Dan Fasulo, TA Sieg 326A Mon., 11:30-12:30
Fri., 10:30-11:30
dfasulo@cs.washington.edu

Text

Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Benjamin/Cummings (1994).

Evaluation

There will be approximately five problem sets and three C++ programming assignments. You are encouraged to discuss the problem sets and programming assignments with other students, but must write your own programs and problem solutions. Grading will be weighted as follows:

Problem Sets20%
Programming assignments20%
Midterm Examination20%
Final Examination40%


Anticipated Topics

  • Chapter 2, Algorithm Analysis
  • Chapter 3, Lists, Stacks and Queues
  • Chapter 4, Trees
  • Chapter 5, Hashing
  • Chapter 6, Priority Queues (Heaps)
  • Chapter 7, Sorting
  • Chapter 8, The Disjoint Set ADT
  • Chapter 9, Graph Algorithms
  • Chapter 11, Amortized Analysis

Helpful Material


Maintained by:
dfasulo@cs.washington.edu
(Last Update: )