Java project (Linked List)

Part A – coding

1. Implement Singly Linked List detectLoop which check whether the linked list contains a loop. - It’s an instance method that takes no parameter. It returns true if the linked list contains a loop that goes on forever if tracing the list from head. It returns false if it does not contain a loop.
2. Implement an efficient midElelment of Singly Linked List which returns the middle element in the linked list. - It’s an instance method that takes no parameter. The Singly Linked List contains no size; it uses one loop to return the mid element in the list. If the list contains even number of elements, it returns the element right before the mid-point. Ex: 5 elements, mid element is at index 2. 4 elements, mid element is at index 1.
3. Implement Polynomial Linked List add method which adds two polynomials in standard form and returns sum polynomial which also has to be in standard form. - Rewrite the instance method that takes a second Polynomial Linked List, and then adds all terms in the caller Polynomial and all terms in the second Polynomial Linked List together into another sum Polynomial. Both caller and parameter Polynomials are expected to be in standard form, the method should return the sum Polynomial also in standard form. A standard form polynomial has no duplicate terms (each term’s exponent is unique) and the exponent is in descending order. This method should be O(n), n as the number of terms in the sum polynomial
4. Implement Polynomial Linked List multiply method which adds two polynomials in standard form and returns product polynomial which also in standard form. - As mentioned in the class, write the multiply method so the result polynomial is in standard form. Note: Your Polynomial Linked List shouldn’t have any additional methods as removeDuplicate and/or sort.