CSE 326: Data Structures and Algorithms

CSE Home

About Us

Search

Contact Info

Main page Administration  Syllabus  Workload and Grading  Instructor and TAs  Lectures AA/B BA/B  Email archive  Accommodations Assignments and exams  Assignments  Exams  Policies Resources  Tutorials  Demos

Welcome to CSE 326 (Winter 2003) Sections AA and AB: Rajesh Rao with Vassily Litvinov and Christophe Bisciglia MWF 12:30-13:20 in EE1 045 Sections BA and BB: Dan Suciu with Nilesh Dalvi and Adam Fuchs MWF 13:30-14:20 in MGH 231 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: 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 E E 374 These web pages will be updated throughout the quarter. Be sure to join the class mailing list and check the email archive. To join, go to this page. Announcements will be posted in the space below. Clarifications/Hints added to Homework 3. (1/18/03) The electronic turnin instructions for the homeworks are now available. (They are also linked from the bottom of the Assignment 2 webpage.) Hints added to Homework 1. (1/18/03) Sign up for the cse326 email list. Some important announcements will be sent to the list. Instructions on how to join are new as of 1/6/03. Check the tutorials page for help with assignment 1.

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