Course Notes - CS 161 - Design and Analysis of Algorithms
The following documents outline the notes for the course CS 161
Design and Analysis of Algorithms.
Note: All the notes are in PDF format.
Viewing these files requires the use of a
Notes by Lecture Schedule
Introduction. Growth of functions.
The greedy method.
Dynamic programming, continued. Graphs.
Graph algorithms. Depth-first search.
Minimum Spanning Trees.
Fast Fourier Transform (FFT).
Michael T. Goodrich
Department of Computer Science
University of California, Irvine, CA 92697-3435 USA