Scribd
Upload
7 views2 pages

DCCN Lab Exercise

The document outlines a series of programming assignments for a lab course focused on socket programming and networking concepts. Tasks include implementing TCP and datagram socket communication, file transfers, digital waveform generation, error detection and correction methods, and pathfinding algorithms using Dijkstra's and Bellman-Ford's algorithms. Each assignment aims to reinforce practical skills in network programming and error handling techniques.

Uploaded by

Ridya Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views2 pages

DCCN Lab Exercise

The document outlines a series of programming assignments for a lab course focused on socket programming and networking concepts. Tasks include implementing TCP and datagram socket communication, file transfers, digital waveform generation, error detection and correction methods, and pathfinding algorithms using Dijkstra's and Bellman-Ford's algorithms. Each assignment aims to reinforce practical skills in network programming and error handling techniques.

Uploaded by

Ridya Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CA414 – DCCN LAB

1. WAP to implement socket programming to display date and time from server to client
using TCP Sockets.
2. Write a program to send and receive a message from Server to Client and vice a versa
using TCP socket.
3. Write a program to send and receive a text file from Server to Client and vice a versa
using TCP socket. (Use character stream)
4. Write a program to send and receive any file from Server to Client and vice a versa
using TCP socket. (Use binary stream)
5. WAP to send and receive a message from client to server and vice versa, using
datagram socket.
6. WAP to send an image/audio file from client to server using datagram socket.
7. Write a program to implement an Arithmetic Server using TCP socket.
8. Write a program to implement ARP and RARP using socket programming.
9. Write a program to generate the digital waveform for a given bit string using following
digital encoding schemes:
a. NRZ – L
b. NRZ – I
10. Write a program to generate the digital waveform for a given bit string using following
digital encoding schemes:
a. Bipolar AMI
b. Pseudo ternary
11. Write a program to generate the digital waveform for a given bit string using following
digital encoding schemes:
a. Manchester
b. Differential Manchester
12. Write a program to generate the digital waveform for a given bit string using following
scrambling techniques for digital encoding:
a. B8ZS
b. HDB3
13. Write a program to generate the VRC-LRC code for a given message. Introduce an
error (Single bit/ Multiple bit) at random location in the message and detect the error.
14. Write a program to generate the Checksum code for a given message. Introduce an
error at random location in the message and verify that you can detect the error.
15. Write a program to generate the CRC code for a given message and CRC polynomial.
Introduce a single bit error at random location in the message and verify that you can
detect the error.
16. Write a program to implement the Hamming Code method for error detection and
error correction.
17. Write a program to simulate the Stop & Wait automatic repeat request (ARQ) protocol
for a randomly generated sequence of frames and acknowledgments with error.
18. Write a program to simulate the Sliding Window automatic repeat request (ARQ)
protocol for a randomly generated sequence of frames and acknowledgments with
error.
19. Write a program to compute the least cost path from a user specified source node to
all other nodes for a given network using Dijkstra’s algorithm. Display the path and
path cost for each node.
20. Write a program to compute the least cost path from a user specified source node to
all other nodes for a given network using Bellman-Ford’s algorithm. Display the path
and path cost for each node.

You might also like