I\'m Sorry this Question is so long. I don\'t expect all the questions to be ans

Question

I'm Sorry this Question is so long. I don't expect all the questions to be answered in the first round of asking. If you only want to asnwer 2 or 3 of the implementations in the first round that's fine. I'll keep posting the question unitl I get all the answers I need. All of them will have a 1500 point reward. Thanks for all the help!

Then I'm supposed to implement them in this Source File

Again I'm not asking for you to complete all of the function implementations. Only as many as you think are worth the 1500 point maximum. Thanks!

Your job is to complete and test poly.c to implement the functions declared in poly.h. Save copies of both of these files and testpoly .c in your working directory for this project, and rename the program skeleton before editing it:

Explanation / Answer

1)

double value(poly *node,double x)
{
   poly *q=node;
   double res=1,finalres=0;
   int e;
   while(q!=NULL)
   {
       e=q->exponent;
       res=res*(q->coeff);
       while(e)
       {
           res=res*x;
           e=e-1;
       }
       finalres=finalres+res;
       q=q->next;
   }
   return finalres;
}

--------------------------------------------------------------------------------------------------------------------------

2)

int degree(poly *node)
{
   poly *q=node;
   int x=0;
   while(q!=NULL)
   {
       if(q->exponent>x)
           x=q->exponent;
       q=q->next;
   }
   return x;
}

---------------------------------------------------------------------------------------------------------------------------------------------------

3)

int count(poly *node)
{
   poly *q=node;
   int x=0;
   while(q!=NULL)
   {
       x=x+1;
       q=q->next;
   }
   return x;
}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.