Since deal returns a list containing two sublists, both of which are needed when we express our goal in terms of the natural recursion, we need to use let to bind a parameter to that list to use it twice without recomputing it. On each recursive pass, two elements are removed from the list ls and one is placed in each of the sublists. The latter two files contain the primitites for two different representations of polynomials, and the first contains representation independent definitions of the procedures that operate on polynomials. In this exercise, you are asked to write a representation independent definition of a procedure that finds the quotient and remainder of two polynomials. Then load poly-rep2.ss and run them again to see if they are really representation independent.
Polynomial division is similar to long division of integers.
If the degree of R is less than the degree of B , R is the remainder. Otherwise we repeat this process using R and B , adding the result of dividing their leading terms to the quotient, etc. Store the terms of the quotient in quot and when the remainder R is found, form a list containing quot and R . This assignment contains six exercises, with 76 electronic points and 22 manual points, for a total of 98 points. For the file you are handing in, enter the name of the file in which you have saved your answers.