CS4321 - Introduction to Algorithms: Homework Assignment 5

1. Exercise 9.3 Question 2 (page 327): Dijkstra's example

2. Exercise 9.3 Question 8 (page 327): Longest path

3. Exercise 10.2 Question 2 (page 362): Maximum flow example

4. Exercise 10.2 Question 5 (page 362): Maximum flow in a Tree

5. Exercise 10.3 Question 2 (page 370): Matching example

6. Exercise 11.1 Question 1 (page 385): Alternating disk problem complexity

7. Exercise 11.1 Question 3 (page 385): Lower bounds

8. Exercise 11.1 Question 7 (page 386): Adversary argument proof

9. Exercise 11.2 Question 9 (page 386): Tournament tree