Course Notes - CS 161 - Design and Analysis of Algorithms
The following documents outline the notes and lecture slides
for the course CS 161 Design and Analysis of Algorithms.
Notes by Lecture Schedule
- 1:
Introduction. Review.
-
2:
Data Structures.
-
3:
Sorting and Selection.
-
4:
The greedy method.
-
5:
Divide-and-conquer.
-
6:
Dynamic programming.
-
7:
No lectures (exam and holiday).
-
8:
Graph algorithms.
-
9:
Minimum Spanning Trees.
-
10:
Network flow.
Michael T. Goodrich
Department of Computer Science
University of California, Irvine, CA 92697-3435 USA