CSE 5311
is the advanced course in algorithms. This page
provides access to documents and code for the course.
Documents
- Summer 2004 Syllabus
PDF, doc
- Notes 1 - Mathematical Preliminaries
PDF, doc (updated 05/29/04)
- Notes 2 - Binary Search Trees
PDF, doc (reviewed 05/22/04)
- Notes 3 - Amortized Analysis
PDF, doc (reviewed 05/22/04)
- Notes 4 - Self-Organizing Linear Search
PDF, doc (updated 05/22/04)
- Notes 5 - Trees and Notes 6 - Skip Lists
PDF, doc (updated 06/08/04)
- Notes 7 - Priority Queues
PDF, doc (updated 06/12/04)
- Notes 8 - Disjoint Sets and Notes 9 - Hashing
PDF, doc (update 06/18/04)
- Notes 10 - Medians/Selection and Notes 11 - Minimum Spanning Trees
PDF, doc
- Notes 12 - Network Flows
PDF, doc
- Notes 13 - Depth-First Search
PDF, doc
- Notes 14 - Stable Marriages
PDF, doc
- Notes 15 - Sequences
PDF, doc
- Notes 16 - Matrices and Notes 17 - Computational Geometry
PDF, doc
- Notes 18 - NP-Completeness
PDF, doc
Handouts
Programming Assignments
- Programming Assignment 1
PDF, doc
Code
Links
Last Updated: 06/21/04