POLYNOMIAL ADDITION. AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition.

Size: px

Start display at page:

Download "POLYNOMIAL ADDITION. AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition."

Pauline Lane
5 years ago
Views:

1 POLYNOMIAL ADDITION AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition. ALGORITHM:- 1. Start the program 2. Get the coefficients and powers for the two polynomials to be added. 3. Add the coefficients of the respective powers. 4. Display the added polynomial. 5. Terminate the program. PROGRAM:- #include <stdio.h> #include <conio.h> #include <stdlib.h> int ch,n,i; struct poly int coeff; int exp; struct poly *next; *poly1,*poly2,*poly3,*head1,*head2,*head3,*p,*q,*temp,*r; void input1(); void input2(); void add(); void display(); void main() clrscr(); head1=(struct poly*)malloc(sizeof(struct poly)); head1->next=null; head2=(struct poly*)malloc(sizeof(struct poly)); head2->next=null; head3=(struct poly*)malloc(sizeof(struct poly)); head3->next=null; while(1) printf("\n1.input for polynomial 1\n2.Input for polynomial 2\n3.Polynomial addition\n4.result\n5.exit\n"); printf("\n Enter the choice:");

2 scanf("%d",&ch); switch(ch) case 1: input1(); case 2: input2(); case 3: add(); case 4: display(); default: exit(0); void input1() printf("\nenter the number of terms in the polynomial:"); scanf("%d",&n); for(i=1;i<=n;i++) poly1=(struct poly*)malloc(sizeof(struct poly)); printf("\n Enter the term %d co-efficient:",i); scanf("%d",&poly1->coeff); printf("\n Enter the term %d power:",i); scanf("%d",&poly1->exp); if(head1->next==null) head1->next=poly1; poly1->next=null; p=head1->next; while(p->next!=null) p=p->next; p->next=poly1; poly1->next=null; void input2()

3 printf("\nenter the number of terms in the polynomial:"); scanf("%d",&n); for(i=1;i<=n;i++) poly2=(struct poly*)malloc(sizeof(struct poly)); printf("\n Enter the term %d co-efficient:",i); scanf("%d",&poly2->coeff); printf("\n Enter the term %d power:",i); scanf("%d",&poly2->exp); if(head2->next==null) head2->next=poly2; poly2->next=null; q=head2->next; while(q->next!=null) q=q->next; q->next=poly2; poly2->next=null; void add() p=head1->next; q=head2->next; while(p!=null && q!=null) poly3=(struct poly*)malloc(sizeof(struct poly)); if(p->exp==q->exp) poly3->exp=p->exp; poly3->coeff=p->coeff+q->coeff; p=p->next; q=q->next; if(p->exp>q->exp) poly3->coeff=p->coeff; poly3->exp=p->exp; p=p->next; poly3->coeff=q->coeff; poly3->exp=q->exp;

4 q=q->next; if(head3->next==null) head3->next=poly3; r=head3->next; while(r->next!=null) r=r->next; r->next=poly3; while(p!=null) poly3=(struct poly*)malloc(sizeof(struct poly)); poly3->coeff=p->coeff; poly3->exp=p->exp; p=p->next; if(head3->next==null) head3->next=poly3->next; r=head3->next; while(r->next!=null) r=r->next; r->next=poly3; while(q!=null) poly3=(struct poly*)malloc(sizeof(struct poly)); poly3->coeff=q->coeff; poly3->exp=q->exp; q=q->next; if(head3->next==null) head3->next=poly3->next;

5 r=head3->next; while(r->next!=null) r=r->next; r->next=poly3; void display() printf("\n The resultant polynomial\n"); if(head3->next==null) printf("\n No Terms\n"); temp=head3->next; while(temp!=null) printf("%d X^%d+",temp->coeff,temp->exp); temp=temp->next; getch(); OUTPUT:- RESULT:- Thus the given C program for adding two polynomials using linked list is executed and verified successfully.

6 CONVERT INFIX TO POSTFIX EXPRESSION AIM:- To write a C program to implement stack and use it to convert infix to postfix expression. ALGORITHM:- 1. Start the program 2. Scan the Infix string from left to right. 3. Initialise an empty stack. 4. If the scannned character is an operand, add it to the Postfix string. If the scanned character is an operator and if the stack is empty Push the character to stack. If the scanned character is an Operand and the stack is not empty, compare the precedence of the character with the element on top of the stack (topstack). If topstack has higher precedence over the scanned character Pop the stack Push the scanned character to stack. Repeat this step as long as stack is not empty and topstack has precedence over the character. Repeat this step till all the characters are scanned. 5. (After all characters are scanned, we have to add any character that the stack may have to the Postfix string.) If stack is not empty add topstack to Postfix string and Pop the stack. Repeat this step as long as stack is not empty. 6. Return the Postfix string. 7. Terminate the program. PROGRAM:- #include <stdio.h> #include<conio.h> #include<string.h> #include<stdlib.h> int size =50; char infix[50],postfix[50],stack[50]; int top=-1; int precedence(char ch); char pop();

7 char topelement(); void push(char ch); void main() char ele,elem,st[2]; int i,prep,pre,popped,j=0; clrscr(); strcpy(postfix," "); printf("\n\n Enter the infix\n"); gets(infix); for(i=0;infix[i]!='\0';i++) if(infix[i]!='('&&infix[i]!=')'&&infix[i]!='^'&&infix[i]!='*'&&infix[i]!='/'&&infix[i]!='+'&&infi x[i]!='-') postfix[j++]=infix[i]; if(infix[i]=='(') elem=infix[i]; push(elem); if(infix[i]==')') while((popped=pop())!='(') postfix[j++]=popped; elem=infix[i]; pre=precedence(elem); ele=topelement(); prep=precedence(ele); if(pre > prep) push(elem); while(prep >= pre) if(ele=='#') popped=pop(); ele=topelement(); postfix[j++]=popped;

8 prep=precedence(ele); push(elem); while((popped=pop())!='#') postfix[j++]=popped; postfix[j]='\0'; printf("\n post fix :%s",postfix); getch(); int precedence(char ch) switch(ch) case '^' : return 5; case '/' : return 4; case '*' : return 4; case '+' : return 3; case '-' : return 3; default : return 0; char pop() char ret; if(top!=-1) ret =stack[top]; top--; return ret; return '#'; char topelement() char ch; if(top!=-1) ch=stack[top]; ch='#'; return ch;

9 void push(char ch) if(top!=size-1) top++; stack[top]= ch; OUTPUT:- RESULT:- Thus the given C program for converting infix to postfix expression using stack is executed and verified successfully.

AIM:- To write a C program to create a singly linked list implementation.

SINGLY LINKED LIST AIM:- To write a C program to create a singly linked list implementation. ALGORITHM:- 1. Start the program. 2. Get the choice from the user. 3. If the choice is to add records, get the