Networks and Concurrent Computing
9-Jan-2002: At long last, the answers and discussion
for the final exam have been posted. You are also quite
welcome to stop by my office and pick up your graded exam.
15-Dec-2001: Look below for a list of questions
and answers that people have sent about the final exam
29-Nov-2001: To submit the merge sort assignment, you
should use the submit command with an assignment
name of mergesort (with no spaces or anything else).
Let me know if you have trouble submitting.
28-Nov-2001: There is a need for tutors on
networking material for CS 5 students. If you are
interested, please contact me. It could be a good way to
review networking material for the exam!
8-Nov-2001: I've finally posted instructions for
electronic submission -- they can be found below. Also
note that I've posted a page on the plus-scan in
NESL assignment on the Assignments page. Be sure to
check it out and ensure that you're doing everything
26-Oct-2001: The manual and user's guide for
NESL has been posted (see below). Be sure not only
that you can read it, but that you can also login to
romulus.amherst.edu, preferrably with VNC to get a
graphical environment in which to work, and are able to run
NESL itself with the runnesl.sh command, which is
located in the following directory:
9-Oct-2001: Check the Assignments pages, as
solutions to Problem Set 1 have been posted. I will
be handing back your graded work tomorrow.
1-Oct-2001: I will be meeting with Professor Cox, in
his office (SMudd 404), to ask him questions about CRC's and
polynomials at 4 pm, today. You are welcome to join
25-Sept-2001: Problem set 1 has been posted on
the Assignments page.
24-Sept-2001: I was unable to put together the
problem set yet. I will post it as soon as possible, and it
won't be due until October 1st.
14-Sept-2001: Class is cancelled today. If
you have questions about material or want to talk about
anything else, you should be able to find me in my office.
10-Sept-2001: My error with Differential Manchester
Encoding was simple but fundamental. It does not
solve the problem that only half of the available data rate
is used. It still yields 1/2 bit per baud. It exists
because, for reasons not obvious to me, it performs better
than Manchester Encoding in the presence of equivalent noise
levels. That the timing information imposes a constraint is
not surprising: Transmission of metadata, such as timing,
must also consume some amount of the available data rate.
Sorry about the confusion!
21-Aug-2001: Be sure to check here regularly
(that is, daily) to see if there are any important
annoucements about the class, assignments, materials, etc.
Links to course pages
Scott F. Kaplan
Last modified: Sat Dec 15 13:18:08 EST 2001