Fundamentals of Computer Science 1 (CS151 2003S)

Class 25: Simulation

Back to Local Procedure Bindings. On to Pairs.

Held: Monday, 3 March 2003

Summary: Today we consider how to make Scheme simulate potentially unpredictable events, like the rolling of dice or the flipping of coins.

Related Pages:









Thursday, 16 January 2003 [Samuel A. Rebelsky]


Back to Local Procedure Bindings. On to Pairs.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Tue May 6 09:29:56 2003.
The source to the document was last modified on Thu Jan 16 13:45:58 2003.
This document may be found at

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky,