Polynomial Multiplication using Linked List

 #include<stdio.h>

#include<stdlib.h>
struct node
{
int coeff,exp;
struct node *link;
}*A=NULL,*B=NULL,*S=NULL,*P=NULL;

struct node * create()
{
struct node *TP=NULL,*temp=NULL,*LTP=NULL;
int n,coeff,exp,i;
printf("\n Enter no of Terms of Poly  : ");
scanf("%d",&n);
printf("\n Enter Coefficint and Exponent of Poly in order(k1x^n+k2x^n-1..+knx^0  : ");
for(i=0;i<n;i++)
   {
    scanf("%d%d",&coeff,&exp);
    temp=(struct node*)malloc(sizeof(struct node));
    temp->coeff=coeff;
    temp->exp=exp;
    temp->link=NULL;
    if(TP==NULL)
      {
       TP=temp;
       LTP=temp;
      }
    else
      {
       LTP->link=temp;
       LTP=temp;
      }
    }
    return TP;
}
void display(struct node*temp)
{
while(temp!=NULL)
     {
      printf("%dx^%d ---> ",temp->coeff,temp->exp);
      temp=temp->link;
     }
printf("NULL\n");
}
struct node * polyadd(struct node*P1, struct node *P2)
{
struct node *P3=NULL,*lastP3=NULL,*temp=NULL;
if(P1==NULL) P3=P2;
else if(P2==NULL) P3=P1;
else
{
while(P1!=NULL && P2!= NULL)
     {

    if(P2->exp > P1->exp)
{
temp=(struct node*)malloc(sizeof(struct node));
temp->coeff=P2->coeff;
temp->exp=P2->exp;
temp->link=NULL;

if(P3==NULL)
 {
    P3=temp;
    lastP3=temp; 
 }
 else
  {
    lastP3->link=temp;
    lastP3=temp;
   }
 P2=P2->link;
}
     else if(P2->exp < P1->exp)
{
temp=(struct node*)malloc(sizeof(struct node));
temp->coeff=P1->coeff;
temp->exp=P1->exp;
temp->link=NULL;
if(P3==NULL)
{
  P3=temp;
  lastP3=temp;
  }
else
   {
    lastP3->link=temp;
    lastP3=temp;
    }
    P1=P1->link;
}
      else
{
temp=(struct node*)malloc(sizeof(struct node));
temp->coeff=P1->coeff+P2->coeff;
temp->exp=P1->exp;
temp->link=NULL;
if(P3==NULL)
     {
       P3=temp;
       lastP3=temp;
      }
     else
       {
      lastP3->link=temp;
       lastP3=temp;
       }
P1=P1->link;
P2=P2->link;
    }
 }
while(P1!=NULL)
     {
      lastP3->link=P1;
      lastP3=P1;
      P1=P1->link;
     }
while(P2!=NULL)
     {
      lastP3->link=P2;
      lastP3=P2;
      P2=P2->link;
     }
 }
return P3;
}

struct node *polymult(struct node *P1,struct node *P2)
{ 
struct node *CTEMP,*LCTEMP,*P=NULL,*temp;
while(P1!=NULL)
 {
    P2=B;
    CTEMP=NULL;
  while(P2!=NULL)
    {
     temp=(struct node*)malloc(sizeof(struct node));
     temp->link=NULL;
     temp->coeff=P1->coeff*P2->coeff;
     temp->exp=P1->exp+P2->exp;
     if(CTEMP==NULL) {CTEMP=temp;LCTEMP=temp;}
     else{LCTEMP->link=temp;LCTEMP=temp;}
     P2=P2->link;
    }
  display(CTEMP);
  P=polyadd(P,CTEMP);
  P1=P1->link;
 }
 return P;
}
void main()
{
int ch;
do
  {
   printf("\n\n 1. Create Poly \n 2. Multiply Poly \n 3. Display Poly \n 4. Exit  ");
   printf("\n    Enter Option : ");
   scanf("%d",&ch);
   switch(ch)
{
 case 1:
        A=create();
        B=create();
        break;
 case 2:
       P=polymult(A,B);
       printf("Polinomial Product..\n");
       display(P);
       break;
 case 3:  
       printf("\n    Polynomial A : ");
       display(A);
       printf("\n    Polynomial B : ");
       display(B);
       break;
 case 4:
       exit(0);
 default :
       printf("\n    Invalid Option !!!");
}
  }
while(1);
}

Comments

Post a Comment

Popular posts from this blog

Data Structure Lab CSL 201 Manual KTU - Dr Binu V P-9847390760

 Dr Binu V P - About Me Data Structures CST 201 KTU Theory Notes  ( Learn Theory Before You Attempt Lab Exercise) SCHEME AND SYLLABUS 1. Polynomial Addition using Arrays 2. Sparse Matrix Representation and sum 3. Stack using Array 4. Queue using Array 5. Circular Queue using Arrays 6. Double Ended Queue  7. Priority Queue  8. Infix to postfix 9. Infix to prefix conversion 10. Prefix to infix conversion 11. Evaluation of postfix expression 12. Singly Linked List 13. Doubly Linked List   14. Stack using Linked List 15. Queue using Linked List 16. Polynomial Addition using Linked list 17. Polynomial Multiplication using Linked List 18. Binary Tree using arrays and traversals 19. Binary Tree using Linked List and Traversal 20. Binary Search Tree Implementation and Traversal 21.Sorting Algorithms       Bubble sort       Exchange sort       Selection Sort       Insertion Sort       Quick Sort       Merge Sort       Heap Sort 22.Searching Algorithm      Linear Search      Binary Search 23. Gr
Read more

Lab Assignments

Image
Course code: CSL 201 Course Name: Data Structures Lab Faculty In Charge: Dr Binu V P L-T-P-Credits 0-0-3-2 Pre-requisite: CST 201 Data Structures, EST 102 C programming skills. Operating System to Use in Lab : Linux Compiler/Software to Use in Lab : gcc Programming Language to Use in Lab : Ansi C Preamble: The aim of the Course is to give hands-on experience for Learners on creating and using different Data Structures. Data Structures are used to process data and arrange data in different formats for many applications. The most commonly performed operations on data structures are traversing, searching, inserting, deleting and few special operations like merging and sorting. /**********************************************************************************/ Lab Cycle-1 Learning Outcome: Learn to use arrays and develop application programs. (Show the output after completing all the programs. Evaluation is done based on this) Write C programs to do the following: 1) Write a functi
Read more

Polynomial Addition using Arrays

Learn Theory -  Polynomials /****************************************************************/ #include<stdio.h> void create(int poly[],int degree) {     int i=0;          printf("Enter the coeffecients for:\n");     for(i=degree;i>=0;i--)     {         printf("Exp_%d: ",i);         scanf("%d",&poly[i]);     } } void display(int poly[],int degree) {     int i;     for(i=degree;i>=0;i--)     {                  if(i!=degree && poly[i]>0)         {              printf("+");          }         printf("%dx^%d",poly[i],i);     } } void main() {     int poly1[100]={0},degree1,poly2[100]={0},degree2,degreeresult,polyresult[100],i=0;          printf("Enter the degree of first polynomial");      scanf("%d",&degree1);     create(poly1,degree1);     printf("Enter the degree of second polynomial");      scanf("%d",&degree2);     create(poly2,degree2);     if(degree1>degree
Read more