You will notice that there are no comments in any of the code you are being given. Part of your assignment is to go read and understand this code. Remember that you are not allowed to change any of the existing code, but must integrate your new code into it. Further, a Polynomial can have at most 50 terms. For the code you add you do not need to protect against overflow conditions when performing additions or multiplications.
Spaces are important.
Terms of Polynomials should be printed in descending order of the degree of each term. Negative coefficients must be handled with care to conform to the spacing requirements demonstrated in the examples above. The final determination if your code works will be made by compiling and testing it on a Digital Unix Alpha Workstation. The isua machines are a good choice for doing this remotely, or you can use machines in 139 or 248 Durham among others. C Polynomial.o where driver.