Scribd
Upload
2 views

Polynomial Equn and Program to add two polynomials

The document describes a polynomial object represented as a list of pairs of exponents and coefficients, detailing operations like addition and evaluation. It provides examples of polynomial addition using two polynomials A(x) and B(x), showing how they can be stored in a 1-D array. Additionally, it includes C code for reading, adding, and displaying polynomials using a structured approach.

Uploaded by

colabpython39
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Polynomial Equn and Program to add two polynomials

The document describes a polynomial object represented as a list of pairs of exponents and coefficients, detailing operations like addition and evaluation. It provides examples of polynomial addition using two polynomials A(x) and B(x), showing how they can be stored in a 1-D array. Additionally, it includes C code for reading, adding, and displaying polynomials using a structured approach.

Uploaded by

colabpython39
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

A polynomial object is a homogeneous ordered list of pairs <exponent,

coefficient>, where each coefficient is unique. Operations include


returning the degree, extracting the coefficient for a given exponent,
addition, multiplication, evaluation for a given input.

Consider the two polynomials A(x) = 2 x 1000 + 1 and B(x) = X4 + 10x³


+ 3x² + 1. These could be stored in the array as below.
Explain with example how A(x)=3X23+3X4+4X2+15 and
B(X)=X5+20X3+2, are stored in a 1-D array?

Show array representation of two polynomials D(X)=A(X)+B(X),


A(X)=2X10+X+3, B(X)=X5+10X3+3X2+12
#include<stdio.h>
struct poly {
int coeff;
int expo;
};
struct poly p1[10], p2[10], p3[10];
int readPoly(struct poly[]);
int addPoly(struct poly[], struct poly[], int, int, struct poly[]);
void displayPoly(struct poly[], int terms);
int main(){
int t1, t2, t3;
t1 = readPoly(p1);
printf(" \n First polynomial : ");
displayPoly(p1, t1);
t2 = readPoly(p2);
printf(" \n Second polynomial : ");
displayPoly(p2, t2);
t3 = addPoly(p1, p2, t1, t2, p3);
printf(" \n\n Resultant polynomial after addition : ");
displayPoly(p3, t3);
printf("\n");
return 0;
}
int readPoly(struct poly p[10]) {
int t1, i;
printf("\n\n Enter the total number of terms in the polynomial:");
scanf("%d", &t1);
printf("\n Enter the COEFFICIENT and EXPONENT in
DESCENDING ORDER\n");
for (i = 0; i < t1; i++) {
printf(" Enter the Coefficient(%d): ", i + 1);
scanf("%d", &p[i].coeff);
printf(" Enter the exponent(%d): ", i + 1);
scanf("%d", &p[i].expo);
}
return (t1);
int addPoly(struct poly p1[10], struct poly p2[10], int t1, int t2, struct poly
p3[10]) {
int i=j=k=0;
while (i < t1 && j < t2) {
if (p1[i].expo == p2[j].expo) {
p3[k].coeff = p1[i].coeff + p2[j].coeff;
p3[k].expo = p1[i].expo;
i++; j++; k++;
}
else if (p1[i].expo > p2[j].expo) {
p3[k].coeff = p1[i].coeff;
p3[k].expo = p1[i].expo;
i++; k++;
}
else {
p3[k].coeff = p2[j].coeff;
p3[k].expo = p2[j].expo;
j++; k++;
}
}
while (i < t1) {
p3[k].coeff = p1[i].coeff;
p3[k].expo = p1[i].expo;
i++;
k++;
}
while (j < t2) {
p3[k].coeff = p2[j].coeff;
p3[k].expo = p2[j].expo;
j++; k++;
}
return (k);
}
void displayPoly(struct poly p[10], int term) {
int k;
for (k = 0; k < term - 1; k++)
printf("%d(x^%d)+", p[k].coeff, p[k].expo);
printf("%d(x^%d)", p[term - 1].coeff, p[term - 1].expo);

You might also like