CS115 Final: Module 1 - Module 5 The notes combines the lecture notes and the useful information in the textbook. It covers module 1 through to module 5 with all definitions, operations and examples you need.

• School: University of Waterloo
• Department: Computer Science
• Course: CS115
• Professor: Sandy Graham

Document Summary

How to design programs course notes by: ella chen. Every scheme expression is in the form (operation a b). Examples on mathematical operations: (sqrt a): square root of a (expt a b): a^b (remainder a b): remainder of a/b (quotient a b): quotient of a/b (log a): natural logarithm of a (sin a): sine of a radians. E. g. (define (area-of-circle r) (* 3. 14 (* r r)) Characteristics of fuctions: (define (function-name variable1 variable2 ) (expression)) Changing names of parameters does not change what the function does. The same parameter name can be used in different functions. The order of arguments must match the order of the parameters in the definition of the function. A step-by-step simplification by applying substitution rules. E. g. (define (term x y) (* x (sqr y))) (term (- 5 3) (+ 1 2)) => (term 2 (+ 1 2)) The data type image (you need the world. rkt teachpack) (define image1 (rectangle 35 50 solid red))