Question

programing in c language

Write a program, using the following functions, that reads two polynomials and prints the polynomials before and after the addition.

a) polyRead

- Read in a polynomial and convert it to its linked list representation. - Return a pointer to the header node of this polynomial.

b) polyWrite

- Output a polynomial using a form that clearly displays it.

c) polyAdd

- Compute c = a + b. Do not change either a or b.

where, a, b, c, are polynomial pointers.

• Test the program with the polynomials given below.

The polynomials are given through the keyboard as inputs.

5x5+7x4-3x3-x2+9[space] x5+7x3+2x2-x[space]

Where, [space] indicates the end of a polynomial.

3/4 4. Write a program, using the following functions, that reads two polynomials and prints the polynomials before and after the addition. a) polyRead - Read in a polynomial and convert t to its linked list representation - Return a pointer to the header node of this polynomial b) poly Write -Output a polynomial using a form that clearly displays it. c) polyAdd Compute c a+ b. Do not change either a or b. where, a, b, c, are polynomial pointers. Test the program with the polynomials given below The polynomials are given through the keyboard as inputs. 5x5+ 7x4-3x3-x2+ 9Ispace] x5+ 7x3+ 2x2-xIspace] Where, [space] indicates the end of a polynomial.

Answer 1

//

// main.c

// AbcArithExpresssion

//

// Created by Abhirama Gopala Dasa on 08/05/18.

// Copyright © 2018 Abhirama Gopala Dasa. All rights reserved.

//

#include <iostream>

#include "string"

#include "cstring"

#include "cstdlib"

#include "cstdio"

using namespace std;

struct polynomial{

  

char *charPointer;

struct polynomial *next;

};

struct polynomial *head;

int arrayCount=0;

char* removeSpaces(char *arr,int size){

char *newArr = (char*) malloc(sizeof(char)*size);

int i=0;

int count=0;

while(i<100){

if(*(arr+i)!=' '){

newArr[i]=*(arr+i);

++count;

}

i++;

}

newArr[count]='\0';

arrayCount=count;

return newArr;

}

static struct polynomial* makeLinkedList(char *pointer) {

for (int i=0; *(pointer+i)!='\0'; i++) {

struct polynomial *temp = (struct polynomial*)malloc(sizeof(struct polynomial));

temp->next=nullptr;

temp->charPointer = (char*) malloc(sizeof(char));

*(temp->charPointer)=*(pointer+i);

if(head==nullptr){

head= temp;

}else{

struct polynomial *temp1 = head;

while(temp1->next!=nullptr){

temp1 = temp1->next;

}

temp1->next = temp;

}

}

return head;

}

void polyWrite(struct polynomial *pointer,int size){

struct polynomial *temp = pointer;

while(temp!=nullptr){

printf("%c",*(temp->charPointer));

temp=temp->next;

}

}

int getSize(struct polynomial *temp){

struct polynomial *temp1=temp;

int count=0;

if(temp1==nullptr){

return 0;

}

while(temp1!=nullptr){

++count;

temp1=temp1->next;

}

return count;

}

static struct polynomial * polyRead() {

char str[100];

std::string s;

cin>>s;

  

for (int i=0; i<strlen(s.c_str()); i++) {

str[i]=s.c_str()[i];

}

char* pointer =removeSpaces(str, 100);

struct polynomial *temp= makeLinkedList(pointer);

return temp;

}

//question not clear about how to parse polynomials

static struct polynomial * polyAdd(struct polynomial *head){

struct polynomial *temp = head;

int size=getSize(temp);

char arr[size];

int i=0;

while(temp!=nullptr){

arr[i++] = *(temp->charPointer);

temp=temp->next;

}

int j=0;

char newArr[size];

for (int i=0; i<size; i++) {

if(arr[i]=='*'){

char lhs;

char rhs;

if(i-1>0){

lhs = arr[i-1];

}

if(i+1<size){

rhs = arr[i+1];

}

}

}

return nullptr;

}

int main(){

printf("Enter the expression");

struct polynomial * temp = polyRead();

polyWrite(temp, getSize(temp));

  

  

}

Sample output.