Assignment 2 information

• [9/14] It seems that the server for the web tester was down starting sometime yesterday evening. I see that there are many solutions in the AFS directory, so presumably everyone was able to turn in their solution one way or the other.

• [9/13] Due to problems/confusion with the Assignment 2 submission process, everyone gets the automatic extension until midnight tonight. If due to recent events you need a further extension, you can email me a request with a brief explanation. (Or, you can go to the Dean of Students office and get a letter from them if you prefer.)

  CS account passwords should be going out this afternoon (really, this time), so you should be able to use the web tester, but you can also submit to the AFS directory. If you've submitted to the AFS directory, you don't have to resubmit to the web tester but you certainly may do so in order to get some immediate feedback.

• [9/13] Please see new instructions for submitting Assignment 2 if you do not have a CS account on the Assignment 2 Submission page.

• [9/12] For problem 5b, name your procedure cfrac-approx. (The example later in that paragraph calls it something else.)

• [9/12] Please note that I am restricting the use of advanced Scheme constructs for this assignment. You can use any Scheme form covered in the handouts so far. See the (revised) Assignment 2 Submission page for details.

• [9/11] The web tester is up! Go to the Assignment 2 Submission page.

• [9/11] The web tester should be up later today. You'll need a CS account to authenticate the server. You should have received a password by email yesterday (sent to your RCS account). If you have not, please contact the TA (konez@cs.rpi.edu).

• [9/11] For problem 7, one-to-n is the only recursive procedure you may call. Another hint for this problem is that you will have to use apply and lambda to solve the problem with the restrictions on recursion.

• [9/11] Problem 8 is "starred" and is only worth 5 points because it is a more challenging problem. I am not providing any other hints on this problem (other than to say that you need to figure out how to solve it recursively and/or with map or apply).

• [9/9] For problem 5, your procedure will probably return a rational number (i.e. a fraction). If you want it to return a decimal number, you can put a decimal number (for example 1. or 1.0) in your calculation, or you can use the procedure exact->inexact. The web tester will accept both rational and decimal numbers.

• [9/9] For problem 7, name your procedure m-positions. (The problem text and the example are inconsistent.)

• [9/6] For your convenience, I've put the problems for Assignment 2 from "How to Solve Problems Using Scheme" online: postscript, pdf.

• [9/6] I am expecting to have the electronic submission stuff set up hopefully by the end of the week; by Monday at the latest.