Guidelines | HW Questions on |
Homework is from the text unless otherwise stated. Homework is due at the beginning of class on the assigned day.
It is very important to stay current in this class and these assignments are selected to help you do so.
Communicating clearly and concisely what you have to say is an important skill you will use throughout your career. All assignments are to be neat and professional. If you cannot clearly communicate something, there is a good chance that you do not yet understand it well.
Assignments will be graded on accuracy, completeness and clarity. Good writing, grammar, punctuation, etc. are extremely important because of the great effect they have on the impact of your work.
Assignment |
Chapter |
Problems |
|---|---|---|
| 1 | 1 | Complexity |
| 2 | 1 | 1.7, 1.25, solve 221 mod 18 using the algorithm of Fig. 1.4; show a table with all variable values at each call level. |
| 3 | 1 | 1.18, 1.20, 1.27 |
| 4 | 2 | 2.4, 2.5(a-e, only find bounds using the master theorem), 2.17 |
| 5 | 2 | 2.19, 2.23 |
| 6 | 3 | 3.1, 3.2 (Show DFS forest and all edges in forest) |
| 7 | 3 | 3.3, 3.4 |
| 8 | 4 | 4.1 |
| 9 | 4 | 4.2 (for consistency, use distances from the previous column, remember to start from node S) |
| 10 | 5 | 5.2 (for b do not use path compression, and if there is a tie in rank when doing union, make the first alphabetical node the root) |
| 11 | 5 | 5.13, 5.14 |
| 12 | 5 | 5.26, 5.28 |
| 13 | 6 | 6.1 |
| 14 | 6 | Gene and Knapsack |
| 15 | 6 | Chain Matrix and All Paths |
| 16 | 7 | 7.1, 7.3 |
| 17 | 7 | 7.11, 7.13 |
| 18 | 7 | Linear Programming and Simplex |
| 19 | 9 | B&B TSP1 |
| 20 | 8 | B&B TSP2 |
| 21 | 9 | Local Search |