LECTURE NOTES FOR CPT S 223^*

Course overview (PDF)

Introduction (PDF)

Math review (PDF)

C++ review (PDF)

Abstract data types (PDF)

Algorithmic analysis (PDF)

Trees (PDF)

Priority queues (PDF)

Hashing (PDF)

Disjoint sets (PDF)

Sorting (PDF)

Midterm II review (PDF)

Graph algorithms introduction (PDF)

Graph algorithms: shortest path (PDF)

Graph algorithms: minimum spanning tree (PDF)

Specialized data structures (PDF)

Finals Review (PDF)

^{*Acknowledgement: Thanks to Larry Holder (EECS/WSU) for sharing several of these slides.}