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 (PPT PDF )

Abstract data types (PDF  PPT)

Algorithmic analysis (PDF   PPT)

    - Analysis Proof class scribe (PDF)

Trees (PDF  PPT)

   - AVL tree insertion examples by cases (PDF)

Midterm I review (PPT PDF)

Priority queues (PDF  PPT

    - BuildHeap() Run-time Analysis (PDF)

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

Hashing (PDF  PPT)

Midterm II review (PDF)

Disjoint sets, union find data structure (PDF PPT)

Sorting (PDF, PPT)

Finals Review (PDF, PPT)

 

*Acknowledgement: Most of the above lecture slides are modified versions of slides originally designed by Prpf. Larry Holder.