LECTURE NOTES FOR CPT S 223^*

Course overview (PDF)

Introduction (PDF)

Math review (PDF)

Tail recursion (HTML)

C++ review (PDF)

Abstract data types (PDF)

Algorithmic analysis (PDF)

Trees (PDF)

Midterm I review (PDF)

Priority queues (PDF) 

    - BuildHeap() Run-time Analysis (PDF)

    - Binomail Heap Insert Amortized Run-time Analysis (PDF)

Hashing (PDF)

Disjoint sets (PDF)

Midterm II review (PDF)

Sorting (PDF)

Graph algorithms introduction (PDF)

Finals Review (PDF)

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