1. Problem 22-2 e, f, g and h (finding bridges)
2. Problem 22-3 (finding Euler tour)
3. Exercise 23.1-11 (mst when an edge weight is decremented)
4. Problem 23-1 (second best mst)
5. Describe an algorithm to insert an element into a heap using O(log log n) comparisons. How many moves does it make?
6. Problem 17-2 from CLRS (making binary search dynamic)
7. Problem 21-1 from CLRS (offline minimum)
8. Problem 21-3 from CLRS (offline lca)