Question: I have done the first and 3rd implementations can you please help with the 2nd and 4th implemention implementations will use arrays and the third
implementations will use arrays and the third will use pointers. The forth is interface for the 4 ciasses: Polyhomial Add als. Implement the algorithm four different ways. The first two a set of linked lists in an array. Use the following public interface Polynomialinterface Polynoimiallnterface add(PolynomialInterface other); Effect: Adds value to owner of addPolynomial method. Postcondition: Return value this + value Polynomiallnterface subtract(PolynomialInterface other); Effect: Subtracts value from owner of addPolynomial method. void readPolynomialO: String toString0 Postcondition: Return value this- value Postcondition: polynomial read. Postcondition: polynomial converted to string. The class must be able to read and print polynomials Example: 4x*+x'-3 +4X1-2X3+4X The four ways to implement the requirements: March 26 Monday: Create an array or ArrayList holding coefficients with the array indexes as exponents April 4, Wednesday: Create and array or ArrayList of nodes, each node holding a term of the polynomial April 16, Monday: Use a linked list of terms using pointers April 25, Wednesday: Polynomials are linked lists in one static array
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
