Question

in C++

as Exercise P12.14. Write a class Polynomial that stores a polynomial such p(x) = 5x10 + 9x7-x-10 as a linked list of terms. A term contains the coefficient and the example, you would store p(x) as power of x. For (5,10),(9,7),(-1,1),(一10,0) Supply member functions to add, multiply, and print polynomials. Supply a com- structor that makes a polynomial from a single term. For example, the polynomia; can be constructed as Polynomial p(Term(-10, 0)); p.add (Polynomial(Term(-1, 1))); p.add (Polynomial(Term(9, 7))) p.add (Polynomial(Term(5, 10))); Then compute p(x) × p(x). Polynomial q = р.multiply(p); g.printO;

Answer 1

#include <iostream> using namespace std; struct Term Term of polynomial int coeff: int power; Term next; / Each Term points to next term class Polynomiali // Head Ter //maximum power of polynomial Term *ht; int max_pow; public Polynomial (int c,int p) constructor Term *temp-new Term) temp->coeff-C temp->power-p temp-next NULL ht-temp; max pow=p; void add (int c,int p) adding Terms at the beginning Term *temp-new Term) temp->coeff=c; temp>power-p: temp-next-ht; ht-temp; if (max pow<p) // update max power max pow-p

Polynomial multiply (Polynomial Q)// Multiplying two polynomial Term temp ht, temq 2.ht; int pow_sum=max-pow+0.max pow+1; int prod-new int[pow sum]: /creating array of size sum of max power of two polynomial Polynomial p (o, 0) for (int i-0i<pow sum; i++) //initialize elements of array to zero prod[il-0: while (temp !=NULL) { temq=Q, ht ; while (temq!=NULL) { //filling product array index sum of power with product of coefficient prod temp->powerttemq-powerl+temp->coeff temq->coeff: temgr-temq->next; temp temp->next for (int 1#0 ; ¡<pow-sum; i++){ if (prod[1] !#0) р.add(prod [1],ì); // adding corresponding power and coefficient ǐn resultant Polynomial return p:

void print ) // printing Polynomial printi Term temp=ht ; while (temp !=NULL) { if (temp->coeff-=0){ // checking for 0 coefficient because it is meaningless coutくくtemp->coeffくく"x""くくtemp-power<<" "; temp=temp->next ; cout<<endi: //driver program int main () f Polynomial p(-10,0); p.add (9,7) p.add (5, 10); p.print) Polynomial q=p.multiply (p); q.print )

25x 20 90x 17 81x 14 -18x11 -100x 10 -18x 8 -180x7 1x2 28x1 100xe Process returned e (exe) execution tine : 0.052 s Press any key to continue.