CSE 373: Data Structures and Algorithms

Autumn 1999

Syllabus


Main Page Syllabus Textbook Handouts Assignments E-mail 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 (1999)

Staff (cse373-staff@cs.washington.edu):
Brad Chamberlain, instructor (brad@cs.washington.edu) (O:W 2-3 Sieg 226c, L:Th 1-2)
A.J. Bernheim Brush, TA (ajb@cs.washington.edu) (O:T 10-11 Sieg 226a, L:Th 11-12)
Sun Liang, TA (sunliang@cs.washington.edu) (O:W 11-12 Sieg 226a, L:T 1-2)


Lecture: MWF 12:30-1:20 : MOR, room 220

Week at-a-glance:
Monday Tuesday Wednesday Thursday Friday
9:30
10:00 Office Hours (AJ)
10:30 Sieg 226a
11:00 Office Hours (Sun Liang) Lab Hours (AJ)
11:30 Sieg 226a MSCC
12:00
12:30 Lecture Lecture Lecture
1:00 MOR 220 Lab Hours (Sun Liang) MOR 220 Lab Hours (Brad) MOR 220
1:30 MSCC MSCC
2:00 Office Hours (Brad)
2:30 Sieg 226c
2:00

Computing Resouces:
MSCC PC Lab
Students' Personal Computers


Evaluation:
Written Assignments 25%
Programming Assignments 25%
Midterm20%
Final Exam30%


Important Dates:
Midterm Wednesday, November 3rd
Veteran's DayThursday, November 11th
ThanksgivingThursday-Friday, November 25th-26th
Final ExamWednesday, December 15th 8:30-10:20am


Approximate Course Schedule:
week of ...   topicreading
Sept 27asymptotic analysis, recursion, background(Chapters 1-2)
Oct 4lists, stacks, queues(Chapter 3)
Oct 11trees(Chapter 4)
Oct 18hash tables(Chapter 5)
Oct 25heaps(Chapter 6)
Nov 1catch-up, midterm
Nov 8sorting(Chapter 7)
Nov 15disjoint sets(Chapter 8)
Nov 22graphs(Chapter 9)
Nov 29graphs(Chapter 9)
Dec 6wrap-up, miscellaneous


Assignments:

 
cse373-staff@cs.washington.edu