Rice University
Comp 200 lectures
2001.spring


These are my personal notes from which i prepare lectures; hopefully they're useful for you, but you'll probably find cryptic bits in them that make sense only to me. Also, there are sometimes asides in the notes that aren't mentioned in class. No, you aren't responsible for knowing those (but they're interesting anyway!)

Lecture notes finalized for Spring '01.

  1. 2001.jan.17 (wed) What is CS?, overview
  2. 2001.jan.19 (fri) Scheme is just arithmetic

  3. 2001.jan.22 (mon) More Scheme; booleans
  4. 2001.jan.24 (wed) Albums (lists of fixed length) (in lab)
  5. 2001.jan.26 (fri) Album inventories: handling lists of any length

  6. 2001.jan.29 (mon) functions handling lists
  7. 2001.jan.31 (wed) practice w lists
  8. 2001.feb.groundhog (fri) counting; numbers

  9. 2001.feb.05 (mon) The Law of Scheme; drawing
  10. 2001.feb.07 (wed) drawing (cont.)
  11. 2001.feb.09 (fri) Drawing Fractals (snowflake curve)

  12. 2001.feb.12 (mon) What's a "fractional dimension"? nod
  13. 2001.feb.14 (wed) family trees
  14. 2001.feb.16 (fri) counting: trees

  15. 2001.feb.19 (mon) numbers vs numerals; binary numerals; quoting; ?? (see lect.14)
  16. 2001.feb.21 (wed) decision trees; computation trees (see lect.14)
  17. 2001.feb.23 (fri) comparing algorithms I: Running time of insert-sort

  18. 2001.feb.26 (mon) mergesort; big-Oh
  19. 2001.feb.28 (wed) Symonds: measuring algorithms
  20. 2001.mar.02 (fri) lower bound on sorting;

  21. 2001.mar.05 (mon) Spring Break!
  22. 2001.mar.07 (wed) Spring Break!
  23. 2001.mar.09 (fri) Spring Break!

  24. 2001.mar.12 (mon) Reductions; NP; HamPath <= TSP
  25. 2001.mar.14 (wed) (continued) HamPath <= Monkey; NPC
  26. 2001.mar.16 (fri) Halting Problem

  27. 2001.mar.19 (mon) virus; DNA computing
  28. 2001.mar.21 (wed) neural nets
  29. 2001.mar.23 (fri) strong vs weak AI

  30. 2001.mar.26 (mon) Genetic Algorithms [ oops, cancelled ]
  31. 2001.mar.28 (wed) randomness in algorithms
  32. 2001.mar.30 (fri) homework discussion; public-key cryptography (ps)

  33. 2001.apr.02 (mon) public-key cryptography (ps), cont.
  34. 2001.apr.04 (wed) computers on the line
  35. 2001.apr.06 (fri)

  36. 2001.apr.09 (mon) assembly: jelly2000
  37. 2001.apr.11 (wed) (cont.)
  38. 2001.apr.13 (fri) Spring Recess

  39. 2001.apr.16 (mon) (cont.)
  40. 2001.apr.18 (wed) circuits: AND, OR, NOT
  41. 2001.apr.20 (fri) circuits: building blocks; 1-of-3

  42. 2001.apr.23 (mon) circuits: adding!
  43. 2001.apr.25 (wed) circuits w/ feedback: memory
  44. 2001.apr.27 (fri) a brief history

    45. Lecture notes from Spring '00,
    not fully covered so far in '01. While the material covered last year is largely similar, I'm always tinkering with details, and may also swap other sections in and out. So though this is only tentative, it should also be helpful.

  45. what are trees like; numbers vs numerals 00.feb.21 (mon)
  46. decision trees 00.feb.23 (wed)
  47. comparing different algorithms 00.feb.25 (fri)

  48. comparing different algorithms II: sorting 00.feb.16 (mon)
  49. measuring algorithms in Symonds 00.mar.01 (wed)
  50. a lower bound on sorting 00.mar.03 (fri)
  51. Assembly language (Jelly2000) 00.mar.12-17
  52. Using the Jelly2000 in Symonds 00.mar.20 (mon)
  53. Circuits 00.mar.22-apr.05
  54. Public-key cryptography (ps) apr.07-10

You can also see all the lectures in one big long text file.
Maintained by Ian Barland (ian@cs.rice.edu)           Please report broken links             Revised 01.Jan.02