1. Write the character stuffing programming using c language and explain it.

Aim/Procedure Program Results Viva-Voce Record Total

20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

2. To implementation program for error correction technique using c language

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

3. Write and execute the windowing (sliding window protocol) technique with suitable
diagram.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

Page1of9
 4. Implementation of Go back N protocol with neat diagram.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

5. Write and implement a FTP Protocol program using client server model.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

6. How to prevent the corruption during data transmitted using bit stuffing method in c
language

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

Page2of9
 7. Perform Data transfer between two nodes using Stop & Wait protocol under the
following conditions.
a. Normal Operation. b. Lost / Damaged Frame c. Lost Acknowledgement frame

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

8. Create a scenario and analyze the performance of the network with CSMA/CA
protocol.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

9. Perform secure communication using suitable encryption and decryption techniques

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

Page3of9
 10. Design and implement and implement a network with star topology and
perform the file transfer. Compare its performance when a node in the network is
disconnected.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

11. Design and implement a network with ring topology and perform the file
transfer. Compare its performance when a node in the network is disconnected.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

12. Perform implementation of Stop and Wait Protocol using c programming

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

Page4of9
 13. Implement the Stop-n-Wait Protocol for packet length 10,100,1000 bytes with
error rate 10 -5 and show the output for the 2 scenarios:
(i)Lost Data Frames and (ii) Damaged Frames

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

14. Implement a Sliding Window Protocol - Selective Repeat ARQ and show the
output for the 2 scenarios: (i) Lost Data Frames and (ii) Damaged Frames

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

15. Implement Sliding Window Protocol - Go Back-N ARQ for the packet length
100 and 1000 bytes with time out range of 0.1,0.5,1.5,10 seconds .Show the
output for the 2 scenarios:
(i)Lost Data Frames and (ii) Damaged Frames

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100
Page5of9
INTERNAL EXAMINER EXTERNAL EXAMINER

16. Apply distance vector routing algorithm for the following directed graph.
Display the permanent and tentative lists at each stage of the graph. Take R1 as
the source node. Show the permanent and tentative list for node 'R6'. Write a
program for implementing the same.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

17. Simulate CSMA/CD protocol and show the occurrence of Collision and its
avoidance.

Page6of9
Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total
Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

Page7of9
 18. Verify and demonstrate the Ring, Bus and Star Topology. Assume 5 nodes for
each topology and comment on the reliability of each of them.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

19. Implement a reliable data transfer between node A and Node B over an
unreliable network using Stop-n-Wait Protocol and calculate the throughput for
the 2 scenarios:

(i)Lost Data Frames and (ii) Damaged Frames

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

INTERNAL EXAMINER EXTERNAL EXAMINER

20. Implement a Sliding Window Protocol - Selective Repeat ARQ and estimate the
throughput.

Aim/Procedure Tabulation/Circuit/ Calculation& Viva-Voce Record Total

Program/Drawing Results
20 30 30 10 10 100

Page8of9
INTERNAL EXAMINER EXTERNAL EXAMINER

Page9of9