Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Lab 3 Directions (linked lists) Program #1 1. Show PolynomialADT interface 2. Create the PolyNodeClass with the following methods: default constructor, overloaded constructor, copy constructor, set Coefficient, setExponent, setNext, getCoefficient, getExponent, getNext 3. Create the Polynomial DataStrucClass with the following methods: default constructor, overloaded constructor, copy constructor, isEmpty, setFirstNode, get FirstNode, addPolyNodeFirst (PolyNode is created and set to beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is set to the end of polynomial), addPolynomials, toString 4. Create the Polynomial DemoClass: instantiate and initialize Polynomial Data StrucClass objects p1, p2, p3, p4 - - Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent-for example: p1.addPolyNodeLast(4, 3);) Print out p1, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: p1= 4x^3 + 3x^2 - 5 : p2 = 3x^5 + 4x^4 + x^3 - 4x^2 + 4x^1 + 2 AND p3= -5x^0 + 3x^2 + 4x^3; p4 = -4x^0 + 4x^3 + 5x^4

Lab 3 Directions (linked lists) Program #1 1. Show PolynomialADT interface 2. Create the PolyNodeClass with the following methods: default constructor, overloaded constructor, copy constructor, set Coefficient, setExponent, setNext, getCoefficient, getExponent, getNext 3. Create the Polynomial DataStrucClass with the following methods: default constructor, overloaded constructor, copy constructor, isEmpty, setFirstNode, get FirstNode, addPolyNodeFirst (PolyNode is created and set to beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is set to the end of polynomial), addPolynomials, toString 4. Create the Polynomial DemoClass: instantiate and initialize Polynomial Data StrucClass objects p1, p2, p3, p4 - - Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent-for example: p1.addPolyNodeLast(4, 3);) Print out p1, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: p1= 4x^3 + 3x^2 - 5 : p2 = 3x^5 + 4x^4 + x^3 - 4x^2 + 4x^1 + 2 AND p3= -5x^0 + 3x^2 + 4x^3; p4 = -4x^0 + 4x^3 + 5x^4

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

The main question is the entire page labeled Program #1, the little screenshot is for extra steps. The program has to be written in Java.

