Computer Science 111:
Computers and Computing

Spring 1997

  • General Information
  • Labs
  • Problem Sets
  • Course newsgroup
  • Links


  • What's New?

  • What's New?

    5/6/97
    The last problem set has been graded and returned in the usual box. Stop by and pick up this and any other earlier problem sets, because--who knows?--they may be useful to you in preparing for the final exam.

    4/28/97
    Of course there's a page out there with a Turing Machine simulator. See also Alan Turing's homepage.

    4/28/97
    To see the various recursive graphics efforts from the last lab, visit this page. If you interrupt an applet while it's drawing, you may need to restart Netscape to see another one. Best is to let the applets finish (some take a long time).

    4/16/97
    Check out the COS 126 Prefix Codes assignment, which is a lot like what we did in class today.

    4/9/97
    There are a lot of Web pages out there that implement Conway's Game of Life (see Turing Omnibus, chapter 44). This one has a simple interface that will let you easily set up initial states and watch the development of future generations. Take a look at its Java source and compare it with what we did in class; you'll see the two loops near the end of the file. This implementation is fancier and has more interface options. Finally, you can explore a large catalog of starting patterns by going here; be sure to check out the 8 colliding gliders that make a glider gun, and also a space-filling pattern.

    4/1/97
    Good news: the final exam will be given on Friday, May 16, at 1:30 PM in C.S. room 104.

    3/24/97
    Want to explore the Mandelbrot set? Just click here for a slow but accurate explorer. This one is faster but it cheats. (Can you figure out how?)

    3/9/97
    Here's a practice midterm exam. The open-book, non-practice midterm will be given in class on Wednesday. Also, Problem Set 4 has been graded and returned in the usual way.

    3/3/97
    The compression ideas we developed in class for the fax application are examples of run-length encoding.

    2/27/97
    Here's Euclid's homepage and his own presentation of his famous algorithm (Proposition 2 of Book VII of The Elements).

    2/21/97
    World's first computer programmer? Check out this page.

    2/14/97
    Grading is done for problem set 1. Graded papers, with solutions attached, are in a bin next to the hand-in bin. Here's how to interpret the grading: 10 points means perfect in every way; 9 means one small flaw; 8 means a couple of problems, etc. Extra credit points will be used to raise the final course grade, but their absence won't be used to lower it.

    2/10/97
    Collaboration on problem sets is OK--the General Information page has been updated to reflect this policy.

    2/6/97
    During the lab sections next week (Feb. 11, 12, 13) we will be taking digital photographs of students for use on their hompages.

    2/5/97
    To learn more about Al-Khowarizmi, click here.

    2/2/97
    Welcome to Computer Science 111, and Happy Groundhog Day! This page will hold a dated list of course developments.