Last updated 2009 December 3
Class Schedule
The class schedule is a guide to topics that will be discussed
and when they will be discussed on a weekly basis. The week begins on a Thursday.
All slide sets are files. To save paper and ink, I suggest you do not print slides too far in advance and not before the course begins as changes may be made.
Week 1 --- September 10 & 15
Course overview. Using lisp interpreter, s-expressions, lists, atoms.
Functions and scope of variables, conditional expressions, recursion , property lists
Week 2 --- September 17 & 22
Functional Programming, applying functions, defining functions to write
functions.
Week 3 --- September 24 (Report 1 due) & 29
Functional programming, Lambda calculus
Week 4 --- October 1 & 6
Functional programming, Flexible functions, Macros
- Readings: Wilensky, Chapters 8, 9, 13; Notes on lambda calculus
- Slides:
Week 5 --- October 8 (Report 2 due) & 20
Multiple value functions; Pattern matching
- Readings: Wilensky, Chapters 12, 13, 16.4, 21
- Slides:
Week 6 --- October 22 (Class test 1) & 27
Database application, Start Prolog
- Readings: Wilensky, Chapter 22; Clocksin Chapters 1 & 2
- Slides:
Week 7 --- October 29 (Report 3 due) & November 3
Week 8 --- November 5 & 10
Prolog programming - utility predicates and accumulators
- Readings: Clocksin Chapters 3, 4
- Slides:
Week 9 November 12 (Report 4 due) & 17
Accumulators, Cut & not
- Readings: Clocksin Chapters 5.1-5.3, 9
- Slides:
Week 10 November 19 (Class test 2) & 24
Grammars
Week 11 November 26 & December 1
Defining operators, Resolution
- Readings: Clocksin Chapters 5.5, 10
- Slides:
Week 12 --- December 3 & 8 (Report 5 due)
Prolog examples programs. Review of topics and questions chosen by students
- Readings: Clocksin Chapter 7
- Slides:
- Diagrams for the
maze and binary tree example programs.
| Subject to change
|
|