Scheme

Question 1

Scheme

Answer 1

• functional language
• dynamically typed (run time)
• lists are primary data structure
• everything is an expression that yields a value (no stmts, prefix notation)

Question 2

Scheme conditionals

Answer 2

if (if-then-else)

cond (switch, or sequence of if-then-elses)

Question 3

booleans

Answer 3

t and #f

Question 4

let

Answer 4

evaluates all expressions first, then binds

Question 5

let*

Answer 5

evaluates one expression at a time and binds

Question 6

quoting

Answer 6

used to treat expressions as data

Question 7

(cadr x)

Answer 7

(car(cdr x))

Question 8

(cddr x)

Answer 8

(cdr(cdr x))

Question 9

(caddr x)

Answer 9

(car(cdr(cdr x)))