Computer Science 111:
Computers and Computing

Spring 1999 course homepage

Current

• (No it's not kindergarten, but) your efforts from Lab 9 are posted on the wall outside our classroom. The on-line version is here.

Syllabus

• Course description
• Administration
• Requirements
  • Class participation
  • Labs
  • Problem sets
  • Examinations
• Reading
• Schedule

Past

• List of student homepages
• Reading assignments and discussion topics, by class number: 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 |
• Problem sets: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
• Labs: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
• Enrichment links
  • Here is how Euclid himself explained his famous algorithm (Proposition 2 of Book VII of The Elements). When he says (translated from the Greek!) that one number measures another, he means that the first evenly divides the second.
  • Here is another binary search. Does it work?
  • The Boole in Boolean Algebra is George.
  • Biography of John von Neumann. Note the Princeton connection.
  • Conway's Game of Life.
  • Answer to Kate's question on "dangling else".
  • A former COS 111 student recommended Theatre Intime's production of Tom Stoppard's play Arcadia (April 15-17, 22-24). Why? Follow this link to find out!
  • Of course there a Turing Machine simulator out there. You can also visit The Alan Turing Homepage.