SE 331: Introduction to Computer Networks מבוא לרשתות מחשבים

Semester 1, 5786

Course Details:

• Lecture: Sunday 11:00am - 1:00pm in Room 6201
• Targil: Wednesday 16:15 - 18:15 in Room 6201
• Instructor: Michael J. May
• Metargel: Avi Zion
• Email: mjmay (at) mx; kinneret, ac, il

The full detailed syllabus of the course is available here.

Topics:

The course is an introduction to the physical, link, network, and transport layers of the standard computer network model. Significant time will be spent on Ethernet, switching, routing, Wi-Fi, IPv4, IPv6, UDP, and TCP. By the end of the course, students will have a good algorithmic understanding of the OSI seven layer model and various technologies have been used to implement the first four layers. Some time will be spent on network programming in Java or C. Congestion control and queuing algorithms will be covered as well.

The course assumes no prior knowledge of networks or communications protocols.

Goals:

At the end of the course the student will be able to:

1. Define and explain the differences between the following concepts: size, packet, bandwidth, round trip time (RTT), sending time. The student shall be able to also perform calculations based on them.
2. Read and understand the packet formats of the following protocols and technologies: Ethernet (classical, fast, and gigabit), RIP, OSPF, Wi-Fi, IPv4, IPv6, TCP, and UDP.
3. Explain the roles of each layer in the OSI seven layer model.
4. Perform basic hand executions of routing protocols, CRC, sliding window, and IPv4 assisting protocols: e.g., DHCP, ARP, DNS, ICMP.
5. Plan an IPv4 network which uses subnetting, including assigning addresses, subnet numbers, and subnet masks.
6. Use Wireshark to examine and analyze network traces of Ethernet, Wi-Fi, RIP, OSPF, UDP, and TCP traffic.
7. Read and write networking communication programs using sockets in Java.
8. Explain how queuing algorithms (fair queuing, weighted fair queuing) work and perform analyses on their behavior.

Reading

The following books are used in the class:

• Dordal, P. L. (2023). An introduction to computer networks (2.0.11 ed.). Shabbona, IL, USA: Online. (link)
• James F. Kurose and Keith W. Ross. Computer Networking: A Top-Down Approach. Addison-Wesley, 8/E edition, 2020.
• Larry L. Peterson and Bruce S. Davie. Computer Networks: A Systems Approach. Morgan Kaufmann, 6.2-dev edition, 2020. Online. (link)
• Andrew S. Tanenbaum, Nick Feamster, and David J. Wetherall. Computer Networks. Pearson, 6th edition, 2021.

Assignments

The following assignments will comprise the assignment portion of the course grade:

Assignment 1 (4.44): Sending Calculations. Due: 19 Nov 2025

Assignment 2 (8.88%): Stop and Wait Theory, Code, Analysis. Due: 8 Dec 2025

Assignment 3 (4.44%): CRC, Ethernet, and Sliding Window. Due: 15 Dec 2025

Assignment 4 (8.88%): Sliding Window Implementation. Due: 5 Jan 2026

Assignment 5 (4.44%): Spanning Tree, Fragmentation, Subnets. Due: 12 Jan 2026

Assignment 6 (8.88%): TCP and DNS. Due: 25 Jan 2026

Assignments are on Moodle. More details of assignments will be given during the course of the semester.

Grading Criteria

Final grades will be calculated by combining grades from student participation, the midterm exam, and projects. The grades are weighted as follows:

• 40% Assignments (Required - תקף)
• 60% Final Exam

Lecture Slides and Notes

Academic Integrity

Cheating of any sort will not be tolerated. Student collaboration is encouraged, but within limits as set forth in the college’s rules on academic integrity. Any students caught cheating will be immediately referred to the department head and the Dean and may receive a failing grade for the course.

Cheating includes:

• Copying information, content, or verbatim text from other students, internet sites, books (other than the ones listed in the bibliography), other unaffiliated individuals to answer questions, solve problems, or aid in programming projects.
• Copying or submitting source code, documentation, or other programming aids without attribution from other students, web sites, online repositories, text books, open source programs, or other unaffiliated individuals.
• Project teams which submit work which is identical or substantially identical to work submitted by other project teams, whether current or from previous years.
• Other forms of academic misconduct as described at this link or as reasonably assessed by the instructor, program head, or dean.

If you have any questions about what constitutes cheating in the above rules, contact the instructor as early as possible.