Homework 1 posted to homepage. Exercises are about notation and simple set theory, and there is one proof to do.
We began the course by looking at Finite State Automata. We will discuss these for awhile, and in doing so introduce the formalism-to-live-by for this course.
We introducted networking by just messing around with ping and traceroute; and the next class, looking at how to program simple network services. Big ideas introduced included packet versus connection networking, client-server discipline, and to some extent the layering of communications according to next-hop and long-haul communication tasks.
This course meets MWF 1:25- 2:15 PM in Memoral 300.
This course meets MWF 3:35- 4:25 in Memorial 300.