CSE 3401 Fall 2010 Class Schedule

Last updated 2010 December 10

Timetable

Follows the Faculty of Science & Engineering dates.

Class times: Section A: Tuesdays & Thursdays, 5:30pm to 7:00pm, location BC 215

Report and test due dates

Report 1      Tuesday, September 28 at the start of class
Report 2      Tuesday, October   19 at the start of class
Class Test 1  Tuesday, October   26
Report 3      Tuesday, November   2 at the start of class
Report 4      Tuesday, November  16 at the start of class
Class Test 2  Tuesday, November  23
Report 5      Thursday, December  9 at the start of class
Final exam    Thursday, December 23, 9-12, CLH 110

Miscellaneous important dates

First day of classes              Monday, September 13
Last day to enroll in the course  Sunday, September 26
Reading week (no classes)         October 11-15
Last day to drop the course       Friday, November 12
Last day of classes               Friday, December 10
Examination period                December 12 to 23 inclusive

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 14 & 16

Course overview. Using lisp interpreter, s-expressions, lists, atoms. Functions and scope of variables, conditional expressions, recursion , property lists

Readings: Wilensky, Chapters 1, 2, 15, 3; Notes on symbols and property lists
Slides:
- Administrvia Not worth printing, just for introductory class, contains pointers to the on-line information.
- What is symbolic computing
- Lisp and Prolog background
- Lisp structures
- Lisp basic operations
- Basics of using Lisp
- Lisp Programming

Week 2 -- September 21 & 23

Functional Programming, applying functions, defining functions to write functions.

Readings: Wilensky, Chapters 4, 6, 7; Notes on functionals
Slides:
- Supplementary slides on testing programs
- Functionals part 1
- Functionals part 2

Week 3 -- September 28 (Report 1 due) & 30

Functional programming, Lambda calculus

Readings: Wilensky, Chapters 8, 9; Notes on functionals
Slides:
- Lambda calculus
- How functionals can be developed

Week 4 -- October 5 & October 7

Functional programming; Flexible functions; Macros; Multiple value functions.

Readings: Wilensky, Chapters 12 & 13; Notes on lambda calculus
Slides:
- Flexible functions
- Macros
Multivalued functions

Week 5 -- October 19 (Report 2 due) & 21

Pattern matching, Database application

Readings: Wilensky, Chapters 12, 13, 16.4, 21
Slides:
- Patterns
Databases

Week 6 -- October 26 (Class test 1) & 28

Start Prolog

Readings: Wilensky, Chapter 22; Clocksin Chapters 1 & 2
Slides:
- Prolog introduction

Week 7 -- November 2 (Report 3 due) & November 4

Readings: Clocksin Chapters 3 & 4
Slides:
- Utility predicates
- Prolog examples

Week 8 -- November 9 & 11

Accumulators, Cut & not

Readings: Clocksin Chapters 3, 4
Slides:
- Accumulators
- Cut and not

Week 9 November 16 (Report 4 due) & 18

Readings: Clocksin Chapters 5.1-5.3, 9
Slides:
- Chat program

Week 10 November 23 (Class test 2) & 25

Grammars

Readings: Clocksin Chapter 9
Slides:
- Grammars and Prolog

Week 11 November 30 & December 2

Defining operators, Prolog examples programs: maze; binary tree insert and delete; quicksort; and maySteal showing use of compound terms.

Readings: Clocksin Chapters 5.5, 10
Slides:
- Defining operators
- Diagrams for the maze and binary tree example programs.

Week 12 -- December 7 & 9 (Report 5 due)

Resolution. Review of topics and questions chosen by students

Readings: Clocksin Chapter 7
Slides:
- Resolution & theorem proving

Subject to change