210 Lecture Notes


Schedule

Here's a sample schedule, based on the Fall 2000 class. It roughly describes where the class will go. We will deviate from it (undoubtedly).


Spring 2000 Lecture Notes

These are, literally, the notes from which I lecture. They do not, of course, contain everything said in class. They are not a substitute for attendance.

  1. The introductory lecture; includes all sorts of adminstrative detail, along with some technical content.
  2. Building & testing small programs
  3. Conditionals, with a take-home problem
  4. Natural Numbers and Recursion
  5. On Beyond Numbers
  6. Adding More Structure
  7. Lists, more lists, and even more lists
  8. Programming with lists, again includes review material not covered in the lecture.
  9. Even more tricks with lists

    The first exam, in class on Wednesday 2/16/2000, will cover the contents of the first 9 lectures (review at beginning of lecture 10), the lab lectures through lab lecture 3 (this week) the homeworks (assignment 0 and 1), and Sections 1-7, & 9-11 of the book.

    The exam will be closed-book and closed-notes. It should last roughly 50 minutes.

  10. Lists with mixed data, plus three lines that summarize the exam material.
  11. Beyond lists and into family trees
  12. Moving Beyond Lists
  13. Even More Family Trees
  14. The Last Family Tree
  15. Files, directories, folders, and all that ...
  16. Working with Two Complicated Arguments
  17. Introducing Local
  18. Hammering Home Local

    The second exam, a take home available in class on 3/17/00 and due back on 3/22/00 at 5pm, covers the material through lecture 18, including book sections through Intermezzo 3, all of the homeworks, and the various laboratory lectures.

  19. Functional Abstraction
  20. More on Functional Abstraction
  21. From Lambda to Quicksort
  22. Generative Recursion--Quicksort & Sierpinski
  23. More Generative Recursion (the truncated lecture)
  24. Termination Conditions
  25. Graphs, Paths, ...
  26. Accumulators, part I and the transparencies that accompany it
  27. More programs with accumulators
  28. Converting to use an accumulator
  29. Accumulators on trees
  30. Memoization as an introduction to side effects
  31. Modifying structure elements
  32. More fun with set! and set-structure! and the slides
  33. Vectors (and set! for vectors) and the slides
  34. The Search for Identity
    The third exam, a take home available in class on 4/21/00 covers the contents of lectures 19 through 34, the homeworks, and the lab lectures since the second exam. You are also responsible for the rest of the material in the book (from Intermezzo 3 to the end).

Information about the first exam


This page maintained by Keith D. Cooper.