Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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 beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is set to the end of polynomial), addPolynomials, toString 4. Create the PolynomialDemoClass: instantiate and initialize PolynomialDataStrucClass objects pl, p2, p3, p4 - Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent- for example: pl.addPolyNodeLast(4, 3);) - Print out pl, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: pl= 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, 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 beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is set to the end of polynomial), addPolynomials, toString 4. Create the PolynomialDemoClass: instantiate and initialize PolynomialDataStrucClass objects pl, p2, p3, p4 - Add terms to the polynomials (pass 2 arguments to the method: coefficient and exponent- for example: pl.addPolyNodeLast(4, 3);) - Print out pl, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: pl= 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

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Its a java data structures class. Lab dire is also given on second page. Thank you
CSC 236 - Lab 3 (2 programs) LLL 1. A polynomial can be represented as a linked list, where each node called a polyNode contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial 4x + 3x² - 5 would be represented as the linked list: 41 3 3x2 - 5x° Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials. In order to add 2 polynomials, traverse both lists. If a particular exponent value is present in either one, it should also be present in the resulting polynomial unless its coefficient is zero.
Transcribed Image Text:CSC 236 - Lab 3 (2 programs) LLL 1. A polynomial can be represented as a linked list, where each node called a polyNode contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial 4x + 3x² - 5 would be represented as the linked list: 41 3 3x2 - 5x° Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials. In order to add 2 polynomials, traverse both lists. If a particular exponent value is present in either one, it should also be present in the resulting polynomial unless its coefficient is zero.
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 beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is set to the end of polynomial), ring nomials, 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- for example: pl.addPolyNodeLast(4, 3);) - Print out p1, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: pl= 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
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 beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is set to the end of polynomial), ring nomials, 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- for example: pl.addPolyNodeLast(4, 3);) - Print out p1, p2 and sum of the polynomials AND p3, p4, and sum of the polynomials Use: pl= 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
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS