Scribd
Upload
232 views

Representation of Polynomials Using Circular Linked List and For The Addition of Two Such Polynomials

Uploaded by

pallakila balakrishnareddy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
232 views

Representation of Polynomials Using Circular Linked List and For The Addition of Two Such Polynomials

Uploaded by

pallakila balakrishnareddy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Write a program for the representation of polynomials using

circular linked list and for the addition of two such polynomials

Algorithm:

Input − polynomial p1 and p2 represented as a linked list.

Step 1: loop around all values of linked list and follow step 2& 3.

Step 2: if the value of a node’s exponent. is greater copy this node to result node and head
towards the next node.

Step 3: if the values of both node’s exponent is same add the coefficients and then copy the
added value with node to the result.

Step 4: Print the resultant node.


Program:

/*Program for the representation of Polynomials


using circular linked list and for the addition of two polynomials*/
#include<stdio.h>
#include<stdlib.h>
struct node
{
int coeff;
int expon;
struct node *link;
};
typedef struct node *NODE;
NODE getnode()
{
NODE x;
x = (NODE) malloc(sizeof(struct node));
return x;
}
NODE attach(int coeff, int expon, NODE head)
{
NODE temp, cur;
temp = getnode();
temp->coeff = coeff;
temp->expon = expon;
cur = head->link;
while(cur->link != head)
{
cur = cur->link;
}
cur->link = temp;
temp->link = head;
return head;
}
NODE read_poly(NODE head)
{
int i = 1, coeff, expon;
printf("\nEnter the coefficient as -999 to end the polynomial ");
while(1)
{
printf("\nEnter the %d term:\n",i++);
printf("\n\tCoeff = ");
scanf("%d", &coeff);
if(coeff == -999)
break;
printf("\n\tPow x = ");
scanf("%d", &expon);
head = attach(coeff, expon, head);
}
return head;
}
NODE poly_add(NODE head1, NODE head2, NODE head3)
{
NODE a,b;
int coeff;
a = head1->link;
b = head2->link;
while(a != head1 && b != head2)
{
if(a->expon == b->expon)
{
coeff = a->coeff + b->coeff;
if(coeff != 0)
head3 = attach(coeff, a->expon, head3);
a = a->link;
b = b->link;
}
else if(a->expon > b->expon)
{
head3 = attach(a->coeff, a->expon, head3);
a = a->link;
}
else
{
head3 = attach(b->coeff, b->expon, head3);
b = b->link;
}
}
while(a != head1)
{
head3 = attach(a->coeff, a->expon, head3);
a = a->link;
}
while(b != head2)
{
head3 = attach(b->coeff, b->expon, head3);
b = b->link;
}
return head3;
}
void display(NODE head)
{
NODE temp;
if(head->link == head)
{
printf("\nPolynomial does not exist");
return;
}
temp = head->link;
while(temp != head)
{
printf("%dx^%d",temp->coeff, temp->expon);
temp = temp->link;
if(temp != head)
printf(" + ");
}
}
int main()
{
NODE head1, head2, head3;
head1 = getnode();
head2 = getnode();
head3 = getnode();
head1->link=head1;
head2->link=head2;
head3->link=head3;

printf("\nEnter the first polynomial \n");


head1 = read_poly(head1);
printf("\nEnter the second polynomial \n");
head2 = read_poly(head2);

head3 = poly_add(head1, head2, head3);

printf("\nPolynomial 1:\t");
display(head1);
printf("\nPolynomial 2:\t");
display(head2);
printf("\nPolynomial Result:\t");
display(head3);
}
Output:

Enter the first polynomial

Enter the coefficient as -999 to end the polynomial


Enter the 1 term:

Coeff = 4

Pow x = 2

Enter the 2 term:

Coeff = 2

Pow x = 1

Enter the 3 term:

Coeff = -999

Enter the second polynomial

Enter the coefficient as -999 to end the polynomial


Enter the 1 term:

Coeff = 2

Pow x = 1

Enter the 2 term:

Coeff = 4

Pow x = 0

Enter the 3 term:

Coeff = -999

Polynomial 1: 4x^2 + 2x^1


Polynomial 2: 2x^1 + 4x^0
Polynomial Result: 4x^2 + 4x^1 + 4x^0

You might also like