CSCI 356 / Spring 2017
Computer Networking The final exam will be on Monday 5/15, 3-5:30pm, location Swords 302. It will be comprehensive, but biased towards material we have covered more recently, i.e. security &Amp; firewalls, IP, link & physical layers, routing, etc. I will hold some additional office hours by appointment or: Extra office hours will be held during exam week by appointment or: Friday 5/5, 2:00-4:00 Monday 5/8, 10:00-11:30, 2:00-4:00 Wednesday 5/10, 10:00-noon Some non-comprehensive review materials: Overview of topics and a few (non-comprehensive) review questions Some partial solutions to review questions Exam 1 review sheet Exam 1 review sheet hw4soln.pdf hw5soln.pdf exam2_notes.pdf exam 2 notes from a former student (may not be 100% accurate) IP & ethernet non-homework a few more questions on IP and Ethernet ... and a partial solution for IP & ethernet non-hw
Instructor:
Office Hours:
Kevin Walsh
Tues 12:30 - 2:00 pm,
[email protected]
Thurs 3:30 - 5:00 pm,
Office: Swords 335
or by appointment.
Extension: 3943
Lecture: Tuesdays & Thursdays, 9:30 am - 10:45 am Swords 302
Course Description This course is designed for those who want to understand the technology that lies beneath the Web and everything else we do online. In short, how computers talk to each other. We will focus on the fundamentals of computer networks. We will study the low-level protocols that drive the Internet, including protocols for data forwarding, routing, congestion, and flow control. We will examine how these can be used to build services like the Web, email, streaming video, and multiplayer games, and we will learn how to write our own networked programs. Some of the assignments will be drawn from emerging research, including peer-topeer and wireless sensor networks. Students in the course will be expected to know the basics of computer programming. Students will learn how to program with sockets and how to use various software tools for managing networks and networked programs. The course will make extensive use of online reference materials.
Textbook Computer Networking: A Top-Down Approach (6th Edition) James F. Kurose, Keith W. Ross ISBN: 0136079679 / 978-0136079675 If you have the 4th or 5th edition, that should be fine instead.
Grading Class participation & discretionary 5% Homework & programming projects 45% Midterm exams
15% each
Final exam
20%
Examinations There will be two evening mid-term exams and one final exam. Mid-term exams: Thursday, March 2, 4-6:30pm (Haberlin 218) Thursday, April 20, 4-6:30pm (Swords 328) Final exam: Monday 5/15, 3:00-5:30pm, Swords 302
Late Policy Assignments are due as specified on the assignment page. The maximum possible score for an assignment will be reduced by 10% for each day or portion of a day that the assignment is turned in late. So the maximum possible score for an assignment turned in up to 24 hours late is 90%, and the maximum possible score for an assignment turned in up to 48 hours late is 80%, and so on. The penalty will be determined when the complete assignment has been received by the instructor, the department administrative assistant, or another faculty member in the Math and Computer Science department. Late work will not be accepted after the graded assignment is returned to the class or after the solutions have been posted.
Collaboration Policy You are allowed to discuss strategies for solving homework problems and programming projects with other students. However, any work you turn in must be your own work (i.e. you may not simply copy another student's answers and turn them in as your own). In addition, you must clearly indicate the names of any students you work with on each assignment or project, to give credit where it is due. You may consult public literature (books, articles, web sites) for information, but you must cite each source of ideas you adopt. To clarify: Unless otherwise noted on an assignment, it is fine to use Google to look for snippets of publicly available code that are similar to the assignments or projects, and to use that code in your work. But you must clearly comment your code to indicate which code and ideas are purely your own, which code or ideas are borrowed or adapted from elsewhere, and where the other code or ideas came from. Please refer to the math and CS department honor code policy.