Principles of computer networks using current Internet technologies and protocols as examples. Routing algorithms and protocols; end-to-end transport; flow control; congestion avoidance and control; mail, web, and file transfer protocols; designing and implementing applications using common network APIs. Advanced topics, included as time permits, include network security, multicast, and quality of service.
The formal study of computation, including computability and computation with limited resources. Church's thesis and models of computation. Formal languages and machines as recognizers of languages. The Chomsky Hierarchy of language types. Topics may include Turing machines or other basic models of computation; decidability and undecidability; basic complexity theory; finite automata and regular languages; pushdown automata and context-free languages. The course will cover primarily theory, including assignments that utilize concepts covered in lectures.
Topics to be selected by staff. May be repeated to a maximum of six credits, but only three credits may be earned by a student under the same topic.
Topics to be selected by staff. May be repeated to a maximum of six credits, but only three credits may be earned by a student under the same topic.
Design and implementation of a large computing project under the supervision of a member of the graduate faculty.
Design and implementation of a large computing project under the supervision of a member of the graduate faculty.
Design and implementation of a large computing project under the supervision of a member of the graduate faculty.
Design and implementation of a large computing project under the supervision of a member of the graduate faculty.
Design and implementation of a large computing project under the supervision of a member of the graduate faculty.
Design and implementation of a large computing project under the supervision of a member of the graduate faculty.
