1. Exercise 5.1 Question 1 (page 163): Ferrying soldiers
2. Exercise 5.2 Question 2 (page 171): Time efficiency for DFS on sparse graphs
3. Exercise 5.2 Question 8 (page 171) Clearly describe verbally (no pseudo code necessary): Identifying bipartite graphs
4. Exercise 5.4 Question 2 (a and b only) (page 181): Permutations
5. Exercise 5.6 Question 3 (page 194): Selection pseudo code
6. Exercise 6.1 Question 2 (page 201): Closest pair of number in sorted array
7. Exercise 6.1 Question 4 (page 202): Max and min efficiencies
8. Exercise 6.4 Question 5 (page 230): Look ups in a heap
9. Exercise 6.6 Question 10 (page 246): Post office location
10. Exercise 7.2 Question 1 (page 264): Example Horspool
11. Exercise 7.2 Question 7 (page 264)