DS Module - II - PolyAddition

 

Polynomial Addition using Linked List:

#include <stdio.h>

#include <stdlib.h>

struct Node {

    int coef;

    int exp;

    struct Node* next;

};

typedef struct Node Node;

void insert(Node** poly, int coef, int exp) {

    Node* temp = (Node*) malloc(sizeof(Node));

    temp->coef = coef;

    temp->exp = exp;

    temp->next = NULL;

   

    if (*poly == NULL) {

        *poly = temp;

        return;

    }

   

    Node* current = *poly;

   

    while (current->next != NULL) {

        current = current->next;

    }

   

    current->next = temp;

}

void print(Node* poly) {

    if (poly == NULL) {

        printf("0\n");

        return;

    }

   

    Node* current = poly;

   

    while (current != NULL) {

        printf("%dx^%d", current->coef, current->exp);

        if (current->next != NULL) {

            printf(" + ");

        }

        current = current->next;

    }

   

    printf("\n");

}

Node* add(Node* poly1, Node* poly2) {

    Node* result = NULL;

   

    while (poly1 != NULL && poly2 != NULL) {

        if (poly1->exp == poly2->exp) {

            insert(&result, poly1->coef + poly2->coef, poly1->exp);

            poly1 = poly1->next;

            poly2 = poly2->next;

        } else if (poly1->exp > poly2->exp) {

            insert(&result, poly1->coef, poly1->exp);

            poly1 = poly1->next;

        } else {

            insert(&result, poly2->coef, poly2->exp);

            poly2 = poly2->next;

        }

    }

   

    while (poly1 != NULL) {

        insert(&result, poly1->coef, poly1->exp);

        poly1 = poly1->next;

    }

   

    while (poly2 != NULL) {

        insert(&result, poly2->coef, poly2->exp);

        poly2 = poly2->next;

    }

   

    return result;

}

int main() {

    Node* poly1 = NULL;

    insert(&poly1, 5, 4);

    insert(&poly1, 3, 2);

    insert(&poly1, 1, 0);

    Node* poly2 = NULL;

    insert(&poly2, 4, 4);

    insert(&poly2, 2, 2);

    insert(&poly2, 1, 1);

    printf("First polynomial: ");

    print(poly1);

    printf("Second polynomial: ");

    print(poly2);

    Node* result = add(poly1, poly2);

    printf("Result: ");

    print(result);

    return 0;

}

 

Output:

First polynomial: 5x^4 + 3x^2 + 1x^0

Second polynomial: 4x^4 + 2x^2 + 1x^1

Result: 9x^4 + 5x^2 + 1x^1 + 1x^0

Comments

Post a Comment

Popular posts from this blog

Data Structures Module_V

  Module – V   1. Binary Tree Traversals using Linked List Inorder: #include <stdio.h> #include <stdlib.h>   struct Node {     int data;     struct Node* left;     struct Node* right; };   // Function to perform inorder traversal void inorderTraversal(struct Node* root)  {       // Empty Tree     if (root == NULL)         return;       // Recur on the left subtree     inorderTraversal(root->left);       // Visit the current node     printf("%d ", root->data);       // Recur on the right subtree     inorderTraversal(root->right); }   // Function to create a new node struct Node* newNode(int data)  {       struct Node* node = (struct Node*)malloc(size...
Read more

Data Structures Module-IV

  Module-IV 1) Implementation of Queue Operations using                      i) Arrays    ii) Linked List 2) Implementation of Circular Queue Operations using                      i) Arrays    ii) Linked List 3) Implement Dequeue using Linked List.   1) a) Implementation of Queue Operations using Arrays. #include<stdio.h> #include<stdlib.h> #define SIZE 5 void enqueue(); void dequeue(); void display(); int queue[SIZE],front=-1,rear=-1,ele; int main() {     int ch;     while(1)     {     printf("\n menu");     printf("\n 1.enqueue\n 2.dequeue\n 3.display");     printf("\n enter ur choice");     scanf("...
Read more

Data Structures Module-III

 Module-III III) Exercise Programs on Stack Applications a) Implement stack operations using                  i) Arrays      ii) Linked List b) Conversion of Infix Expression to postfix Expression. c) Evaluation of Postfix Expression d) Write a program to reverse given linked list using stack.   b) Conversion of Infix Expression to postfix Expression. Source Code:- #include<stdio.h> #include<stdlib.h> #include<ctype.h> void push(char); char pop(); int priority(char); int top=-1; char stack[20]; int main() {       char postfix[30],infix[30],ch;     int i,j=0;     printf("\n enter infix expression\n");     gets(infix);     for(i=0;infix[i]!='\0';i++)     {         ch=infix[i];  ...
Read more