CS 115- Final Exam Guide - Comprehensive Notes for the exam ( 35 pages long!)

• School: University of Waterloo
• Department: Computer Science
• Course: CS115
• Professor: Lori Michelle Case

Document Summary

Topic included: introduction, the design recipes, new types of data, compound data and structures, lists, working with recursion. Functional language: computation of new values rather than the transformation of old ones. Examples: excel formulas, lisp, ml, haskell, mathematica, xslt, r. Racket: a functional programming language: used in education and research for over twenty years, minimal but powerful syntax, tools easy to construct from a few simple primitives, drracket, a helpful environment for learning to program. Using racket is like using a super pocket calculator. The simplest example is a number: i(cid:374)tege(cid:396)s i(cid:374) a(cid:272)ket a(cid:396)e u(cid:374)(cid:271)ou(cid:374)ded, atio(cid:374)al (cid:374)u(cid:373)(cid:271)e(cid:396)s a(cid:396)e (cid:396)ep(cid:396)ese(cid:374)ted e(cid:454)a(cid:272)tl(cid:455), e(cid:454)p(cid:396)essio(cid:374)s (cid:449)hose (cid:448)alues a(cid:396)e (cid:374)ot (cid:396)atio(cid:374)al (cid:374)u(cid:373)(cid:271)e(cid:396)s a(cid:396)e flagged as being inexact. We will not use these much (if at all) 1. 2. 1 definition f(x) = x2, g(x, y) = x + y. These definitions consist of: the (cid:374)a(cid:373)e of the fu(cid:374)(cid:272)tio(cid:374) (cid:894)e. g. g(cid:895, its pa(cid:396)a(cid:373)ete(cid:396)s (e. g. x, y, a(cid:374) mathematic expression using the parameters.