CPS 230

Summary of Lecture Topics and List of Material

(Each topic does not correspond necessarily to a single class.)

*"" means "if time allows"**	*Topics*	*Readings* (from [CLRS] unless otherwise noted)	*Lecture Notes*
0	Introduction: Recurrences	1, 2, [GKP, 1.1-1.2]	ps pdf
1	*Mathematical foundations:* Growth of functions, summations	3, Appendix A, [GKP, 2.5 and asymptotic expansions]	ps pdf
2	Mathematical foundations: Recurrences, Strassen's algorithm, Master method for recurrences	4.0-4.2, (4.3-4.4, but read lecture notes instead) 28.1-28.2	ps pdf
3	*Randomized and Average-Case Analysis*	Appendix C.2-C.3	-
4	Sorting: Quicksort	7	ps pdf
5	Sorting: Linear time selection, median lower bound	9, [Baase, 3.4]	ps pdf
6	Sorting: Lower bound in decision tree model, bucket and radix sort	8.0-8.3	ps pdf
7*	*Fast Fourier Transform*	30	-
8	Searching: Search trees, red-black trees	10, 12.0-12.3, (13, but read lecture notes instead)	ps pdf
9	Searching: Augmented search trees, interval trees	14, [deBerg, 10.1]	ps pdf
10	Searching: Hashing, skip lists	5.0-5.2, 5.4.1, 8.4 11, [GT, 7.5]	ps pdf
11	Design paradigms: Dynamic programming Matrix chain multiplication	15.0-15.2	ps pdf
12	Design paradigms: Greedy algorithms Huffman codes, activity selection	16.0-16.3	ps pdf
13	Amortized analysis: Agregate analysis, potential method, binary counter, dynamic table	17	ps pdf
14	Amortized analysis: Splay trees	[Kozen, 12]	ps pdf
15	Priority Queues: Heaps and heapsort	6	ps pdf
16*	Priority Queues: Binomial queues and Fibonnaci heaps	19, 20	-
17	External memory algorithms: model, basic upper and lower bounds, sorting, B-trees	[AV], [Vitter], 18	ps pdf
18	Graph algorithms: Model, basic algorithms, DFS, BFS, topological sort, strongly connected components	Appendix B.4-B.5, 22	ps pdf
19	Graph algorithms: Minimum spanning trees, Union-Find	23, 21.0-21.3	ps pdf
20	Graph algorithms: Shortest paths	24.0-24.3, 25.2	ps pdf
21*	Graph Algorithms: Maximum flow	26.0-26.2	ps pdf
22*	Linear programming: Simplex method	29	-
23	*Complexity*	34	ps pdf
23bis	*NP-Completness*	34	ps pdf
24	*Approximation Algorithms*	35.0-35.3	ps pdf
	*Review*		ps pdf

Course textbook:

Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms, McGraw Hill, second edition, 2001. Be sure to get the second edition!

Other references made available:

[AV] Alok Aggarwal and Jeffrey Scott Vitter, "The Input/Output Complexity of Sorting and Related Problems", ps pdf, Communications of the ACM, September 1988.
[Baase] Sara Baase. Computer Algorithms, Introduction to Design and Analysis.
[GKP] Ron Graham, Donald Knuth, and Oren Patashnik. Concrete Mathematics.
[GT] Michael. T. Goodrich and Roberto Tamassia. Data Structures and Algorithms in Java,.
[Kozen] Dexter C. Kozen. The Design and Analysis of Algorithms.
[Vitter] Jeffrey Scott Vitter, "External Memory Algorithms and Data Structures: Dealing with MASSIVE Data", ps pdf, to appear in ACM Computing Surveys.

Last modified: Mon Nov 26 10:24:54 EST 2001

Jeff Vitter / Duke University / jsv @ cs.duke.edu