Homework #

Due Date

Files to Download

Description

1

January 28 (F) by 3 PM (in CS or my office)

Chapter 1 Exercises: 2, 6, 10 (only applied to 2 and 6), 12, 25, 26, 27, 30

.pdf of these exercises

HW 1 Solution (.pdf)

2

February 10 (Th) by 3 PM

Chapter 2 Exercises: 2, 7 (pgm and analyze), 8, 16, 19, 24, 40 (pgm and analyze)

Extra Credit: 45 (pgm and analyze)

.pdf of these exercises

HW 2 Solution (.pdf)

3

March 1 (T) by 3 PM

Chapter 3 Exercises: 5, 22, 26 (program not needed-algorithm only), 28, 29/30 (write a program to handle a limited size n, say n = 32)

.pdf of these exercises

HW 3 Solution (.pdf)

4

March 29 (T) by 11:59 PM

Chapter 4 Exercises: 2, 13, 36 (program not needed – algorithm, analysis, and example), 37 (write a program and run with data indicated), and 46 (write program and run on data that indicated sub-optimal results)

.pdf of these exercises

HW 4 Solution (.pdf)

5

April 19 (T) by 5 PM

(new and improved)

Chapter 5 Exercises: 13 (trace by showing the state-space tree), 15 (my program is on-line), 33 (trace by showing the state-space tree), 43 (write a program -tsp problem???)

.pdf of these exercises

HW 5 Solution (.pdf)

6

(last HW)

April 29 (F) by 5 PM

Chapter 6 Exercises: 4 (trace by showing the state-space tree), 5 (write best-first branch-and-Bound program and run on exercise 1 problem instance), 7 (trace by showing the state-space tree), 11 (write best-first branch-and-Bound program and run on exercise 7 problem instance)

Chapter 7 Exercises: 40 (write program – time performaces of best, average, and worst cases), 41 (argue best-case time complexity)

.pdf of these exercises

HW 6 Solution (.pdf)