CMPS201 Slides -- Fall 07

QuickSort (pdf)      

Decision Trees (pdf)      

Linear Sorting (pdf)      

Selection (pdf)      

Adversary arguments (pdf)      

Binary Search Trees (pdf)      

Red Black Trees (pdf)      

Binomial Heaps (pdf)      

Fibonacci Heaps (pdf)      

Amortisation and Fibonacci Heaps (pdf)      

Disjoint Sets (pdf)      

NP-completeness Part 1 - Definitions (pdf)      

NP-completeness Part 2 - Reductions (pdf)      

NP-completeness Part 3 - P vs NP (pdf)      

Dynamic Programming (pdf)      

Greedy Method (pdf)      

Matroids (pdf)      


The CMPS201 Web:
Copyright 2007; Department of Computer Engineering, University of California, Santa Cruz.
Comments to: martine@cse.ucsc.edu