assignment eight: 

This assignment is intended to provide a review of the issues that we have been working on until now and is intended to better understand how to find and re-use algorithms. I would like you to work alone on this assignment but, as always, if you do consult with anyone, please list them in your acknowledgements. Read the Abelson and DiSessa chapter on the topic of "Turtle Geometry." Now pick three of the examples from their chapter and implement them using the dbn logo_commands. The only example that you should not pick, is the one that we've already done -- namely, the implementation of the recursive tree drawing program. Upload your assignment and send me email when you are done. Note that this assignment is not due until Monday, Feb. 10th.