SOLUTION AT Australian Expert Writers
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 Run objects:
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 prev.
Your task is to complete the nine methods in the class Run.java.
IMPORTANT: All methods except addToFront require correct implementation of addToEnd as a pre-requisite.
For some methods, such as addToEnd, addToFront, 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:
r.size()r.next.next.next.size()r.next.next.next.next.next.prev.prev.size()Helper methods and variablesYou can, and if using recursion, will need to, add helper methods. You can add instance variables and class (static) variables as well.
Help documentA 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.
Advanced tasksTests for the following methods are NOT supplied:
add(Run) (10 marks)longestSequenceOver(double) (15 marks)getRunsOver(double) (15 marks)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 Mark0 80 801 90 6310 90 631 100 70If it doesn’t, the following flowchart might help:
- Assignment status: Already Solved By Our Experts
- (USA, AUS, UK & CA Ph. D. Writers)
- CLICK HERE TO GET A PROFESSIONAL WRITER TO WORK ON THIS PAPER AND OTHER SIMILAR PAPERS, GET A NON PLAGIARIZED PAPER FROM OUR EXPERTS
QUALITY: 100% ORIGINAL PAPER – NO PLAGIARISM – CUSTOM PAPER