CSE logo University of Washington Department of Computer Science & Engineering
 CSE 373 Syllabus
  CSE Home  About Us    Search    Contact Info 

 Main page
Administration
 Syllabus
 Workload and Grading
 Instructor and TAs
 Lectures
 Email archive
 Accommodations
Assignments and exams
 Assignments
 Exams
 Policies
    We will be using the following textbook:

Data Structures and Algorithm Analysis in C
Mark Allen Weiss
2nd ed, 1997
Addison-Wesley, ISBN 0-201-49840-5
Errata

C source code for examples in the textbook

We'll be covering material from chapters 1-7, plus selected topics from the remainder of the text.

Specific topics include:

  • Algorithm Analysis
  • Lists, Stacks, Queues
  • Trees
  • Heaps and Priority Queues
  • Hash Tables
  • Sorting Algorithms
  • Union-Find Algorithms
  • Graphs and Shortest Path Algorithms
  • More as time permits

    Note: Although you may have encountered some of these topics in CSE 143, the treatment of these topics in this course will be much more rigorous and in-depth.

    It's important that you join the class email list. Important announcements and clarifications will be sent using email. To join, send a message to majordomo@cs.washington.edu, and include the following in the body of your message:

    subscribe cse373

    You should get a response quickly that you have been added.

    		•

    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 rao@cs.washington.edu]