Computer - Netwroks - Course - Pack Version - 3
Computer - Netwroks - Course - Pack Version - 3
SCHEME
The scheme is an overview of work-integrated learning opportunities and gets students out into the real
world. This will show what a course entails.
Practical
0 0
Theory
delivery
study
Self-
SEE
CIE
Practical 0 0
Self-study 0 0
Total 3 3 445 0 0 50% 50
5 %
Course Lead Munish Khanna Course Coordinator Mr. Hridesh Pauchauri and
Mr. Vibhor Gupta
Theory
COURSEPACK |
Names Munish Khanna
Course Hridesh Pauchauri
Instructors Vibhor Gupta
Tarun Maini
Aanjey Mani Tripathi
Arvind Dagur
Pragya Srivastava
Brijesh Kumar Singh
Vimal Kumar
Damodharan D.
Azath Mohaamed Hussain
Harshvardhan Choudhary
D. Salangai Nayagi
Ajeet Singh
C. Rajesh Babu
Nand Kumar Jyotish
Maheshwari Niranjan
Alok Katiyar
Suman Devi
Nidhi Sharma
COURSEPACK |
COURSE OVERVIEW
A computer network is a set of computers connected together for the purpose of sharing
resources. The most common resource shared today is connection to the Internet. Other
shared resources can include a printer or a file server. This course will introduce the student
to the basic concepts involved in the design and implementation of a computer networks. This
course deals with all the fundamentals of computer network. It deals with various network
models, types and OSI layers. This course provides uses of computer network, role of seven
OSI layers etc. Students will be made familiar to the important modules, services, protocols
and layers of OSI and TCP/IP models. At the end of the course, the students will be able to
build an understanding of the fundamental concepts of computer networks, advanced
networking concepts, network standards & protocols, basics of mobile phone networks and
network security etc.
PREREQUISITE COURSE
PREREQUISITE COURSE No
REQUIRED
If, yes please fill in the Prerequisite Prerequisite course name
Details. course code
COURSE OBJECTIVE
1. To facilitate students understanding of networking basic concepts, an overview of OSI and TCP/IP model
and data transmission type and media. To impart knowledge about the network models and architectures.
2. To introduce the students with the mechanism of Routing algorithms and Congestion control schemes.
3. To strengthen the concept of TCP, HTTP, other major protocols and basic introduction of Cryptography
4. To introduce the fundamental concepts relevant to performance of various routing protocols and design
of routing protocol.
5. To impart knowledge on designing and building a complete networking solution as per the requirement
of an organization
COURSE OUTCOMES(COs)
After the completion of the course, the student will be able to:
CO No. Course
Outcomes
CO1 Develop knowledge about basic concepts like physical structure of computer network, OSI
reference model, services and role of each layer of OSI model and TCP/IP, networks devices
and transmission media.
CO2 Understanding of various protocols of Datalink layer. Gain the knowledge of the error
detection and correction techniques.
COURSEPACK |
CO3 Develop the knowledge about routing algorithms and congestion control techniques.
Describe the functions of Network Layer i.e. Logical addressing, subnetting & Routing
Mechanism. Understand the Port addressing, Connection Management, Error control and
Flow control mechanism in network at transport layer.
CO4 Explain the services offered by session and presentation layer.
CO5 Explain the different protocols used at application layer i.e. HTTP, SNMP, SMTP, FTP, and
TELNET . Basic understanding of cryptography, Encryption and Decryption.
Bloom's taxonomy is a set of hierarchical models used for the classification of educational learning
Objectives into levels of complexity and specificity. The learning domains are cognitive, affective, and
Sycho motor.
THEORY
Remember Understand Apply Analyse Evaluate Create
CO No. KL1 KL 2 KL 3 KL 4 KL 5 KL 6
CO1 √ √
CO2 √ √
CO3 √ √
CO4 √ √
CO5 √ √
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complex computing science problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and computer sciences.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern computing science and IT tools including prediction and modeling to
complex computing activities with an understanding of the limitations.
PO6 IT specialist and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
COURSEPACK |
responsibilities relevant to the professional computing science and information science
practice.
PO8 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the computing science practice.
PO9 Individual and team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
PSO1: Have the ability to work with emerging technologies in computing requisite to
Industry 4.0.
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
1 3 1 - 2 2 - - - - - - 2 1 -
2 1 2 1 1 - - - - - - - 1 -
3 2 2 2 3 1 - - 2 - - - 2 1 1
4 2 1 1 1 2 - - - - - - - 1 2
5 2 2 1 3 - - - - - - - 2 1 2
AVG. 2 2 1 2 1 - - <1 - 1 1 1 1 1
COURSEPACK |
Note: 1-Low, 2-Medium, 3-High
COURSE ASSESSMENT
The course assessment patterns are the assessment tools used both in formative and summative
examinations.
COURSE CONTENT
THEORY
Introduction: Evolution of computer networks, Goals and Applications of Networks, Protocol layering,
Reference models (OSI & TCP/IP), Network standardization. The Physical Layer: Theoretical basis for
data communication (Digital Transmission: Signal, Types of Signals and Its parameters), Transmission
media: Guided and Unguided media. The Data Link Layer: Data link layer design issues, Switching
(circuit, message, and packet), Multiplexing (FDM, WDM, and TDM). Error detection and correction
techniques. Data Link Protocols: Framing, Character and Bit-Oriented Protocols, Simplex and Stop and
Wait Protocols. Sliding window protocols, Example data link protocols - HDLC and PPP. Multiple access
protocols, IEEE standard 802.3 & 802.11 for LANS and WLANs. The Network Layer: Connecting devices
- repeater, hubs, bridge, switch, and router. Routing algorithms: Distance Vector Routing, Link State
Routing, Hierarchical Routing, Broadcast Routing and Multicast Routing. Congestion control
algorithms: General Principles of Congestion Control and Congestion Control and Prevention Policies.
Leaky Bucket Algorithm, Token Bucket Algorithm and Resource Reservation. Internet Protocol:
Introduction to IPv4 Addressing, Subnetworks and Subnetting, IPv4 protocol Packet Format, IPv4 vs
IPv6. Transport layer: User Datagram Protocol (UDP), Transmission Control Protocol (TCP)- Services
and Features, TCP Connection Management –Establishment and Termination, TCP Window
Management. Integrated Services. Functions of Session and Presentation Layers. Application Layer:
Domain Name Space (DNS), Electronic mail, SMTP, FTP, Telnet, HTTP, & WWW. Network Security:
Basic Security Model and its component, Security parameters, Basic understanding of Cryptography,
Introduction to Encryption and Decryption.
COURSEPACK |
LESSON PLAN FOR THEORY COURSES
FOR THEORY 15 weeks * 3 Hours = 45 Classes) (1credit = 1Lecture Hour)
1. Preamble
COURSEPACK |
23. Congestion control algorithms: General
Principles of Congestion
Control and Congestion Control and Prevention
24. Policies
25. Leaky Bucket Algorithm
26. Token Bucket Algorithm and Resource
Reservation. Know how to control
27. Introduction to IPv4 Addressing congestion in network. In-
Subnetworks and Subnetting depth knowledge if IP and IP
28. addressing, Understanding of
29. IPv4 protocol Packet Format, TCP and UDP
30 IPv4 vs IPv6. Numerical on IPv4 and IPv6 and
subnetting
31 User Datagram Protocol (UDP)
32 Transmission Control Protocol (TCP)- Services and
Features
33. TCP Connection Management –Establishment and
Termination,
34. TCP Window Management. Integrated Services.
35. Understanding the services and Functionalities
offered by Session Layer.
Understanding of Session
36. Session Layer continued. Introduction to Layer and Presentation Layer
presentation Layer.
37. Understanding the services and Functionalities
offered by Presentation Layer.
38. Application Layer: Domain Name Space (DNS),
Electronic mail (SNMP)
39. SMTP, Telnet and FTP
Different protocols and the
40. HTTP and WWW services working at application
41. Network Security: Basic Security Model and its layer. Introduction to
component, Security parameters. cryptography and network
42. Basic understanding of Cryptography, Encryption security.
and Decryption
43. Revision/Numericals/BackUp
44. Revision/Numericals/BackUp
45. Revision/Numericals/BackUp
BIBLIOGRAPHY
◻ Text Book
◻ Behrouz A. Forouzan, Data Communication and Networking”, 6th edition, TMH, 2023
◻ A. S. Tanenbaum, Computer Networks, 4th Ed, Pearson India
◻ Reference Books
◻ W. Stallings, Data and Computer Communication, Macmillan Press
COURSEPACK |
◻ J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach, 3rd Ed, Pearson
India, 2005
◻ L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, 4th Ed, Elsevier India,
◻ S. Keshav, An Engineering Approach to Computer Networking, 1st Ed, Pearson India, 1999.
◻ William Stallings, “Cryptography and Network Security”, 3rd Edition, Prentice Hall, 2003
◻ Webliography
• https://www.geeksforgeeks.org/computer-network-tutorials/
• https://www.tutorialspoint.com/data_communication_computer_network/dcn_q
uick_guide.htm
◻ NPTEL/MOOCs Certification
• 1. https://onlinecourses.swayam2.ac.in/cec19_cs07/preview
• 2. https://archive.nptel.ac.in/courses/106/105/106105183/
PROBLEM-BASED LEARNING
Q6. With a neat diagram describe in detail about the Network architecture.
Q7.Explain in detail about a) Data Link Layer and Network Layer
b) Physical Layer
Q8. Distinguish between point-to-point links and multi point links. Give relevant diagrams
Q9. Discuss various types of networks topologies in computer network.
Q10. Explain the ISO-OSI model of computer network with a neat diagram
COURSEPACK |
Q11 Consider the following subnet masks-
a) 255.0.0.0
b) 255.128.0.0
For each subnet mask, find-
1 Number of hosts per subnet
2 Number of subnets if subnet mask belongs to class A
3 Number of subnets if subnet mask belongs to class B
Q12 If WAN link is 2 Mbps and RTT between source and destination is 300 msec, what would be the optimal
TCP window size needed to fully utilize the line?
Q13 Suppose host A sending a large file to host B over a TCP connection. The two end hosts are 10 msec apart
(20 msec RTT) connected by a 1 Gbps link. Assume that they are using a packet size of 1000 bytes to transmit
the file. For simplicity, ignore ack packets. At least how big would the window size (in packets) have to be for
the channel utilization to be greater than 80%?
Q14 A TCP machine is sending windows of 65535 B over a 1 Gbps channel that has a 10 msec one way delay?
Q16 A Host with IP Address 200.100.1.1 wants to send a packet to all the hosts in the same network. Find the
following:
a) Source IP Address
b) Destination IP Address
Q18 Suppose that instead of using 16 bits for network part of a class B Address, 20 bits have been used. How
many class B networks would have been possible?
Q20 Suppose a router receives an IP packet containing 600 data bytes and has to forward the packet to a
network with maximum transmission unit of 200 bytes. Assume that IP header is 20 bytes long. What is
fragment offset values for divided packets?
COURSEPACK |
Q21 A 3000 km long trunk operates at 1.536 Mbps and is used to transmit 64-byte frames and uses sliding
window protocol. If the propagation speed is 6 μsec / km, how many bits should the sequence number field be?
Q22 Compute approximate optimal window size when packet size is 53 bytes, RTT is 60 msec and bottleneck
bandwidth is 155 Mbps.
Q23 A sliding window protocol is designed for a 1 Mbps point to point link to the moon which has a one-way
latency (delay) of 1.25 sec. Assuming that each frame carries 1 KB of data, what is the minimum number of
bits needed for the sequence number?
Q24 HOST A is sending data to host B over a full duplex link. A and B are using the sliding window protocol
for flow control. The send and receive window sizes are 5 packets each. Data packets (sent only from A to B)
are all 1000 bytes long and the transmission time for such a packet is 50 μs. Acknowledgement packets (sent
only from B to A) are very small and require negligible transmission time. The propagation delay over the link
is 200 μs. What is the maximum achievable throughput in this communication?
Q 25. What does the amplitude of a signal measure? What does the frequency of a signal measure? What does
the phase of a signal measure?
Q29 In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword
to make the dividend? What is the size of the remainder? What is the size of the divisor?
Q30 Explain why flags are needed when we use variable-size frames.
Q31There are only three active stations in a slotted Aloha network: A, B, and C. Each station generates a frame
in a time slot with the corresponding probabilities pA = 0.2, pB = 0.3, and pC = 0.4, respectively. a. What is the
throughput of each station? b. What is the throughput of the network?
Q32 In a CDMA/CD network with a data rate of 10 Mbps, the minimum frame size is found to be 512 bits for
the correct operation of the collision detection process. What should the minimum frame size be if we keep the
size of the network constant, but we increase the data rate to each of the following? a. 100 Mbps b. 1 Gbps c. 10
Gbps
Q33 What do we mean when we say that a link-layer switch can filter traffic? Why is filtering important?
Q34 Distinguish between the process of routing a packet from the source to the destination and the process of
forwarding a packet at each router.
COURSEPACK |
Q35 A host is sending 100 datagrams to another host. If the identification number of the first datagram is 1024,
what is the identification number of the last?
Q36 Explain why the registration request and reply are not directly encapsulated in an IP datagram. Why is there
a need for the UDP user datagram?
Q37 A large organization with a large block address (12.44.184.0/21) is split into one medium-size company
using the block address (12.44.184.0/22) and two small organizations. If the first small company uses the block
(12.44.188.0/23), what is the remaining block that can be used by the second small company? Explain how the
datagrams destined for the two small companies can be correctly routed to these companies if their address blocks
are still part of the original company.
Q38 An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. Find
the following: a. Number of addresses in each subnet b. Subnet prefix c. First and last addresses in the first subnet
d. First and last addresses in the last subnet.
Q39 Briefly describe how we can defeat the following security attacks:
a. Packet sniffing b. Packet modification c. IP spoofing
Q40 Which ICMP messages contain part of the IP datagram? Why is this needed?
Q41 Explain why a router using link-state routing needs to receive the whole LSDB before creating and using its
forwarding table. In other words, why can’t the router create its forwarding table with a partially received LSDB?
Q42. Explain the concept of hop count in RIP. Can you explain why no hop is counted between N1 and R1 in
Figure 8.15?
Q43. Explain why in TCP each SYN, SYN + ACK, and FIN segment consumes a sequence number, but an ACK
segment carrying no data does not consume a sequence number.
Q44. A client uses UDP to send data to a server. The data length is 16 bytes. Calculate the efficiency of this
transmission at the UDP level (ratio of useful bytes to total bytes).
********************************
COURSEPACK |