CSE 1729 Study Guide - Fall 2018, Comprehensive Term Test Notes - Recursion, Binary Search Tree, Modular Arithmetic

• School: UConn
• Department: Computer Science and Engineering
• Course: CSE 1729
• Professor: Gregory Johnson

Document Summary

Lecture 2 notes: programs are built during a dialog w interpreter. > 198: in scheme, compound expressions have the form ( . > (+ (* 4 5) (* 4 245): eval 4 5, apply * 4 5 -> 20, then eval and apply the other set of parentheses, add both values. Binding variables to values: our first example of abstraction, involves a special form: define, the form: (define , binds the variable to the val obtained by eval. 7: the define special form can also be used to define new functions, the syntax is the following: (define ( ) body, thus, : the expression is evaluated, if it evals to #t, is evaluated, and its val is returned. Otherwise is eval and its val is returned. Conditionals via if: simple conditionals are implemented by the if special form (if