Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
java (the question is not graded) part 3 and 4 a and b 1 and 2: public class PolynomialNode { private int coef,exp; private PolynomialNode next; public PolynomialNode( ) { this.coef = 0; this.exp = 0; this.next = null; } public PolynomialNode(int co

java (the question is not graded) part 3 and 4 a and b 1 and 2: public class PolynomialNode { private int coef,exp; private PolynomialNode next; public PolynomialNode( ) { this.coef = 0; this.exp = 0; this.next = null; } public PolynomialNode(int co

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

java (the question is not graded)

part 3 and 4 a and b

1 and 2:


public class PolynomialNode {
private int coef,exp;
private PolynomialNode next;
public PolynomialNode( ) {
this.coef = 0;
this.exp = 0;
this.next = null;
}
public PolynomialNode(int coef, int exp ) {
this.coef = coef;
this.exp = exp;
this.next = null;
}
public PolynomialNode(int coef, int exp, PolynomialNode next) {
this.coef = coef;
this.exp = exp;
this.next = next;
}

}

3. Write the class Polynomial having a default constructor that initializes a private attribute “PolynomialNode head" to null. 4. In the Polynomial class, create the following methods: a. public boolean isEmpty(}{...}; returns true if the head list is empty. b. public void insert(int coef, int exp){..}; that modifies the linked list according to the following cases: i. If none of the nodes contain an equal exp value, then create a new PolynomialNode and insert it into the list that's arranged in a descending order based on the exponent. ii. If there exists a node having equal exp value, then add the coef to the node's coefficient. Note that if the coefficient is equal to zero then the node must be deleted. c. public void remove(){...}; removes the front node of the head list. d. public String toString0{...}; prints a given polynomial on the screen (for example the output string of the previous example is: 10x^3+5x^2+3x+5). e. public void add(Polynomial p){...}; sums the 2 given polynomials (this and p). The result will modify the Polynomial object that called the method. For example, the sum of the polynomials: [10x³ + 5x² + 3x + 5]-[3x3 – 7x? + 3x – 6]=[13x³ – 2x² + 6x – 1].
Transcribed Image Text:3. Write the class Polynomial having a default constructor that initializes a private attribute “PolynomialNode head" to null. 4. In the Polynomial class, create the following methods: a. public boolean isEmpty(}{...}; returns true if the head list is empty. b. public void insert(int coef, int exp){..}; that modifies the linked list according to the following cases: i. If none of the nodes contain an equal exp value, then create a new PolynomialNode and insert it into the list that's arranged in a descending order based on the exponent. ii. If there exists a node having equal exp value, then add the coef to the node's coefficient. Note that if the coefficient is equal to zero then the node must be deleted. c. public void remove(){...}; removes the front node of the head list. d. public String toString0{...}; prints a given polynomial on the screen (for example the output string of the previous example is: 10x^3+5x^2+3x+5). e. public void add(Polynomial p){...}; sums the 2 given polynomials (this and p). The result will modify the Polynomial object that called the method. For example, the sum of the polynomials: [10x³ + 5x² + 3x + 5]-[3x3 – 7x? + 3x – 6]=[13x³ – 2x² + 6x – 1].
2. Linked Lists In this exercise, we will implement a Polynomial class to represent a polynomial equation using linked list where each node corresponds to a term cxº, where c is the coefficient and e is the exponent. The following is an example of the representation structure of the polynomial: 10x3 + 5x2 + 3x + 5 head 10 5 3 5 3 2 1 1. Write the class PolynomialNode that contains the fields coef and exp of type int and an attribute next that refers to the next node. 2. In the PolynomialNode class, write 3 constructors that are defined as follows: a. PolynomialNode(): initializes the coef and exp to 0, and next to null. b. PolynomialNode(int coef, int exp): assigns values coef and exp, and next to null. c. PolynomialNode(int coef,int exp,PolynomialNode next): assigns values coef, exp, and next.
Transcribed Image Text:2. Linked Lists In this exercise, we will implement a Polynomial class to represent a polynomial equation using linked list where each node corresponds to a term cxº, where c is the coefficient and e is the exponent. The following is an example of the representation structure of the polynomial: 10x3 + 5x2 + 3x + 5 head 10 5 3 5 3 2 1 1. Write the class PolynomialNode that contains the fields coef and exp of type int and an attribute next that refers to the next node. 2. In the PolynomialNode class, write 3 constructors that are defined as follows: a. PolynomialNode(): initializes the coef and exp to 0, and next to null. b. PolynomialNode(int coef, int exp): assigns values coef and exp, and next to null. c. PolynomialNode(int coef,int exp,PolynomialNode next): assigns values coef, exp, and next.
Expert Solution
steps

Step by step

Solved in 5 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Developing computer interface
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS