Adding Polynomials: Illustrated Guide
Discover how to add two polynomials step-by-step with the help of examples. Dive into the world of polynomial addition prepared by Varsha Degaonkar at the Department of Electronics and Telecommunication. Explore the process and get insights from top algorithms and data structures for competitive programming. Enhance your knowledge and skills in this field today!
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
ADDITION OF TWO POLYNOMIALS Prepared by Varsha Degaonkar Department of Electronics and Telecommunication https://www.geeksforgeeks.org/top-algorithms-and-data-structures-for-competitive-programming/ Hope Foundation s International Institute of Information Technology, I IT www.isquareit.edu.in | info@isquareit.edu.in
ADDITION OF TWO POLYNOMIALS #include<stdio.h> #include<conio.h> typedef struct poly { int power; int coeff; }poly; We have created user defined datatype. void print(poly [], int);/*function declaration*/ 2 Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
void main() { int t1,t2,i,j,k; poly p1[10],p2[10],p3[10]; clrscr(); printf("\n Enter number of terms in 1st polynomial :"); scanf("%d",&t1); for (i=0;i<t1;i++) { printf("\n Enter a term(coeff. power)"); scanf("%d%d",&p1[i].coeff,&p1[i].power); printf("\n1'st polynomial = "); print(p1,t1); /*Function Call*/ Structure variables } void print(poly p[],int n) /*Function Definition*/ { int i; for(i=0;i<n-1;i++) printf("%dX^%d + ",p[i].coeff,p[i].power); printf("%dX^%d =0 \n",p[i].coeff,p[i].power); } 3 Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
printf("\n Enter number of terms in 2nd polynomial :"); scanf("%d",&t2); for (i=0;i<t2;i++) { printf("\n Enter a term(coeff. power)"); scanf("%d%d",&p2[i].coeff,&p2[i].power); } printf("\n2'nd polynomial = "); print(p2,t2); /*Function Call*/ void print(poly p[],int n) /*Function Definition*/ { int i; for(i=0;i<n-1;i++) printf("%dX^%d + ",p[i].coeff,p[i].power); printf("%dX^%d =0 \n",p[i].coeff,p[i].power); } 4 Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
i=j=k=0; while(i<t1 || j<t2) { if(p1[i].power==p2[j].power) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff+p2[j].coeff; i++;j++;k++; } else if(p1[i].power > p2[j].power) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff; i++;k++; } else { p3[k].power=p2[j].power; p3[k].coeff=p2[j].coeff; j++;k++; } } Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in 2X^6 + 5X^0 =0 i=0 7X^5 + 4X^0 =0 j=0 --------------------------------- 2X^6 + k=0 5
i=j=k=0; while(i<t1 || j<t2) { if(p1[i].power==p2[j].power) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff+p2[j].coeff; i++;j++;k++; } else if(p1[i].power > p2[j].power) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff; i++;k++; } else { p3[k].power=p2[j].power; p3[k].coeff=p2[j].coeff; j++;k++; } } Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in 2X^6 + 5X^0 =0 i=1 7X^5 + 4X^0 =0 j=0 --------------------------------- 2X^6 + k=0 7X^5 + k=1 6
i=j=k=0; while(i<t1 || j<t2) { if(p1[i].power==p2[j].power) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff+p2[j].coeff; i++;j++;k++; } else if(p1[i].power > p2[j].power) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff; i++;k++; } else { p3[k].power=p2[j].power; p3[k].coeff=p2[j].coeff; j++;k++; } } Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in 2X^6 + 5X^0 =0 i=1 7X^5 + 4X^0 =0 j=1 --------------------------------- 2X^6 +7X^5 + k=0 k=1 9X^0 =0 k=2 7
/* for rest over terms of polynomial 1 */ while(i<t1) { p3[k].power=p1[i].power; p3[k].coeff=p1[i].coeff; i++;k++; } /* for rest over terms of polynomial 2 */ while(j<t2) { p3[k].power=p2[j].power; p3[k].coeff=p2[j].coeff; j++;k++; } 8 Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
printf("\n Addition of two polynomials = "); print(p3,k); /*Function Call*/ getch(); } void print(poly p[],int n) /*Function Definition*/ { int i; for(i=0;i<n-1;i++) printf("%dX^%d + ",p[i].coeff,p[i].power); printf("%dX^%d =0 \n",p[i].coeff,p[i].power); } 9 Hope Foundation s International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
Thank you!! For further details please contact Prof. Varsha Degaonkar varshad@isquareit.edu.in Department of Electronics & Telecommunication Hope Foundation s International Institute of Information Technology I IT Hinjawadi, Pune www.isquareit.edu.in Ph. - +91 20 22933441 10 International Institute of Information Technology, I IT, P-14 Rajiv Gandhi Infotech Park, Hinjawadi, Pune - 411 057 Tel - +91 20 22933441 / 2 / 3 | Website - www.isquareit.edu.in ; Email - info@isquareit.edu.in
