polynomial-f11

polynomial-f11 - University of Arizona CSc345 (Fall 2011;...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
University of Arizona CSc345 (Fall 2011; B. Moon) CSc 345 Programming Assignment #1 ADT for Polynomials Problem Statement For this programming assignment, we define an abstract data type (ADT) for single-variable polynomials. A poly- nomial has zero or more terms, each of which consists of an integer coefficient and an integer exponent. This ADT defines methods for addition and subtraction operations on polynomials as well as constructors and other methods. You are to write a Java application that implements the Polynomial ADT. A skeleton of the ADT is provided in the D2L site. The skeleton file is named PolynomialSkel.java . You can copy it to your working directory and rename it to Polynomial.java . You should then provide implementations of all the methods defined in the class skeleton. You can add more methods as you wish, but are not allowed to remove any method defined in the class skeleton. No
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

polynomial-f11 - University of Arizona CSc345 (Fall 2011;...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online