LECTURE NOTES FOR CPT S 223

^{Lecture slides will be updated through the course of the entire semester. So always download the latest version before use.}

Course overview (PDF  PPT)

Introduction (PDF  PPT)

Math review (PDF  PPT)

Tail recursion (HTML)

C++ review (PDF )

Abstract data types (PDF  PPT)

Algorithmic analysis (PDF   PPT)

Trees (PDF  PPT)

Midterm I review (PDF)

Priority queues (PDF  PPT) 

    - BuildHeap() Run-time Analysis (PDF)

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

Hashing (PDF  PPT)

Disjoint sets (PDF  PPT)

Sorting (PDF, PPT)

Midterm II review (PDF)

Specialized data structures (strings and spatial) (PDF, PPT)

Graph algorithms introduction (PDF)

Finding shortest paths in graphs (PDF, PPT)

Finals Review (PDF, PPT)

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