CSE 341: Programming Languages, Autumn 2002

(TENTATIVE) Topics to be Covered on Quiz 1

Scheme S-expressions
The READ-EVAL-PRINT loop
Conses and lists
Box and pointer diagrams
Referential transparency, side effects, and pure functions.
Scope and extent for the following kinds of bindings:
global bindings of symbols
local bindings of symbols
function bindings of symbols
The Scheme functions CONS, CAR, CDR, CADR, CDDR, NULL?, LIST?, +,- ,= , *, /, LIST, APPEND
Special forms and built-in macros IF, COND, QUOTE, DEFINE, LET, LET*, BEGIN
Defining one-way recursive functions that work on lists.
Defining two-way recursive functions that work on lists with embedded sublists.
LAMBDA, APPLY, MAP (as announced in class on Oct 14).
Type testing functions: SYMBOL?, NUMBER?, FUNCTION?, PAIR?, LIST?, STRING?