CSE 250 – Spring 2009
Data Structures 1,2,3 Grading
Due: March 6
Grader:
Student’s Name:
Total Points possible: 100
You earned:
[A] Implementation of Data Structure
[A1] Implemented the assigned data structure either the circular doubly-linked
list, the binary search tree, stack or queue.
Each data structure had a number of designated functions that needed to be
implemented. The grading will proceed with 2 points being awarded for every
function that was reasonably implemented. If the function was not
implemented, then no points are awarded. 1 point can be awarded for partial
credit if warranted.
For the list this section is worth 24 points.
For the tree this section is worth 22 points.
For the stack this section is worth 22.5 points (2.5 points per function)
For the queue this section is worth 22.5 points (2.5 points per function)
***********************************************************************************
[B] Testing of Data Structure
[B1] Created a testing program for the assigned data structure.
Each data structure had a number of functions that the testing program should
be sure to test thoroughly. Each function that should have been testing will
be awarded 2 points if testing code created was adequate for testing the
function. If the testing was not provided for a certain function, then zero
points should be awarded. 1 point can be awarded for partial credit if
warranted.
For the list this section is worth 24 points.
For the tree this section is worth 22 points.
For the stack this section is worth 22.5 points (2.5 points per function)
For the queue this section is worth 22.5 points (2.5 points per function)
***********************************************************************************
[C] Catch-up points
[C1] Since the data structures did not have an even number of points assigned to
each, this section awards catch-up points so that the total number of points
that the student could possibly earn is 47. These points are automatically
awarded unless parts 1 or 2 are not completed.
***********************************************************************************
[D] Combining the work of the group (53 points)
[D1] Paper describes the running of the testing program with the implementation
and the results of that run (8 points).
[D2] Paper describes how to fix the implementation problems with the data
structure, and/or what the student did fix about the implementation problems.
If the problems were too severe, an explanation of the problems as far as the
student can diagnose them is appropriate. However, if the problems are small,
fixes should have been made to the code and those fixes should have been
described (8 points).
[D3] Paper gives an analysis of the testing program's merits (8 points).
[D4] Paper gives a critique of both code segments including commentary on style,
readability, and general implementation issues for both the good and the bad
for both the implementation and testing programs (18 points).
[D5] Points awarded/not based on other group member's critiques of this student's
code (11 points).
****** Please note that if your group did not function for whatever reason, this
guideline will be adjusted as the instructional staff deems appropriate to
accomodate for groups whose team members resigned and such.