I have looked at my solution. Here is a rough estimate as to the time I think it would take you to complete the similar assignment (these lines of code INCLUDES documentation):
| Lines of Code | Class | Comments | Time (HH:MM) |
| 85 | Problem1 | 1:30 | |
| 448 | Set of classes for Problem2 | Try to model the information using helper classes. These can then be used to instantiate objects used as Values within a Hashtable. | 5:00 |
| 0 | Problem3 | ||
| Problem4 | I haven't written this yet. But try to identify the many cases that are relevant. Don't focus on the # of lines of code but seek out all cases that are going to be important. | 2:30 | |
| 9:00 |
The TA/SAs grading your assignments will be using this form to tally your results. This will clearly explain to you what is being expected of you.
| Question | Points | Actual | Description | Notes |
| 1. 25 pts. |
+4 | Proper Javadoc Documentation throughout | ||
| +4 | Design helper static method in Problem1 to compute Saddle Point from array or Design separate class with static method to compute Saddle Point from array. | |||
| +3 | Has student answered question regarding likelihood of saddle points in rectangular arrays vs. square ones | |||
| +4 | Properly functioning code to generate random arrays (whether square or rectangular) | |||
| +5 | Proper execution of 10,000 trials | |||
| +4 | Proper format and values for output in 1a | |||
| +4 | Proper format and values for output in 1b | |||
| 2. 30 pts. |
+4 | Proper Javadoc documentation throughout | ||
| +4 | Design of a class to represent the information for a specific Security | |||
| +3 | Proper use of a Hashtable to store Security Information | |||
| +4 | Proper use of an ArrayList to store the information read from the securities.dat file; | |||
| +8 | Proper calculations of the Security information over the aggregate period (low, high, close, open) -- 2 points each | |||
| +5 | Proper Calculation of Sector aggregate information | |||
| +2 | Proper formatting for output results | |||
| 3. 20 pts. |
+2 | D1. 2 points for each Defect found | ||
| +2 | D2. | |||
| +2 | D3. | |||
| +2 | D4. | |||
| +2 | D5. | |||
| +2 | D6. | |||
| +2 | D7. | |||
| +2 | D8. | |||
| +2 | D9. | |||
| +2 | D10. | |||
| 4. 25 pts. |
+4 | Proper Javadoc Documentation throughout; yes I know these are test cases, but we have now begun documenting these carefully, too. | ||
| +6 | Sufficient test cases for COINCIDENT | |||
| +6 | Sufficient test cases for PARALLEL | |||
| +6 | Sufficient test cases for INTERSECTING | |||
| +3 | Sufficient test cases for Exception cases | |||
| TOTAL 100 pts. |
I expect this will take you between 9 and 11 hours |
To start the coding problems in this assignment, take the following steps:
<userName>.hw6
where <userName> is replaced by your CCC id. For example, if I were submitting
this assignment, I would use "heineman.hw5". When
you request to create a package (using the Eclipse wizard).
© 2006 George T. Heineman