### Lab 3 Directions (Linked Lists) #### Program #1 1. **Show PolynomialADT Interface** 2. **Create the PolyNodeClass** with the following methods: - Default constructor - Overloaded constructor - Copy constructor - `setCoefficient` - `setExponent` - `setNext` - `getCoefficient` - `getExponent` - `getNext` 3. **Create the PolynomialDataStrucClass** with the following methods: - Default constructor - Overloaded constructor - Copy constructor - `isEmpty` - `setFirstNode` - `getFirstNode` - `addPolyNodeFirst` (PolyNode is created and set to the beginning of polynomial) - `addPolyNodeLast` (addPolyNode: PolyNode is set to the end of polynomial) - `addPolynomials` - `toString` 4. **Create the PolynomialDemoClass**: - Instantiate and initialize PolynomialDataStrucClass objects `p1`, `p2`, `p3`, `p4` - Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent) - Example: `p1.addPolyNodeLast(4, 3);` - Print out: - `p1`, `p2` and sum of the polynomials - `p3`, `p4` and sum of the polynomials **Use:** - `p1 = 4x^3 + 3x^2 - 5` - `p2 = 3x^5 + 4x^4 + x^3 - 4x^2 + 4x^1 + 2` **AND** - `p3 = -5x^0 + 3x^2 + 4x^3` - `p4 = -4x^0 + 4x^3 + 5x^4` This lab will guide you through creating and manipulating polynomials using linked lists, reinforcing your understanding of data structures and object-oriented programming principles.
Transcribed Image Text:### Lab 3 Directions (Linked Lists) #### Program #1 1. **Show PolynomialADT Interface** 2. **Create the PolyNodeClass** with the following methods: - Default constructor - Overloaded constructor - Copy constructor - `setCoefficient` - `setExponent` - `setNext` - `getCoefficient` - `getExponent` - `getNext` 3. **Create the PolynomialDataStrucClass** with the following methods: - Default constructor - Overloaded constructor - Copy constructor - `isEmpty` - `setFirstNode` - `getFirstNode` - `addPolyNodeFirst` (PolyNode is created and set to the beginning of polynomial) - `addPolyNodeLast` (addPolyNode: PolyNode is set to the end of polynomial) - `addPolynomials` - `toString` 4. **Create the PolynomialDemoClass**: - Instantiate and initialize PolynomialDataStrucClass objects `p1`, `p2`, `p3`, `p4` - Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent) - Example: `p1.addPolyNodeLast(4, 3);` - Print out: - `p1`, `p2` and sum of the polynomials - `p3`, `p4` and sum of the polynomials **Use:** - `p1 = 4x^3 + 3x^2 - 5` - `p2 = 3x^5 + 4x^4 + x^3 - 4x^2 + 4x^1 + 2` **AND** - `p3 = -5x^0 + 3x^2 + 4x^3` - `p4 = -4x^0 + 4x^3 + 5x^4` This lab will guide you through creating and manipulating polynomials using linked lists, reinforcing your understanding of data structures and object-oriented programming principles.
### Understanding Polynomials as Linked Lists A polynomial can be represented as a linked list, where each node, referred to as a polyNode, contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial \(4x^3 + 3x^2 - 5\) would be represented as the linked list: #### Detailed Diagram Explanation - The first node contains: - Coefficient: \( 4 \) - Exponent: \( 3 \) This represents the term \( 4x^3 \). The node points to the next node in the list. - The second node contains: - Coefficient: \( 3 \) - Exponent: \( 2 \) This represents the term \( 3x^2 \). This node points to the next node as well. - The third node contains: - Coefficient: \( -5 \) - Exponent: \( 0 \) (since \( x^0 \) is \( 1 \)) This represents the term \( -5 \). This node does not point to any further node as it is the last term in the polynomial. ![Linked List Representation](linked_list.png) ### Programming Tasks - **Write a Polynomial class:** - This class should have methods for: - Creating a polynomial. - Reading a polynomial. - Adding a pair of polynomials. - **Adding Polynomials:** - To add two polynomials, traverse both lists. - If a particular exponent value is present in either polynomial, it should also be present in the resulting polynomial unless its coefficient is zero. By leveraging the linked list representation for polynomials, the polynomial operations can be performed efficiently and in an organized manner that aligns with data structure principles.
Transcribed Image Text:### Understanding Polynomials as Linked Lists A polynomial can be represented as a linked list, where each node, referred to as a polyNode, contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial \(4x^3 + 3x^2 - 5\) would be represented as the linked list: #### Detailed Diagram Explanation - The first node contains: - Coefficient: \( 4 \) - Exponent: \( 3 \) This represents the term \( 4x^3 \). The node points to the next node in the list. - The second node contains: - Coefficient: \( 3 \) - Exponent: \( 2 \) This represents the term \( 3x^2 \). This node points to the next node as well. - The third node contains: - Coefficient: \( -5 \) - Exponent: \( 0 \) (since \( x^0 \) is \( 1 \)) This represents the term \( -5 \). This node does not point to any further node as it is the last term in the polynomial. ![Linked List Representation](linked_list.png) ### Programming Tasks - **Write a Polynomial class:** - This class should have methods for: - Creating a polynomial. - Reading a polynomial. - Adding a pair of polynomials. - **Adding Polynomials:** - To add two polynomials, traverse both lists. - If a particular exponent value is present in either polynomial, it should also be present in the resulting polynomial unless its coefficient is zero. By leveraging the linked list representation for polynomials, the polynomial operations can be performed efficiently and in an organized manner that aligns with data structure principles.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 7 steps with 7 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Declaring and Defining the Function
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
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