Bangalore Institute of Technology

K.R. Road, V.V. Pura, Bengaluru - 560004

Department of Information Science and Engineering
Prerequisites:

 Knowledge of computer networking concepts.

 Knowledge about JAVA programming Languages.
 Basic Concepts of Network Simulation tool

Course Objectives:

This course will enable students to:

 Study the TCP/IP protocol suite, switching criteria and Medium Access Control
protocols for reliable and noisy channels.
 Learn network layer services and IP versions.
 Discuss transport layer services and understand UDP and TCP protocols.
 Demonstrate the working of different concepts of networking layers and protocols.


Course Outcomes:

V-SEM: Course Name: Computer Networks Course Code: BCS502

Year of Study: 2024-25
At the end of the course the students should be able to:
Understand the basic needs of communication networks, models with transmission
CO1
media. Discussion of Process of Client server programming.
Apply error detection and correction methods, routing algorithms and congestion
CO2
control algorithms and Interpretation of Client Server protocols.
Analyze Network and Transport layer Services, Switching techniques, Different
CO3
Routing Protocols, Different Control methods and Application layer services.
Implement and test point to point network, CRC code, Sliding window Protocol,
CO4 Transmission of ping messages, Bellman-ford & RSA algorithms, Leaky bucket
algorithms, TCP/IP sockets with Client server programming and Ethernet LAN.
Advanced and latest topics in computer networks to be presented and documented
CO5
(Content beyond the syllabus).
COs and POs Mapping
CO-PSO
V-SEM: Course Name: Computer Networks Course Code: BCS502
Mapping
Year of Study: 2024-25
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2
CO2 3 2 3 2
CO3 3 2 3 2
CO4 3 3 2 3 3 2
CO5 3 3 2 1 3 3 2 3 2
AVG 3.00 2.60 2 2 3.00 3.00 2.00 3 2.00

Substantial (High) 2. Moderate (Medium) 1. Slight (Low)

COMPUTER NETWORKS Semester V

Course Code: BCS502 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:2:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 8-10 Lab slots Total Marks 100
Credits 04 Exam Hours 03
Examination nature (SEE) Theory/practical
List of Programs
1. Implement three nodes point – to – point network with duplex links between them. Set the
queue size, vary the bandwidth, and find the number of packets dropped.
2. Implement transmission of ping messages/trace route over a network topology consisting
of 6 nodes and find the number of packets dropped due to congestion.

3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source / destination.
4. Develop a program for error detecting code using CRC-CCITT (16- bits).
5. Develop a program to implement a sliding window protocol in the data link layer.

6. Develop a program to find the shortest path between vertices using the Bellman-Ford and
path vector routing algorithm.

7. Using TCP/IP sockets, write a client – server program to make the client send the file
name and to make the server send back the contents of the requested file if present.
8. Develop a program on a datagram socket for client/server to display the messages on
client side, typed at the server side.

9. Develop a program for a simple RSA algorithm to encrypt and decrypt the data.

10. Develop a program for congestion control using a leaky bucket algorithm.

Practical Sessions need to be assessed by appropriate rubrics and viva-voce method.

This will contribute to 25 marks
 Daily conduction with record – 15
 Test conduction with viva-voce - 10
 COMPUTER NETWORKS
Subject Code: BCS502 CIE Marks: 50
Contact Hours/Week: 2 Exam Hours: 03
Total Hours: 40
Lesson Planning / Schedule of Experiments

Sl. No Name of the Experiment To be completed

1 Write a program for error detecting code using CRC-CCITT (16- bits). Week 1

Develop a program to implement a sliding window protocol in the data link

2 Week 2
layer.

Develop a program to find the shortest path between vertices using the
3 Week 3
Bellman-Ford and path vector routing algorithm.

Using TCP/IP sockets, write a client – server program to make the client
4 send the file name and to make the server send back the contents of the Week 4
requested file if present.
Implement three nodes point – to – point network with duplex links
5 between them. Set the queue size, vary the bandwidth, and find the number Week 5
of packets dropped.

6 Test-1. Week 6

Develop a program on a datagram socket for client/server to display the

7 Week 7
messages on client side, typed at the server side.

Develop a program for a simple RSA algorithm to encrypt and decrypt the
8 Week 8
data.

9 Develop a program for congestion control using a leaky bucket algorithm Week 9

Implement transmission of ping messages/trace route over a network

10 topology consisting of 6 nodes and find the number of packets dropped due Week 10
to congestion.

Implement an Ethernet LAN using n nodes and set multiple traffic nodes
11 Week 11
and plot congestion window for different source / destination.

12 Test-2. Week 12
 INDEX DAILY CONDUCTION

DAILY CONDUCTION (Max: 15 Marks)

Write-Up & Analysis & Results &

Sl. Page Date of Record Total Staff
Experiment Name Implementation Execution Tabulation
No No. Execution 5 Marks 15 Marks Signature
3 Marks 4 Marks 3 Marks
Write a program for error detecting code using
1
CRC-CCITT (16- bits).
Develop a program to implement a sliding window
2
protocol in the data link layer.
Develop a program to find the shortest path
3 between vertices using the Bellman-Ford and path
vector routing algorithm.
Using TCP/IP sockets, write a client – server
program to make the client send the file name and
4
to make the server send back the contents of the
requested file if present.
Implement three nodes point – to – point network
with duplex links between them. Set the queue size,
5
vary the bandwidth, and find the number of packets
dropped.
Develop a program on a datagram socket for
6 client/server to display the messages on client side,
typed at the server side.
Develop a program for a simple RSA algorithm to
7
encrypt and decrypt the data.
Develop a program for congestion control using a
8
leaky bucket algorithm
Implement transmission of ping messages/trace
route over a network topology consisting of 6 nodes
9
and find the number of packets dropped due to
congestion.
Implement an Ethernet LAN using n nodes and set
10 multiple traffic nodes and plot congestion window
for different source / destination.
 LAB INTERNAL MARKS

Test (T1+T2) Rubrics (Max: 10 Marks)

Write-up Analysis Results

Viva Total
& Implementation & Execution & Tabulation
(10Marks) 50 Marks
(10Marks) (20Marks) (10Marks)

Test-1

Test-2

T1+T2 (100 Marks scaled down 10 Marks) 10

FINAL LAB MARKS

Max marks Marks scored

Daily Conduction 15
Lab Internals 10
TOTAL 25
Signature of the Faculty