Retro school children University of Washington Department of Computer Science & Engineering
 CSE 373 Lecture slides
  CSE Home  About Us    Search    Contact Info 

 Main page
Administration
 Syllabus
 Workload and Grading
 Instructor and TAs
 Lectures
 Email archive
Assignments and exams
 Assignments
 Exam info
    Slides from lecture 1: Introduction
Slides from lecture 2: Review
Slides from lecture 3: Asymptotic Analysis
Slides from lecture 4: Lists, Stacks, Queues
Slides from lecture 5: Trees, Binary Search Trees, AVL Trees
Slides from lecture 6: Hash Tables
Slides from lecture 7: Heaps and Priority Queues
(No new slides for lecture 8)
Slides from lecture 9: B-trees
Slides from lecture 10: Sorting I
Slides from lecture 11: Sorting II
(No new slides for lecture 12)
Slides from lecture 13: Disjoint Sets (Union/Find)
(No new slides for lecture 14)
Slides from lecture 15: Midterm Review
(No lecture on 5/1, midterm date.)
Slides from lecture 17: Graphs
(No new slides for lectures 18, 19, 20, 21.)
Slides from lecture 22: Splay Trees and Amortized Analysis
(No new slides for lecture 23
(No class 5/19--no lecture 24.)
Slides from lecture 25: Algorithmic Techniques
(No class 5/24--Pete was sick.)
(No new slides for lecture 27.)
(No class 5/29--Memorial Day.)
(No new slides for lecture 29.)
Slides from lecture 30: Final Review

You'll need the Acrobat reader to view these files. If for some reason your PC isn't set up for this, get it at Adobe's website.

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