CS 1340: Computer Networks [Monsoon 2023]

Mahavir Jhawar (mahavir.jhawar@ashoka.edu.in)

1 Course Topics
The dynamic field of computer networking involves many concepts, protocols, and technologies that are
woven together in an intricate manner. The Internet is the largest computer network that interconnects
hundreds of millions of computing devices throughout the world. This course will use the Internet as
the principal vehicle for discussing computer networks and their protocols. Despite the fact that the
Internet is extremely large and has numerous diverse components and uses, there exist guiding principles
and structures that can provide a foundation for understanding such an amazingly large and complex
system. This course will equip you with a modern introduction to the subject of computer networking
while exploring its underlying principles and structures rigorously. The topics that we cover in the course
are:

• Network architecture, layering, and protocols.

– Components of a Computer Network (and the Internet).
– The Network Edge: Client and Server Programs
– Access Network Technologies
– The Network Core: Circuit Switching and Packet Switching. Internet Service Providers (ISPs)
and Internet Backbones
• Data Communication Fundamentals:
– Data Transmission Concepts and Terminology.
– Analog and Digital Transmission.
– Transmission Impairments.
– Channel Capacity: Data rate, Bandwidth, Noise, and Error rate.
– Transmission Media. Guided Transmission media. Wireless Transmission.
– Signal Encoding Technique. Digital/Analog Data to Digital/Analogue Signals.
– Digital Data Communication Techniques. Synchronous vs Asynchronous.
• The Link Layer and Local Area Networks:
– Link Layer Introduction and Services
– Encoding, Synchronization, and Framing
– Error Detection: parity checks, checksum methods, cyclic redundancy check (CRC)
– Reliable Transmission: Stop-and-wait Protocols. Sliding-window Protocols.
– Multiple Access Protocols: Channel Partitioning Protocols, Random Access Protocols (ALOHA),
– Taking-turns Protocols
– Link Layer Addressing: MAC addresses
– Ethernet. Topology, Frame structure, and CSMA/CD MAC protocol.
– LAN Extension: Link layer switches, packet switching.
• Network Layer: Internetworking:
– The Internet Protocol (IP).
– The IP service model.
– Routers. Subnets. Domain.
– IPv4 Addressing.
– ARP Protocol

1
 – Dynamic Host configuration Protocol (DHCP)
– Routing Algorithms.
– Intra-domain routing. Link-state routing. Distance-vector routing. RIP. OSPF.
– Inter-domain routing. BGP
• Transport Layer and Application Layer Protocols:
– Transport layer service model.
– Transport layer protocols: Connectionless transport (UDP), Connection-oriented transport
(TCP)
– Network Address Translation (NAT)
– Application-level protocols:
– Web and HTTP,
– Simple mail transfer protocol (SMTP),
– Domain name service (DNS),
– Socket Programming
– Peer to Peer Applications

2 Prerequisites
Students should have finished the introductory CS sequence
- Introduction to Computer Programming, and
- Computer Organization and Systems.

3 Required Reading
The following books can be used to supplement class lectures and handouts:

• Computer Networking: A Top-Down Approach. James F. Kurose and Keith. W Ross.

Pearson Publishers.
• Computer Networks: A Systems Approach. Larry L. Peterson and Bruce S. Davie. Morgan
Kaufmann Publishers.

• Data and Computer Communications. William Stallings. Pearson Publishers.

4 Grading
Your final grade in the course will be calculated as per the policy given in Table 1.
Late homework policy: Late or improperly submitted homework will not be accepted. If you know in
advance that you will be unable to submit your homework at the correct time, you must make special
arrangements ahead of time. Theory assignments must be written neatly and well organized. If it’s not
readable, it won’t be graded. You should strongly consider starting with a rough draft, especially on
problems requiring a proof. You might consider taking the opportunity to learn LATEX.

Academic dishonesty: Many students find it helpful to consult their peers while doing assignments.
This practice is legitimate and to be expected. However, it is not acceptable practice to pool thoughts
and produce common answers. To avoid this situation, it is suggested that students not write anything
down during such talks, but keep mental notes for later development of their own. Students who allow
1 “Assignments” - will include all or some of the following: theory/programming home work, in-class quizzes, weekly

in-class tests and course project.

2
 Evaluation Type Weightage Letter Grade Percentage Bracket
Mid Term 20% F < 40
Assignments 1 60% D- 40 − 44
Final Term 20% D 45 − 49
D+ 50 − 54
C- 55 − 59
C 60 − 64
C+ 65 − 69
B- 70 − 74
B 75 − 79
B+ 80 − 84
A- 85 − 90
A > 90

Table 1: Grading Policy

their files or assignments to be copied are as guilty of academic dishonesty as those who copy and will
be treated accordingly. Major occurrences of academic dishonesty, such as the submission of work that is
not the student’s own, will be dealt with according to the Ashoka University’s academic honesty document.

How much work is expected: The amount of work will vary, depending on your background and the
ease with which you follow mathematical ideas. However, 10-12 hours per week is a good guess.