| Main Page | Syllabus | Textbook | Handouts | Assignments | Computing |
Description: In this class we'll be studying a number of fundamental data structures and algorithms used in computer programming. An emphasis will be placed on data structures and algorithms that are of practical value, though more esoteric ones will also be considered. Students will analyze each concept covered in the course to understand its strengths and weaknesses, and to understand applications for which it would be appropriate. By the end of the course, students should have the skills necessary for selecting between existing data structures and algorithms, and for designing their own.
Text: Mark Allen Weiss' Data Structures and Algorithm Analysis in C (second edition), Addison-Wesley (1997)
Staff (cse373-staff@cs.washington.edu):
| Brad Chamberlain, instructor | (brad@cs.washington.edu) |
(O: W 3:30 Sieg 226c, L: Th 2:00) | |
| Maria Gullickson, TA | (maria@cs.washington.edu) |
(O: T 1:00 Sieg 226a, L: W 1:30) | |
| Liang Sun, TA | (sunliang@cs.washington.edu) |
Lecture: MWF 2:30-3:20 : EE1, room 125
Week at-a-glance:
| Monday | Tuesday | Wednesday | Thursday | Friday | ||
|---|---|---|---|---|---|---|
| 12:30 | ||||||
| 1:00 | Office Hours (Maria) | |||||
| 1:30 | Sieg Hall 226a | Lab Hours (Maria) | ||||
| 2:00 | Thomson Hall 9 | Lab Hours (Brad) | ||||
| 2:30 | Lecture | Lecture | Thomson Hall 9 | Lecture | ||
| 3:00 | EE1-125 | EE1-125 | EE1-125 | |||
| 3:30 | Office Hours (Brad) | |||||
| 4:00 | Sieg Hall 226c |
Computing Resouces:
| MSCC UNIX Lab |
| Personal Computers |
Evaluation:
| Assignments | 50% | |
| Midterm | 20% | |
| Final Exam | 30% |
Assignments:
Important Dates:
| Midterm | Wednesday, May 5th (in class) | |
| Memorial Day | Monday, May 31st | |
| Final Exam | Tuesday, June 8th, 2:30-4:20 |
Rough Course Schedule:
| week of ... |     | topic |
| March 29 | asymptotic analysis, recursion, background | |
| April 5 | lists, stacks, queues | |
| April 12 | trees | |
| April 19 | hashing | |
| April 26 | heaps | |
| May 3 | sorting | |
| May 10 | disjoint sets | |
| May 17 | graphs | |
| May 24 | algorithm design | |
| May 31 | wrap-up, miscellaneous |