/Addition of two polynomials/ #include<stdio.h> #include<malloc.h> #include<conio.h> struct link { int coeff; int pow; struct link *next; }; struct

Size: px

Start display at page:

Download "/*Addition of two polynomials*/ #include<stdio.h> #include<malloc.h> #include<conio.h> struct link { int coeff; int pow; struct link *next; }; struct"

Herbert Fisher
5 years ago
Views:

1 /*Addition of two polynomials*/ #include<stdio.h> #include<malloc.h> #include<conio.h> struct link int coeff; int pow; struct link *next; ; struct link *poly1=null,*poly2=null,*poly=null; void create(struct link *node) char ch; do printf("\nenter the coefficient :"); scanf("%d",&node->coeff); printf("\nenter the power :"); scanf("%d",&node->pow); node->next=(struct link *)malloc(sizeof(struct link)); node=node->next; node->next=null; printf("\ncontinue??? (Y/N) :"); ch=getch(); while(ch=='y' ch=='y'); void display(struct link *node) while(node->next!=null) printf("%dx^%d",node->coeff,node->pow); node=node->next; if(node->next!=null) printf(" + "); void polyadd(struct link *poly1,struct link *poly2,struct link *poly) while(poly1->next && poly2->next) if(poly->pow > poly2->pow) poly->pow=poly1->pow; poly->coeff=poly1->coeff; poly1=poly1->next; if(poly1->pow < poly2->pow) poly->pow=poly2->pow; poly->coeff=poly2->coeff; poly2=poly2->next;

2 poly->pow=poly1->pow; poly->coeff=poly1->coeff+poly2->coeff; poly1=poly1->next; poly2=poly2->next; poly->next=(struct link *)malloc(sizeof(struct link)); poly=poly->next; poly->next=null; while(poly1->next poly2->next) if(poly1->next) poly->pow=poly1->pow; poly->coeff=poly1->coeff; poly1=poly1->next; if(poly2->next) poly->pow=poly2->pow; poly->coeff=poly2->coeff; poly2=poly2->next; poly->next=(struct link *)malloc(sizeof(struct link)); poly=poly->next; poly->next=null; void main() poly1=(struct link *)malloc(sizeof(struct link)); poly2=(struct link *)malloc(sizeof(struct link)); poly=(struct link *)malloc(sizeof(struct link)); clrscr(); printf("\nenter the first polynomial::"); create(poly1); printf("\nfirst polynomial is :: \n"); display(poly1); printf("\nenter the second polynomial::"); create(poly2); printf("\nsecond polynomial is :: \n"); display(poly2); polyadd(poly1,poly2,poly); printf("\naddition of the two polynomials::"); display(poly); getch();

3 /**Stack operations**/ #include<stdio.h> #include<conio.h> #include<stdlib.h> #define size 5 struct stack int s[size]; int top; st; int stfull() if(st.top>=size-1) return 1; return 0; void push (int item) st.top++; st.s[st.top]=item; int stempty() if(st.top==-1) return 1; return 0; int pop() int item; item=st.s[st.top]; st.top--; return(item); void display() int i; if(stempty()) printf("\stack is Empty"); for(i=st.top;i>=0;i--) printf("\n%d",st.s[i]); void main(void) int item,choice; char ans; st.top=-1;

4 clrscr(); printf("\n\t\t Implementation of stack"); do printf("\n1.push\n2.pop\n3.display\n4.e\xit"); printf("\nenter your choice"); scanf("%d",&choice); switch(choice) case 1:printf("\n enter teh item to be pushed"); scanf("%d",&item); if(stfull()) printf("\n stack is full"); push(item); case 2:if(stempty()) printf("\n empty stack"); item=pop(); printf("\n the popped element is %d",item); case 3:display(); case 4:exit(0); printf("\n do you want to continue"); ans=getche(); while(ans=='y' ans=='y'); getch();

5 /**Conversion of Infix expression to Postfix form**/ #include<stdio.h> #include<conio.h> #include<alloc.h> char inf[40],post[40]; int top=0,st[20]; void postfix(); void push(int); char pop(); void main(void) clrscr(); printf("\n\tenter the infix expression :: \n\n\t\t"); scanf("%s",inf); postfix(); getch(); void postfix() int i,j=0; for(i=0;inf[i]!='\0';i++) switch(inf[i]) case '+' : while(st[top] >= 1) push(1); case '-' : while(st[top] >= 1) push(2); case '*' : while(st[top] >= 3) push(3); case '/' : while(st[top] >= 3) push(4); case '^' : while(st[top] >= 4) push(5); case '(' : push(0); case ')' : while(st[top]!= 0) top--; default : post[j++] = inf[i];

6 while(top>0) printf("\n\tpostfix expresion is =>\n\n\t\t %s",post); void push(int ele) top++; st[top] = ele; char pop() int el; char e; el = st[top]; top--; switch(el) case 1 : e = '+'; case 2 : e = '-'; case 3 : e = '*'; case 4 : e = '/'; case 5 : e = '^'; return(e);

7 /** Evaluation of postfix expression**/ #include<stdio.h> #include<conio.h> #include<ctype.h> #include<string.h> #define maxsize 10 struct stackarray int top; int operand[maxsize]; stack; void push(int oprd) stack.top++; stack.operand[stack.top]=oprd; int pop() int tmp; tmp=stack.operand[stack.top]; stack.top--; return(tmp); void main() int len,i,op1,op2,result; char exp[20]; stack.top=-1; clrscr(); printf("\nenter postfix expresion :"); scanf("%s",&exp); len=strlen(exp); for(i=0;i<len;i++) if(isdigit(exp[i])) push(exp[i]-'0'); op1=pop(); op2=pop(); switch(exp[i]) case'+': result=op1+op2; case '-': result=op1-op2; case '*': result=op1*op2;

8 case '/': result=op1/op2; push(result); printf("\nthe result of given expresion is%d",result); getch();

9 /**Queue**/ #include<stdio.h> #include<conio.h> #include<stdlib.h> #define size 5 struct queue int que[size]; int front,rear; Q; Qfull() if(q.rear>=size-1) return 1; return 0; int insert(int item) if(q.front==-1) Q.front++; Q.que[++Q.rear]=item; return Q.rear; int Qempty() if(q.front==-1 (Q.front>Q.rear)) return 1; return 0; int delete() int item; item=q.que[q.front]; Q.front++; printf("\n The deleted item is %d",item); return Q.front; void display() int i; for(i=q.front;i<=q.rear;i++) printf(" %d",q.que[i]); void main(void) int choice,item; char ans; clrscr(); Q.front=-1;

10 Q.rear=-1; do printf("\n Main menu"); printf("\n 1.Insert\n 2.Delete\n 3.Display"); printf("\n Enter your choice"); scanf("%d",&choice); switch(choice) case 1:if(Qfull()) printf("\n can not insert the element"); printf("\n Enter the element"); scanf("%d",&item); insert(item); case 2:if(Qempty()) printf("\n Queue underflow"); delete(); case 3:if(Qempty()) printf("\n queue is empty"); display(); default:printf("\n wrong choice"); printf("\n do u want continue"); ans=getche(); while(ans=='y' ans=='y');

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

POLYNOMIAL ADDITION. AIM:- To write a C program to represent a polynomial as a linked list and write functions for polynomial addition. 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