CS 168
Introduction to the Internet: Architecture and Protocols, Spring 2020
Instructor: Sylvia Ratnasamy, Murphy McCauley
Lecture: Tu/Th 11:00am-12:29pm, Doubalew Doubalew Doubalew Dawt Zoom Dot Com Hall
OH: Thursdays 4pm-5pm, 413 Soda

Table of Contents


This is an undergraduate level course covering the fundamental concepts of networking as embodied in the Internet. The course will cover a wide range of topics; see the lecture schedule for more details. While the class has a textbook, we will not follow its order of presentation but will instead use the text as a reference when covering each individual topic. The course will also have several projects that involve programming (mostly in Python).


Required: CS 61A, 61B, Math 53 or 54.

You should know programming, data structures, and software engineering. In terms of mathematics, your algebra should be very solid, you need to know basic probability, and you should be comfortable with thinking abstractly. The TAs will spend very little time reviewing material that is not specific to networking. We assume that you either know the material covered in those courses, or are willing to learn the material as necessary. We won’t cover any of this material in lecture.

The projects will be programmed in Python, but we expect that it will be easy for students to learn enough Python on-the-fly to complete the assignments.


Lectures will be recorded and shared on bcourses after the lecture. The recordings can be found under the “Course Capture” tab of bcourses.



Computing Facilities

Students enrolled in the class will be given an instructional account, cs168-???@cory. To get an account, register yourself here. Most of the Unix systems have cross-mounted file systems, so you can generally work on other EECS Unix systems. Your final run for each assignment must be done under that account, and must run on x86 Ubuntu machines.

If your machine is too busy, you can find other EECS computers on Hivemind.

Homework Assignments / Self-Tests

There is no homework for this class. Instead, we will be releasing online self-tests after each lecture. These self-tests are meant to gauge which topics we should focus on more in future discussions and lectures.

Self-tests will be posted to bcourses after each lecture on bcourses under the Quizzes Tab.

They will be graded on timely completion (within one week), but we will penalize anyone that doesn’t put in the effort on these self-tests (e.g., answering False/0 for every self-test). You may skip up to 3 self-tests without penalty.


Projects will be graded by a script which will run the submitted code under a variety of conditions. Grades will be determined automatically from the results from the script. Projects are to be completed individually. You are not allowed to work with a partner.

You may not share code with any classmates. You may discuss the assignment requirements or general programming decisions (e.g., what data structures were used to store routing tables) - away from a computer and without sharing code - but you should not discuss the detailed nature of your solution (e.g., what algorithm was used to compute the routing table). Also, it is your responsibility to make sure your code is not publically accessible to others in any way. Your grade will suffer if you violate this requirement.

For example, if you are using Github, or other such services, ensure that your repository access is set to private (as a student, you have unlimited private repositories on GitHub!). Likewise, ensure that you do not put your code on public clipboard sites such as pastebin. If we find that someone has copied your code (even without your knowledge), you will be deemed equally responsible and will face the same penalty as the person who copied it.


There will be one midterm and one final. If you have a conflict with any of the exams, let us know as soon as possible to attempt to schedule a makeup.

The exams will cover material from lecture, sections, and projects.

1Crib sheets written on a tablet and printed out are allowed, but you must be the writer of such sheets.


The course will be graded on a curve that is consistent with department guidelines. A+ is reserved for the very few best students in the class. Graduate students and re-entry students are not included in establishing the curve, but they will receive grades based on where they would fall on the curve.

Your grade is based on a combination of projects, and exams, in the following proportions.

Category Percentage
Project 1 20%
Project 2 30%
Self-Tests 5%
Midterm Exam 20%
Final Exam 25%
Total 100%

Late Policy

The policy is simple: no slip dates. If assignments are late, they are penalized as follows:

Lateness Penalty
< 24 hours -10% (0.9 * your raw score)
< 48 hours -20% (0.8 * your raw score)
< 72 hours -40% (0.6 * your raw score)
>= 72 hours -50% (0.5 * your raw score)

You may only submit ONCE if you are more than three days late.

If you receive less than 50% on any project, you may choose to redo it ONCE for up to 50% of the maximum score.

Any project turned in after May 8, 11:59 PM will not receive any credit.


For Exams

Any requests for grade changes or regrading must be made before the specified deadline. For assignments returned on Gradescope, you should submit regrade requests directly through Gradescope. Please submit a separate request for each question you want regraded. For assignments graded in a different way than on Gradescope, we will post a regrade request Google form on Piazza.

Even if you ask for only one problem to be regraded, your entire work may be regraded, so your score could decrease, stay the same, or increase.

For Projects

Each project would have its own regrade policy defined by the lead GSI for that project. This will be explained when the project is released. Regrade policies across projects may not be consistent.


It’s OK to ask someone about the concepts, algorithms, or general approaches needed to do the project assignments. We encourage you to do so; both giving and taking advice helps you to learn. However, what you turn in must be your own; copying other people’s code, solution sets, Google safaris, or from any other sources is strictly prohibited. If you are unsure, then ask. w One technique we will use to detect cheating is an automated system that performs comparisons across documents. It flags suspicious similarities, which we then inspect manually.

If elements of two assignments are determined to be clearly very similar (i.e., we believe that they were done together or one was copied from the other), both the copy-ers and the copy-ees will receive a 0 for that assignment. At the end of the semester, the course grade for all students involved in the incident will furthermore be reduced by one letter grade for the first offense, and to an F for the second offense. The reduction in grade may be taken without discussion or warning; the first notice you receive may be a letter indicating the penalty. In addition, for every instance, a letter to the Office of Student Conduct will be attached to your permanent record, and a copy will be placed in the CS division office. More serious cases of cheating (e.g., cheating on exams) will engender accordingly more severe penalties.

Again, note that you are responsible for not leaving copies of your assignments lying around and for protecting your files from unauthorized reading.

Last built: 2020-05-14 04:27 UTC