In terms of concept, it’s a simple assignment where a runner is keeping track of their running activities. Each run is characterized by two attributes:
distance (in kms) and
time (in seconds). Each instance of a
Run object also holds references to two other
prev: Run (if any) before the instance.
next: Run (if any) after the instance.
Thus, we can track runs from earliest to latest using
next, or latest to earliest using
Your task is to complete the nine methods in the class
IMPORTANT: All methods except
addToFront require correct implementation of
addToEnd as a pre-requisite.
For some methods, such as
size(), etc., it doesn’t matter which object in the list the methods is called on, the result should be the same.
For example, if there is a list of 20 runs starting at
r, each of the following should return 20:
Helper methods and variables
You can, and if using recursion, will need to, add helper methods. You can add instance variables and class (static) variables as well.
A document to help you with the concept of the need to traverse to the first node, and for a helper method (for a good chunk of the methods) is provided in a4help.pdf at the bottom of the page.
Tests for the following methods are NOT supplied:
You need to write your own tests to check the correctness of your implementation.
Maximum marks for each method are provided in the tests corresponding to the methods. For full marks, you need to solve this assignment purely recursively. So, if you use a loop, even once, in any method, your marks will be reduced by 30% automatically. We hope the following table makes the situation clear for you.
|Number of times loops used||Raw Mark||Final Mark|
If it doesn’t, the following flowchart might help:
Drag the file
Run.java into the submission box. You got this!
You cannot use any external library. The use of ANY function from outside the
Run class will result in an automatic zero
The post write your own tests to check the correctness of your implementation. appeared first on Best Custom Essay Writing Services | EssayBureau.com.