A10-Card Games Redux

On This Page Overview Program Specifications Extra Credit Grading Criteria (20) What to Turn In Overview The main points of this assignment are to: Implement an equals() method Use a linked list ^ top Program Specifications Update the equals() method of the Card class from assignment 6 using the techniques discussed in lesson 7.2.4. There is no need to update the hashCode() method Update the Deck class from assignment 6 to use a LinkedList of Card objects rather than an array. Use the LinkedList<type> implementation from the Java Collections Framework. Before you start, verify that your Deck class from assignment 6 is working correctly. If you had points deducted for your assignment 6 solution, you may either correct your solution to meet assignment 6 specifications or use the instructor's solution, which is posted in Blackboard. Also, if you implemented the extra credit sort() method, you may remove the implementation rather than updating the method. Your updated Deck class must still pass all the tests of the Test Cases from the DeckTester class of assignment 6. Do NOT make any changes to the DeckTester class. You must document and organize your code following the requirements in the How To Document and Organize Java Code. Your program must pass CheckStyle configured with the grade_checks.xml for full credit. Note that the CTC has this configured on their computers and that I have instructions for setting up TextPad to use CheckStyle. Do not use any package statements. Make an executable JAR of your program containing all the files described in the section of this document: What to Turn In. ^ top Extra Credit The following are worth extra credit points: Create and submit a second deck class, named Deck2, that uses an ArrayList rather than a LinkedList. (1 point) Explore running times by writing a test class named DeskSpeedTester that measures the speed differences between a LinkedList and ArrayList implementation of the bubbleSort() method. Use the System.nanoTime() method to measure execution times. Then write a short report in your README.txt file listing the differences between the two implementations and a brief explanation of why the times are different. Hint: read the textbook about Running Times and Big-O Notation starting on page 843. (2 points) Make certain that your README.txt file lists any extra credit attempted. ^ top Grading Criteria The instructor will evaluate your assignment using the following criteria. Each criteria represents a specific achievement of your assignment and has a scoring guide. The scoring guide explains the possible scores you can receive. Some scoring guides have a list of indicators. These indicators are a sign of meeting, or a symptom of not meeting, the specific criterion. Note that a single indicator may not always be reliable or appropriate in a given context. However, as a group, they show the condition of meeting the criterion. For information on grading policies, including interpretation of scores, see the course information page. Program Compilation 4: Source code compiles with no errors or warnings 0: Does not compile Functionality 10: Demonstrates mastery of the assignment Has extra features or demonstrates techniques beyond the assignment Applies concepts from the lessons appropriately Meets all specifications (see above) with particularly elegant solutions Runs to completion with no abnormal error conditions Generates correct output given correct input Behaves in a reasonable way in response to incorrect data 8: Has all the functionality expected of the assignment Demonstrates many techniques from the lesson Meets all specifications (see above) Implementation seems more complicated than necessary. May have one minor error 6: Has most of the functionality expected of the assignment Demonstrates some techniques from the lesson Meets all but one of the specifications (see above) Implementation seems excessively complicated. May have 2-3 minor errors 4: Has some of the functionality expected of the assignment Demonstrates some techniques from the lesson Meets at least 1/2 of the specifications (see above) Implementation seems excessively complicated. May have more than 3 minor errors 2: Serious functional problems but shows some effort and understanding Meets less than 1/2 of the of the specifications (see above) Has a major error or many minor errors Implementation seems very convoluted Demonstrates few techniques from the lesson 0: Does not execute Program Style 4: Code is well-documented As described in How To Document and Organize Java Code 3: Code has minor documentation errors Has 1 documentation error 2: Code has some documentation errors Has 2-3 documentation errors 1: Code has many documentation errors Has more than 3 documentation errors 0: No apparent attempt to document code README.txt File 2: README.txt file submitted with specified information included 1: README.txt submitted but some information was not included 0: No README.txt submitted Maximum Score: 20, plus extra credit ^ top What to Turn In Submit your assignment following the instructions for homework. Include the following items for grading: README.txt file All Java source code and class files in a single executable JAR file You must submit all the files needed for your assignment to compile and work correctly. Do not assume that the instructors has any files. Also, do not turn in files that are not part of your assignment, especially ones that do not compile. Your assignment must compile after removing all the .class files and running: javac *.java. In addition, your code must work as submitted. Home | Blackboard | Announcements | Schedule | Room Policies | Course Info Help | FAQ's | HowTo's | Links Last Updated: November 30 2008 @19:01:40