uocis  CIS 432/532 Introduction to Computer Networks - Fall 2003

Course Information

Class TimesUH 2:00-3:20, PLC 189
PrerequisitesCIS 313, CIS 314. CIS 415 recommended.
Credits4
CRN11237

Course Description

This course will introduce you to the principles of computer networks. We will focus on fundamental challenges of networking, valuable design strategies and common implementation techologies. We will cover topics such as application protocols, transport protocols, congestion control, routing protocols, packet switching, and link-level protocols.

This course has a substantial programing assignment in C/C++. The students should know C/C++ programing, data structure (CIS 313), algorithm (CIS 315), operating systems (CIS 415), and basic probability concept. The TA does not spend any time on material that are not related to computer networks. You should be either familiar with these issues or learn them on your own.


Instructor: Prof. Reza Rejaie

Webhttp://www.cs.uoregon.edu/~reza
Office328 Deschutes
E-mailreza at cs dot uoregon dot edu
Office HoursWednesday 12:00pm-2:00pm
Phone541-346-0200
Fax541-346-5373

Teaching Assistant: Daniel Stutzbach

Webhttp://www.cs.uoregon.edu/~agthorr
Office207B Deschutes
E-mailagthorr@cs.uoregon.edu
Office HoursTuesday 3:30pm-4:30pm, Friday 10:00am-12:00pm
Phone541-346-4409
Fax541-346-5373

Textbooks

For the lecture material, we will use: Computer Networking: A Top-Down Approach Featuring the Internet, second edition, by James F. Kurose and Keith W. Ross, Addison Wesley, 2002, ISBN 0-201-97699-4.

There is an additional, optional, textbook:

For programming exercises, we will reference some lecture notes and web sites.


Assignments, Group Work, Grading Policy

The assignments for this class will consist of written homeworks, in-class quizzes, programs, and a final exam. Your final grades will be computed as follows:

Homework:

20%

Quizzes:

20%

Programs:

30%

Exams:

30%

Undergraduates may work in groups of 2 for both homework and programs. Graduate students may work in groups of 2 for homework, but must work individually for programs.

Unless we explicitly specify, we encourage you to collaborate on your homework given the following conditions (1) you spend 15 minutes on each question alone before dicussing it with others, and (2) each group writes up its solutions on its own.

Group work is meant to be done jointly. While you may choose to divide the problems among group members, be aware that doing this may hinder your ability to learn the material.

When you turn in group work, turn in a single copy and put the names of all group members on the cover page of the submitted papers.

Programs must be written in the assigned language and must compile and run in the department's Solaris environment.

Homeworks are due in class and no late assignments will be accepted. Turn in partial work if you are not finished. If you must hand in homework before class, hand it in to the GTF, Daniel Stutzbach. If he is not available, Cheri in the Deshutes office can write the time and date on it and place it in Dan's mailbox. Please do not slide your work under the door; it may get lost.


Academic Dishonesty

For this course, some work may be categorized as group work. For these assignments, you may form a group that works together to produce one solution. Any assignment not categorized as group work must be done individually. You are encouraged to generally discuss problems with other groups or students, but you may never use some other group's or student's solution or code in any way. The use of sources (ideas, quotations, paraphrases) must be properly acknowledged and documented.

The student conduct code allows an instructor to impose an appropriate sanction for a student found guilty of academic dishonesty, up to and including an N or an F. I will impose an N or an F for any such offenses in this course.

For more information on academic honesty, please talk to me or see the following references: the Student Conduct web page, the Student Conduct Code, and the UO Dean of Students brochure on academic integrity.

Created by: Daniel Stutzbach December 15, 2003