A polynomial may be represented as a linked list where each node contains the coefficient and...

Transcribed Image Text:

A polynomial may be represented as a linked list where each node contains the coefficient and exponent of a term of the polynomial. The polynomial 4 X ³-3 X²-5 would be represented as a linked list given below. Equation1 4 3 -3 2 -5 0 Write a COMPLETE program that reads two polynomials in any order of exponent from an input file, stores them as sorted (in the descending order of the exponents) linked lists, adds them together, and prints the result as a polynomial to an output file. The result should be a third linked list. Hint: Travers both polynomials. If a particular exponent value is present in either of the two polynomials being summed, then it should be present in the answer. If it is present in both polynomials, then its coefficient is the sum of the corresponding coefficient in both polynomials. (If this sum is zero, the term should be deleted). KEYWORDS: Classes Pointers NOTE: Must write a very general program using Object oriented concept. Do not use any library functions. All methods used in the program MUST be written in C++ and included in the program. Test run for the following inputs (Do not change the order of exponent in the input file) 18X³7X³ +6X² +6 8X³7X+ +6X³+ 9X²8X+9 26X³7X -X³ + 15X² -8X+15 A) Equationl : Equation2: Result: B) Equation1: Equation2: Result: C) Equationl : Equation2: Result: 8X³-7X5+6X² +6 8X³7X² +6X +9X³-8 X³ +6X+ +17X³-X² -2 8x³ - 6+5X² +6X² + 8X³ — 7X² +6X 9X³ - 6X² +5X*+18X³-9 8x³ - 7X7 +14X³ +5X¹ +26X³ + 6X-15 struct nodetype { int coeff; int exp; nodetype *next; class equation { private: public: }; nodetype *begin, *last; int length; //Default constructor equation(); // Method to insert an item in the linked list in a sorted order void insertitem( nodetype temp); // Method to output all the items in the linked list void printlist(); // Method to add two equaition equation add(equation e2); A polynomial may be represented as a linked list where each node contains the coefficient and exponent of a term of the polynomial. The polynomial 4 X ³-3 X²-5 would be represented as a linked list given below. Equation1 4 3 -3 2 -5 0 Write a COMPLETE program that reads two polynomials in any order of exponent from an input file, stores them as sorted (in the descending order of the exponents) linked lists, adds them together, and prints the result as a polynomial to an output file. The result should be a third linked list. Hint: Travers both polynomials. If a particular exponent value is present in either of the two polynomials being summed, then it should be present in the answer. If it is present in both polynomials, then its coefficient is the sum of the corresponding coefficient in both polynomials. (If this sum is zero, the term should be deleted). KEYWORDS: Classes Pointers NOTE: Must write a very general program using Object oriented concept. Do not use any library functions. All methods used in the program MUST be written in C++ and included in the program. Test run for the following inputs (Do not change the order of exponent in the input file) 18X³7X³ +6X² +6 8X³7X+ +6X³+ 9X²8X+9 26X³7X -X³ + 15X² -8X+15 A) Equationl : Equation2: Result: B) Equation1: Equation2: Result: C) Equationl : Equation2: Result: 8X³-7X5+6X² +6 8X³7X² +6X +9X³-8 X³ +6X+ +17X³-X² -2 8x³ - 6+5X² +6X² + 8X³ — 7X² +6X 9X³ - 6X² +5X*+18X³-9 8x³ - 7X7 +14X³ +5X¹ +26X³ + 6X-15 struct nodetype { int coeff; int exp; nodetype *next; class equation { private: public: }; nodetype *begin, *last; int length; //Default constructor equation(); // Method to insert an item in the linked list in a sorted order void insertitem( nodetype temp); // Method to output all the items in the linked list void printlist(); // Method to add two equaition equation add(equation e2);