CS352 Internet Technology Spring 2007

This course will provide students with a thorough understanding of the basic principles of computer networks, the design philosophy of the Internet, the details of Internet protocols, and the engineering and scientific principles needed to understand computer networks. Students who complete this course will be able to describe in detail the operations of Internet protocols and develop their own Internet applications. Students will also develop an understanding of the design and construction of network programs via a semester long class project. At the end of the course, you should be capable of network programming.

The prerequisite for CS 352 is Computer Architecture (CS 211), because of number representation, as well as Introduction to Discrete Structures II (CS 206), because students are expected to know basic probability. Students are expected to know how to program in Java and use simple data structures such as hash tables and arrays. Students are also expected to understand the department's facilities and how to use the cereal cluster, handin, and the FAS gradebook.

James F. Kurose and Keith W. Ross, Computer Networking, 3rd edition.

Students are expected to attend all lectures and perform all reading assignments prior to lecture. Students are also expected to attend all recitation section meetings. Students will be evaluated according to their performance on a semester long programming project, 2 mid-term examinations, and the final examination.

WARING: This is a project course, which means that this course should give you more than a passing knowledge of what writing working network programs entails. The project will be a major undertaking. If you complete the projects, you will have learned a lot. However, assess your commitment to this course realistically. If you don't have the time or the inclination to work hard on the project, you would be better off not taking the course. Fortunately, the project will be programmed in Java, so you will not have to learn a new programming language. You will have to learn how to build and debug a reasonably sized Java program and make it robust to outside errors. You will also have to describe how your program work in both a written document as well as an oral exam.

This one large project will be assigned, as three sub-projects. Up to 2 students can work as a group for each sub-project and you can change group members for each project. Students are required to complete the parts by the scheduled deadlines. Failure to turn in the project by the deadline using the "handin" program will result in a zero for all team members. No exceptions!

Cheating on projects and exams will not be tolerated. We want to protect the fairness and integrity of the class, so we run code similarity detectors on the projects and scrutinize exams for copying. Both parties in the exchange are liable; e.g. if you give away solutions to friends, you're putting yourself at risk too. If you get caught, it's a nasty process---just don't go there! You're better off dropping the course and trying it again.

The department academic integrity policy can be found at http://www.cs.rutgers.edu/policies/academicintegrity/. You now need to click explicitly on a link when you first login to our computing facilities, use handin, etc., that says you acknowledge being aware of the policy (which you can read through at the login screen).

That said, we do encourage you to talk to your classmates, provided you follow the Gilligan's Island Rule. After a joint discussion of an assignment or problem, each student should discard all written material and then go do something mind-numbing for half an hour. For example, go watch an episode of Gilligan's Island (or Reality TV in modern terms) , and then recreate the solutions. The idea of this policy is to ensure that you fully understand the solutions or ideas that the group came up with.

If you follow the Gilligan's island rule, often best route to follow to get a question answered is to ask, in order:

1. A classmate smarter than you
2. Your TA
3. The Professor

Two mid-term examinations are scheduled this semester, and both are held during regular lecture hours. A cumulative final examination will be held at the end of the semester.

Written homework assignments are for your practice only, we won’t grade them. It will be up to you to do them and ask the TA and instructor about problems that you don't understand. It is greatly to your advantage that you do the homework before getting/looking at the solutions. This will be critical for the exams.

• 2 Midterms: 30 % (15 % each)
• Final: 30 %
• Project: 35% (Part 1: 10%, Part 2: 10% and Part 3: 15%)
• Class Attendance: 5%

The programming part of the projects are typically graded on how close they are to the functional requirements. The written portion is graded on how well the TA can figure out how your project is constructed only from the written description. Exams are typically graded on a curve. As a rule of thumb, the mean is a "C'" and each standard deviation is one letter grade. This rule can be altered, however, if the class does exceptionally well or poorly.

• Fall 2003
• Fall 2006(with solutions)

• Fall 2002
• Spring 2004
• Fall 2006

• Fall 2000
• Fall 2001
• Spring 2004