Quiz 1 will cover the following topics in Lisp.


Lisp interaction (read-eval-print loop)

S-expressions:
 Atoms: Symbols and numbers
 the symbol NIL
 Conses (including dotted pairs -- pp.76-77)
 Box-and-pointer diagrams for drawing list 
     structures (e.g., Figs 2.4, 2.5)
 Lists
 Evaluation:
   of symbols, numbers,
   functional forms, and
   special forms.
 Special forms:
   QUOTE
   SETQ
   IF
   COND
   PROGN
   LET
   LET*
 List construction with CONS, LIST and APPEND.
 List access with CAR, FIRST, CDR, REST, SECOND, LAST, CADR, CDDR.
 Predicates: ATOM, NULL, SYMBOLP, NUMBERP, CONSP, EQUAL,
 Arithmetic functions +, *, -, /, 1+, 1-, <, =, >.
 DEFUN and defining recursive functions that operate on lists.
  Also doubly recursive functions (that operate on trees).
 Explicit application of functions using APPLY and MAPCAR.
 Bindings, Scope and extent of bindings.
 Closures (pp.54-55)
 Arrays,  Strings in Lisp (pp.66-68).


Also, you may be asked a question on characteristics 
of an "intelligent" system.