Submission procedures. (They are the same as for Dr. Dobbins's CSCE 146 sections.) This link also leads to solutions to most of the programming assignments, after they are turned in.
1. The Statistician Class. This is Programming Project 2 on p.89 of the text, due on February 8. See Dr.Michael Main's web page describing the assignment . That page includes links to stubs that you must use in carrying out your assignment. See for a test program (still to be provided, at the time I am writing this).
1. The Statistician Class: Solution. Grading rules for this assignment: compiles cleanly: 10%; runs cleanly: 10%; private variables and constructor: 4%; addAll method: 12%; clear method: 4%; equals method: 12%; length method: 4%; maximum method: 4%; mean method: 8%; minimum method: 4%; next method: 12%; sum method: 4%; union method: 12% (of which 4% for correct use of RuntimeException).
2. The DoubleArraySeq Class. Find local versions here for: javadoc, source code, and a test program. This assignment is identical to the one used in Dr. Dobbins's sections. It is due on March 1, 2001.
2. DoubleArraySeq Class: Solution and Grading Rules . Grading rules for this assignment: compiles cleanly: 10%; runs cleanly: 10%; private variables and constructors: 10%; addBefore method: 8%; addAfter method: 7%; each other method: 5%.
3. The DoubleLinkedSeq Class. Complete the design and implementation of the DoubleLinkedSeq class described in Section 4.5 of your textbook. This assignment is due on Thursday, March 22. Find a test program here.
3. DoubleLinkedSeq Class: Grading Rules . Grading rules for this assignment: compiles cleanly: 10%; runs cleanly: 10%; private variables and constructors: 10%; addBefore method: 10%; addAfter method: 10%; advance method: 7%; concat method: 7%; addAll method:7%; each other method: 5%.
4. The n-Queens Problem This is programming project 10 on p.323 of the textbook. Also see Dr. Michael Main's web site for a PowerPoint presentation of this problem and its solution using backtracking with a stack. Here is a solution , written by Jonathan Tillman.
5. Expression Trees and Flip The first part of this programming project is programming project 1 on p.479 of the textbook. The second part is a program to flip a binary tree. Specifications are given here. Note that the build method is only required to build the one tree described in the specifications. The evaluate method, on the other hand, is required to work with general expression trees. This assignment is due by 4:30pm on Thursday, May 3 in room Sumwalt 206. There will be a box marked CSCE 146 Programming Assignment 5 (Dr. Valtorta).