Lecture Slides | |
CSE 373: Data Structures and Algorithms
The University of Washington, Seattle, Autumn 2008 | |
Slides will be posted as the quarter progresses. | |
Introduction | |
Math Review | |
Discrete Mathematics Background | |
Asymptotic Analysis Solutions to worksheet on Big-O analysis | |
Example of Proof by Induction | |
Abstract Data Types | |
Binary Search Trees | |
AVL Trees | |
Memory Hierarchy and B-Trees | |
Hashing | |
Priority Queues and Binary Heaps | |
Sorting | |
Disjoint Sets and Dynamic Equivalence Relations | |
Graphs: Definitions and Representations | |
Graphs: Traversals and Shortest Path Algorithms | |
Graphs: More on Shortest Paths, Plus Minimum Spanning Trees | |
Image Data Structures, Operators, and Algorithms |