The document describes a C program that creates and adds polynomials represented as linked lists. It defines a node structure with coefficient and exponent fields, and functions to create two polynomials by taking user input, store them in linked lists (first and second), and add them by attaching corresponding nodes and storing the result. The create functions take input in descending exponent order and allocate new nodes to the linked lists until an exponent of 0 is entered to end the polynomial.

1. Polynomial Addition
#include<stdio.h>
#include<conio.h>
#include<process.h>
#include<alloc.h>
void CreatePolyFirst();
void CreatePolySecond(); //Function Protypes
void AddPoly();
void Attach(int, int, struct node *);
struct node
{
int coef , exp; //Structure Definition
struct node *next;
} *first=NULL, *second=NULL, *New=NULL, *temp1=NULL,
*temp2=NULL, *result=NULL, *temp3=NULL;

2. Polynomial Addition
void main()
{
int ch;
clrscr();
do
{
printf("n***MENU***");
printf("n1.Create 1st Polynomial”);
printf(“n2.Create 2nd Polynomial”);
printf("n3.Add Both Polynomial
printf(”n4.Exit");
printf("nPlease Enter the Choice...");
scanf("%d",&ch);

3. Polynomial Addition
switch(ch)
{
case 1: CreatePolyFirst();
break;
case 2: CreatePolySecond();
break;
case 3: AddPoly();
break;
case 4: exit(0);
default: printf("n Invalid Choice...");
}
}while(ch!=4);
getch();
}

4. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New
first = NULL

5. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); 5 if(New->exp==0)
if(New->coef==0) break;
break; }}
New 5
first = NULL

6. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New 5
first = NULL

7. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp); 2
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New 5 2
first = NULL

8. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New 5 2
first = NULL

9. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New, 5 2
first

10. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New, 5 2
first
temp1

11. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
New, 5 2
first
temp1

12. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New
temp1

13. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); 8 if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8
temp1

14. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8
temp1

15. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp); 1
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8 1
temp1

16. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8 1
temp1

17. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8 1
temp1

18. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8 1
temp1

19. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 New 8 1
temp1

20. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New
first
temp1

21. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); 4 if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4
first
temp1

22. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4
first
temp1

23. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp); 0
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4 0
first
temp1

24. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4 0
first
temp1

25. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4 0
first
temp1

26. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4 0
first
temp1

27. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
5 2 8 1 New 4 0
first
temp1

28. void CreatePolyFirst() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(first==NULL)
Order...n"); {
printf("nFor end enter 0.n"); first=New;
temp1=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp1->next=New;
New->next=NULL; temp1=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
first 5 2 8 1 4 0

29. void CreatePolySecond() printf("nEnter the Exponent...");
{ scanf("%d",&New->exp);
printf("nEnter Polynomial in Descending if(Second==NULL)
Order...n"); {
printf("nFor end enter 0.n"); second=New;
temp2=New;
while(1) }
{ else
New=(struct node *) malloc (sizeof {
(struct node)); temp2->next=New;
New->next=NULL; temp2=New;
printf("nEnter the Coefficient..."); }
scanf("%d",&New->coef); if(New->exp==0)
if(New->coef==0) break;
break; }}
second 4 4 7 2 2 1

30. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) . {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
second 4 4 7 2 2 1

31. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q

32. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) . {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q

33. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp) 2==4
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
New

34. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp) 2<4
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
New

35. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
New

36. void Attach(int c,int e,struct node *d) . else
{ (4, 4, New) {
temp3->next=d;
if(result==NULL) temp3=d;
{ temp3->coef=c;
result=d; temp3->exp=e;
temp3=New; }
temp3->coef=c; }
temp3->exp=e;
}
first 5 2 8 1 4 0
p
4 4 7 2 2 1
second
q
New result= NULL

37. void Attach(int c,int e,struct node *d) . else
{ (4, 4, New) {
temp3->next=d;
if(result==NULL) temp3=d;
{ temp3->coef=c;
result=d; temp3->exp=e;
temp3=New; }
temp3->coef=c; }
temp3->exp=e;
}
first 5 2 8 1 4 0
p
4 4 7 2 2 1
second
q
New result, temp3

