CS270 Fall 2001, Final Review Session Notes:
--------------------------------------------
Professor: Satish Rao
Scribe: Hassan Rasti
--------------------------------------------

The following topics are relevant for the final, but the final exam
material is not limited to the below:

1) DATA STRUCTURES
	See Problem Set 1

2) DYNAMIC PROGRAMMING/SHORTEST PATHS
	Relaxation Algorithms
	Dijkstra's Algorithm
	Bellman-Ford
		Applications

	(Examples: "What does Dijkstra's do on a weighted graph?"
		   "How fast will Bellman-Ford run on a graph with only
			one negative edge?"
		   "Can you create a better algorithm for handling this
			case?")

3) MAX-FLOW/MIN CUT
	Augmenting Paths
	Blocking Flow Definition
	Unit Capacity Graphs

4) FINGER PRINTING
	Polynomial Equivalence
	Randomized Pattern Matching
		(Compute finger print of pattern + incrementally compute
		fingerprints as you test)
	File Equivalence

5) CHERNOFF BOUNDS/BALLS IN BINS
	Know what the max-loads are in different situations.
	(Ex. Max load of n balls in n bins ==> logn)

6) LINEAR  PROGRAMMING/SIMPLEX ALGORITHM
	Write linear programs for various problems
		(shortest path, flow problems, generalization)
	Know the Simplex Algorithm
	Ellipsoid Algorithm (Held-Karp, # of constraints is exponential
				so given a solution we find a violated
				constraint)

7) CODES
	Know:
		Shannon's Result
		"Hamming"-type results
			min. distance between codewords
			Gilbert-Varshonov
		(Codewords are nodes in a hyper-cube)

8) APPROXIMATION ALGORITHMS
	Set Cover (greedy algorithm)
	Vertex Cover (maximal matching)
	TSP

9) NEAREST NEIGHBOR (probably not covered)
	Curse of dimensionality
	Know why it gets hard in high dimensions

ALSO...
Anything else that was covered on the problem sets.

Randomized Min-Cut

Randomized Tools (applying Chernoff Bounds, counting, expectation)

** Make sure to be in class Thursday! **