Rice University

COMP 210: Principles of Scientific Computing

Lecture Notes



Notice

These are, in general, the notes from which I lecture. They are fairly complete. They are not, however, a substitute for attending class, attending lab lecture, and reading the book.


Lectures

  1. Introduction and Administrative Material
  2. Expressions to Simple Scheme Programs
  3. Conditional Logic
  4. Moving Beyond Numbers
  5. Adding More Structure (and founding JetSet Air)
  6. Lists
  7. More Lists
  8. Even More Tricks with Lists
  9. Lists of Mixed Type, plus Intro to Family Trees
  10. Family Trees, Part 2 and the Slides for it (with information about the first exam)
    The second exam will begin with the material on Family Trees.

  11. Natural Numbers, plus an Intro to Parent-centric Family Trees, the Slides for Lecture 11

  12. The first exam from Fall 2000 (Last time I taught 210)
  13. Rough notes from the tutorial


  14. Parent-centric Family Trees, the PowerPoint slides
  15. Modeling Directories and Files and the PowerPoint slides
  16. Programs with Multiple Complicated Arguments and the PowerPoint slides
    Warning: develop the program merge from the template for next class.

  17. Finishing up Programs with Multiple Complicated Arguments and the PowerPoint slides
  18. Taking the max of a list, the PowerPoint slides
  19. Introducing local, the PowerPoint slides
  20. Hammering Home Local, the PowerPoint Slides, the code for IsIn?, and the code for Intersect
  21. Tim gave a lecture leading up to functional abstraction (Friday 3/1/2002). He worked (roughly) from these notes.
  22. Functional abstraction, the PowerPoint Slides
  23. More functional abstraction, the PowerPoint Slides
  24. Wrap up for exam 2, plus Introduction to Generative recursion: the PowerPoint Slides (includes quicksort) and the code


    The second exam covers material in the book through Intermezzo 4, along with all lecture notes up to this point. It covers lecture notes numbered 14 through 24 on this page, along with some of lecture 11. It also covers the corresponding lab lecture notes.

  25. The second exam from Fall 2000 for practice


  26. More generative recursion: the PowerPoint Slides
  27. Finishing up hi-lo: the PowerPoint Slides and the Scheme code
  28. Graph problems: Find-flights and the Scheme code
  29. More work with accumulators: writing reverse, the PowerPoint slides and the Scheme code
    (Note: the lecture notes have been revised to make the material less opaque!)
  30. Finishing up accumulators: max with an accumulator, the PowerPoint slides and the Scheme code
  31. Accumulators on trees: the PowerPoint slides the Scheme code for versions of max and for versions of largest.
  32. Memo-functions: the PowerPoint slides and the Scheme code
  33. Finishing up memo-functions and set!; start of address-book the PowerPoint slides and the Scheme code
  34. Changing address-book entries: the PowerPoint slides and the Scheme code
  35. Finishing up data-hiding: the PowerPoint slides
  36. The search for identity: the PowerPoint slides
  37. Vectors, part 1: the PowerPoint slides
  38. Vectors, part 2: the PowerPoint slides


    The third exam covers material in the book from sections 25 to 43, along with all lectures since the second exam. It also covers the corresponding lab lecture notes.

  39. The third exam from Fall 2000 for practice





Questions about this site should be posted to the class newsgroup.