38. void Attach(int c,int e,struct node *d) . else
{ (4, 4, New) {
temp3->next=d;
if(result==NULL) temp3=d;
{ temp3->coef=c;
result=d; temp3->exp=e;
temp3=New; }
temp3->coef=c; }
temp3->exp=e;
}
first 5 2 8 1 4 0
p
4 4 7 2 2 1
second
q
New 4 4 result, temp3

39. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res, 4 4
temp3

40. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res, 4 4 New
temp3

41. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp) 2==2
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res, 4 4 New
temp3

42. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef; x= 5+7=12
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res, 4 4 New
temp3

43. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res, 4 4 12 2
temp3

44. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res, 4 4 12 2
temp3

45. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res 4 4 12 2 New
temp3

46. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp) 1==1
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res 4 4 12 2 New
temp3

47. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef; x=8+2=10
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res 4 4 12 2 New
temp3

48. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q
res 4 4 12 2 10 1
temp3

49. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q=NULL
res 4 4 12 2 10 1
temp3

50. void AddPoly() New->next=NULL;
{ if(p->exp==q->exp)
struct node *p,*q,*r; int x; {
if(first==NULL || second==NULL) x=p->coef+q->coef;
{ if(x!=0)
printf("nYour First or Second Attach(x,p->exp,New);
Polynomial is Invalid..."); p=p->next;
return; q=q->next;
} }
p=first; q=second; else if(p->exp<q->exp)
while(p!=NULL && q!=NULL) {
{ Attach(q->coef,q->exp,New);
New=(struct node *) malloc (sizeof q=q->next;
(struct node)); }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q=NULL
res 4 4 12 2 10 1
temp3

51. else printf("nAddition of Both Polynomial...n");
{ if(result==NULL)
Attach(p->coef, p->exp, New); {
p=p->next; printf("0"); return;
}} }
while(p!=NULL) while(result!=NULL)
{ {
Attach(p->coef,p->exp,p); printf("%dx^%d",New->coef,New->exp);
p=p->next;} if(result->next!=NULL)
while(q!=NULL) printf(" + ");
{ New=New->next;
Attach(p->coef,p->exp,q); }
q=q->next;} }
first 5 2 8 1 4 0
p
second 4 4 7 2 2 1
q=NULL
res 4 4 12 2 10 1
temp3

52. else printf("nAddition of Both Polynomial...n");
{ if(result==NULL)
Attach(p->coef, p->exp, New); {
p=p->next; printf("0"); return;
}} }
while(p!=NULL) while(result!=NULL)
{ {
Attach(p->coef,p->exp,p); printf("%dx^%d",New->coef,New->exp);
p=p->next;} if(result->next!=NULL)
while(q!=NULL) printf(" + ");
{ New=New->next;
Attach(p->coef,p->exp,q); }
q=q->next;} }
first 5 2 8 1 4 0
p=NULL
second 4 4 7 2 2 1
q=NULL
res 4 4 12 2 10 1 4 0
temp3

53. else printf("nAddition of Both Polynomial...n");
{ if(result==NULL)
Attach(p->coef, p->exp, New); {
p=p->next; printf("0"); return;
}} }
while(p!=NULL) while(result!=NULL)
{ {
Attach(p->coef,p->exp,p); printf("%dx^%d",New->coef,New->exp);
p=p->next;} if(result->next!=NULL)
while(q!=NULL) printf(" + ");
{ New=New->next;
Attach(p->coef,p->exp,q); }
q=q->next;} }
first 5 2 8 1 4 0
p=NULL
second 4 4 7 2 2 1
q=NULL
res 4 4 12 2 10 1 4 0

54. else printf("nAddition of Both Polynomialn");
{ if(result==NULL)
Attach(p->coef, p->exp, New); {
p=p->next; printf("0"); return;
}} }
while(p!=NULL) while(result!=NULL)
{ {
Attach(p->coef,p->exp,p); printf("%dx^%d",New->coef,New-
p=p->next;} >exp);
while(q!=NULL) if(result->next!=NULL)
{ printf(" + ");
Attach(p->coef,p->exp,q); New=New->next;
q=q->next;} }
}
res 4 4 12 2 10 1 4 0
res - > 4x^4 + 12x^2 + 10x^1 + 4