Some FON Programming Definitions That may be Useful....

1. Write a C Program which demonstrates byte-stuffing framing technique, where sender reads data from file, stuffs necessary details and send it to receiver. Both sender and receiver are capable enough to handle multiple/combination occurrences of flag/escape sequences. Receiver display original message after de – stuffing if required. For sender/receiver communication use IPC mechanism FIFO/Named Pipes in Linux/Unix environment.


2. Write a C Program which demonstrates character-count technique, where sender reads a string from a file and sends it to receiver along with the count of characters of the string in a single frame. Receiver must display the original message along with the length received. Assume that communication channel is noiseless. For sender/receiver communication use IPC mechanism FIFO or Named Pipes in Linux/Unix environment.


3. Write a C Program which implements checksum technique. Sender reads data from file then appends checksum information and send it to receiver. Receiver must display the original message after checking the checksum information. For sender/receiver communication use IPC mechanism FIFO/Named Pipes in Linux/Unix environment. Use bit-wise operator only whenever necessary.


4. Write a C Program which simulates stop-n-wait protocol. Sender sends a frame of data and then waits for positive ACK from receiver. Receiver must display original message received via channel. The data to be sent to the receiver is read from a file by the sender. Assume that communication channel is noiseless. For sender/receiver communication use IPC mechanism FIFO or Named Pipes in Linux/Unix environment.


5. Write a C Program which simulates simplex protocol. Sender side is going to send data (any number/character) as soon as it receives a ‘send request’ from network layer. Receiver must display original message received via channel. Assume that communication channel is noiseless. There is no need to implement timer/ Lost-ACK logic. Implement channel using the IPC mechanism FIFO or Named Pipes in Linux/Unix so that both the programs are able to communicate. The data to be sent is read from an existing file and not to be taken as input from the user.


6. Write a C program to read data from file. Sender generates Hamming Code for given data using bitwise operators only. Hamming code is send to receiver via named pipes. Receiver should correct the error if any and display the appropriate output. Implement channel using the IPC mechanism FIFO or Named Pipes in Linux/Unix so that both the programs are able to communicate.


7. Demonstrate bit-stuffing techniques using C program. Sender stuffs 0 after five consecutive occurrences of 1. Receiver must identify this situation and display original message. Message to send is to read from file. Implement channel using the IPC mechanism FIFO or Named Pipes in Linux/Unix so that both the programs are able to communicate. Use bit-wise operators to perform the stuffing operation.

Reference:-
 Last Year GTU Practicle Paper

PLEASE SHARE

Tweet

Read More