Program 3

Lab Partners

Everyone is encouraged to work with one lab partner on this assignment. If you do work with a partner, submit one solution with both of your names on it. Also, please look at the class collaboration policy so that you know what is and what isn't allowed.

Introduction

In this program, we are going to construct a tool that can be used to manipulate two polynomials. Specifically, we are interested in being able to add two polynomials and to multiply two polynomials.

Provide the user a text-based menu (or optionally, a GUI) with the following options:

1. The user should be able to enter a value for polynomial 1. Initially, polynomial 1 is 0. You may assume that the user will only enter valid polynomials according to the rules below.
2. The user should be able to enter a value for polynomial 2. Initially, polynomial 2 is 0. You may assume that the user will only enter valid polynomials according to the rules below.
3. The user should be able to add the two polynomials and print the result of the addition.
4. The user should be able to multiply the two polynomials and print the result of the multiplication.
5. The user should be able to quit.

Terminology

Consider the polynomial 3n^2 - 11n^1. 3n^2 is a term as is - 11n^1. 3 and -11 are coefficients. 2 and 1 and degrees.

Input/Output Format for a Polynomial

When a polynomial is input or printed, only non-zero coefficients should appear. The terms of the polynomial should appear in descending degree order. Here are three examples of legal polynomials:

• - 3n^100 + 200n^50 - 7n^1 + 13n^0
• 3n^100 + 200n^50 - 7n + 13
• + 3n^100 + 13

• 2n^5 + 3n^5 (each degree should only appear once)
• 0n^7 (terms with a 0 coefficient should not appear)
• 7n^5 + 2n^19 (the degrees 5 and 19 must appear in descending order)
• 2n^5 + -3 (it should be 2n^5 - 3)

Your program may assume that all "+"s and "-"s are surrounded by one or more empty spaces. Your program may also assume that the only variable that appears in a polynomial is n.

One Example

• Polynomial 1: 3n^3 + 2n^1 + 4n^0
• Polynomial 2: 5n^2 - 2n^1 - 17
• Adding: 3n^3 + 5n^2 - 13n^0
• Multiplying: 15n^5 - 6n^4 - 41n^3 + 16n^2 - 42n^1 - 68n^0

Required Representation

You must have a class named Polynomial that represents a polynomial using a linked list. You may either use a built-in linked list class or you may implement your own.

Grading

• 10%. The menu works correctly and the output of the program is well-formatted.
• 40%. Addition works correctly.
• 30%. Multiplication works correctly.
• 20%. The solution is elegant. This includes factors such as Javadoc comments, efficient code, etc.

What to Submit

E-mail your code to Mike Thiesen at mthiesen@gmail.com in one message before the due date. Zip your relevant BlueJ folder up so that you only need to send Mike one file. The subject of the message should be: CS221-xx program3 your-names. The xx is the number of your lab section. Late programs will not be accepted for credit. If you aren't finished by the deadline, submit whatever you have - partial credit is possible.