HW 1 --- Due on Thursday January 29.
HW 2 --- Due on Thursday February 12.
Provided Point class Point.java for Java and
point.h, point.cc,
and stdinc.h for C++.
Test data for Problem 5.
HW 3 --- Due on Thursday February 26.Here is the input and output from the exam. You can use this for debugging purposes. Notice that the input has been annotated to explain it. You should remove this annotation when using it. Also, feel free to organize the data in whatever form you find easiest to work with.
Here is the test data for homework 3.
HW 4 --- Due on Thursday March 19.Problems available for grading are to be announced. The grading session is at 7:00pm on the evening of March 19.
Don't forget to consult the frequently asked questions page.
HW 5 --- Due on Thursday April 9.Here is the test data for homework 5. There are 14 elements in the array (i.e. n=14) and you are trying to find a subset that comes as close to 526 as possible (i.e. t=526).
You MUST submit your code and output for this data for epsilon = .2, for epsilon = .1, and for epsilon = .01 (each clearly labeled).
Feel free to format this in a different way if you wish. For example if you are using Scheme/Lisp you might input the data using:
(setq l '(130 111 233 403 53 157 37 199 478 89 287 340 386 313))
and then just send n (14), t (526) and epsilon as parameters.
You MUST submit your output for this data with all three values for epsilon with your code. Your output can either be the entire list you are maintaining or just the largest element of the final list. Of course, I would suggest you use a smaller data set for debugging.
HW 6 --- Due on Thursday April 23.