Lectures: MWF 2:30-3:20 EE1 125
Section AA: Thurs 12:30-1:20 LOW 112
Section AB: Thurs 1:30-2:20 LOW 112
Midterm: Nov 1 (tentative date)
Final: Dec 11
Henry Kautz, Instructor
(206) 543-1896 Tues 2:30-3:30
Alexander Mohr, TA
Office hours held in Sieg 226b
Textbook: M.A. Weis, Data Structures & Algorithms
(2nd edition, 1999, ISBN: 0-201-36122-1)
We will be covering all of chapters 1-8 and parts of 9, 10, and 11.
Course Home Page: http://www.cs.washington.edu/education/courses/326/00au/
See links from Home Page for instructions on registering for course email.
Programming will be done on the CSE lab machines using Unix and g++. See links from the home page for laboratory information.
Purpose of course: Fundamental abstract data types and their implementations as data structures. Asymptotic analyses of algorithms involving these data structures. Specific topics include:
- algorithm analysis
- linked lists
- trees and traversals
- binary search trees
- balanced trees (AVL and Splay)
- priority queues and heaps
- disjoint union-find
- Weekly written homework due at the start of class on due date (usually a Friday). 10% penalty for homework turned in by 10:30 am the next week day. Afterward, NO late homework accepted. Homework can be typed or clearly handwritten.
- Four programming projects. Projects turned in electronically before 11pm on due date (usually a Monday). 10% penalty for projects that are 1 weekday late; afterward, NOT accepted.
- Work in teams only on explicit team projects as specified on the particular assignment. If the assignment does not mention teams, then you should work out the solutions to each problem yourself. General discussions with other sutdents about course topics are encouraged. If you have questions about whether some kind of joint work with your fellow students is permissible talk to the instructor or TA, and read the College of Engineering Policy on Academic Misconduct: