Final grades posted. You can look at examinations in Professor Borgida's office.

December 16: LAST MINUTE OFFICE HOURS: for those who care, I will be available Monday, December 17, from 1:30 to 3. Come to my office (core 315), where there may be a sign directing you to another room.

Here are the midterm grades ordered by last 5 digits of student number. The exams will be returned in recitation. (FYI, 25% of the exams were over 190, 50% of the exams were over 155, and 75% were over 116.)

Some of these lecture notes are just that: notes for the instructor on what topics to discuss during the lecture. Others are more detailed descriptions of all the issues to discuss in a lecture. Both kinds are posted here mostly because students have often requested them as a *guide to the topics* covered in the lecture, and hence on the exam. They often do not corrrespond exactly to the material covered in lecture, because, in my opinion, in a good lecture students ask questions that lead us off into some tangent in order to better understand some topic through examples.

• Introduction
• Regular Expressions and Automata {Typos: slide 3: last row of table should read "S2 S1 S1" }
• Prolog and Logic programming:
  • Lecture 1: database, queries, rules
  • Lecture 2: tracing, lists
  • Lecture 3: more lists, generate-and-test paradigm, structures
• Imperative programming/C:
  • Lecture 1: Memory Management (static, stack frames, heap); control flow;
  • Lecture 2 C: pointers, structures
  • Lecture 3 C: arrays, pointer arithmetic, more structures {Typos: slide 21: "if found return -1" (not 0) }
• Procedures:
  • Lecture 1: scope rules
  • Lecture 2: parameter passing
• Object-oriented programming in C++
  • Lecture 1 : Abstract data types and classes
  • Lecture 2 : Subclasses, inheritance and reuse.
• Types and type checking: lecture 1, lecture 2
• Scheme. (Note: I did almost a whole lecture without slides, just examples.) (Lecure 1) (Lecure 2) (Lecure 3)
• Syntax of Programming Languages (Lecures 1&2.pdf)
• Concurrency Lecture 1, Lecture 2,
• Exceptions (not responsible for this on exam): Lecture 1