Study tips for COSC 3410 Final Exam

The exam will be in our usual classroom on Wed, Dec 16, 2009 at 1:00PM.

The test may include any topics which we've discussed throughout the semester.
Those include the following book sections:

Little Schemer, Chap 1, 2, 3, 5, and beginning of 8.

EOPL, Sections 1.1-1.3, 2.1-2.5, 3.1-3.5, 4.1-4.5, 5.1, 5.4,
      7.1-7.3, and beginning of 7.4.
      
I might ask questions about the design or operation of the various homework
assignments.

You should also be familiar with the various examples which we discussed in
class.  These can be found on the website at the "Functions defined during class"
link.

In particular, you should be able to read and write:

simple Scheme expressions
recursive functions taking a list as parameter and returning a value
[e.g. member, sum]
functions taking a list as parameter and returning a list
[remove, firsts, subst]
functions which recurse on both car and cdr of a list
[subst*, eqlist*, flatten, deep-reverse]
functions with more than one list as parameter
[zip, eqlist*]
functions which take other functions as parameters and/or return functions
 as return values. [map, rember-f, every?, mk-incrementer]

You should understand generally how value-of/k and apply-cont work together
to evaluate an expression in the continuation-passing interpreter.

Should be able to read and write simple programs in our class project language
and/or in the book's letrec language.

Here are some exercises from Essentials of Programming Languages that are similar
to other possible exam questions:

p.8 #1.4				p.16 #1.6
p.18 #1.8, 1.9				p.22 #1.11
p.26-29 #1.16, 1.19, 1.21, 1.24, 1.33
p.34 #2.3				p.39 #2.8
p.42 #2.12				p.50 #2.22, 2.26
p.70 #3.4				p.73 #3.9, 3.14
p.87 #3.37				p.106 #4.1
p.109 #4.6, 4.7				p.121 #4.15
p.128 #4.29				p.133 #4.35
p.138 #4.38				p.237 #7.1
p.258 #7.12