ADT polynomials w/ integer coefficients
$30-5000 USD
Paid on delivery
Design and implement a class that is an ADT (abstract data type) for polynomials (Ax^9 + Bx^7 + ....) with integer coefficients. The coefficients and the degree are data members. The ADT operations include +,-,* and evaluation of polynomials (plug in an integer and evaluate). For the * of two of these ADT polynomials, all that is needed is the multiplying between two polynomials with 3 or 4 terms (like Ax^15 + Bx^4 + Cx^2) * (Dx^22 + Ex^20 + Fx^14 + Gx^12). If you find an easy way to multiply two 20 or 30 term polynomials, all the better. But all that is required as shown above. Addition and subtraction should be able to work for 30 or 40 term ploynomials however. Dont worry about any division. Overload +,-,and *, and implement the evaluation as a member function with an int arguement. The evaluation member function returns the value obtained by plugging in its arguement for x and performing the indicated operations. Include a default constructor, a copy constructor, and a constructor that takes two arguements: a pointer to an int and an int(just a dynamic array). Include a suitable destructor and suitable functions to input and output polynomials by overloading << and >>. Write a driver program to test each of the capabilities of this class.
## Deliverables
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Deadline information
Please make it extremely simple and easy for a beginner to understand. I am in a beginning C++ OOP class, and have an OK knowledge of pointers, overloading, inheritance, and classes. The main thing I am looking for is a well docemented, simple program that a reasonably OK beginner can understand and learn from.
Project ID: #2832603
About the project
Awarded to:
19 freelancers are bidding on average $46 for this job
