1. Lecture 32 CSE 331 Nov 15, 2010

2. Feedback Forms Link for the survey on the blog

3. HW 7 scores on UBLearns We’ll migrate other scores (slowly) Hw 7 Individual pickups Jeff: Recitations and Wed office hours Alex: Tuesday and Thursday office hours

4. Puzzle For undirected graphs, show that an MST rooted at s, gives all the shortest bottleneck paths from s

5. Divide and Conquer Divide up the problem into at least two sub-problems Recursively solve the sub-problems “Patch up” the solutions to the sub-problems for the final solution

6. Improvements on a smaller scale Greedy algorithms: exponential  poly time (Typical) Divide and Conquer: O(n 2 )  asymptotically smaller running time

7. Multiplying two numbers Given two numbers a and b in binary a=(a n-1,..,a 0 ) and b = (b n-1,…,b 0 ) Compute c = a x b Running time of primary school algorithm?