NETWORKING LAB 1.

Design, develop, and execute a program to implement a simple echo server and demonstrate its working. Both the server and client are to be connection-oriented and use TCP. The system works as follows: Client reads a line from the standard input and writes the line to the server; the server reads a line from its network input and echoes the line back to the client; the client reads the echoed line and prints it on its standard output. 2 Repeat the above experiment using UDP instead of TCP.

3.Implementation of FTP.[Started] 4.Implementation of ARP and RARP. 5.Implementation of shortest path routing algorithm. 6.Implementation of sliding window protocols Mini Project: Design, develop the project to implement any utility in TCP/IP suite like ICMP Protocol, TFTP,NNTP,ProxyServer,ApplicationFirewall,Web browsers etc.

1.

Simulation of ARP / RARP.

2. Write a program that takes a binary file as input and performs bit stuffing and CRC Computation. 3. 4. 5. 6. Develop an application for transferring files over RS232. Simulation of Sliding-Window protocol. Simulation of BGP / OSPF routing protocol. Develop a Client â Server application for chat.

7. Develop a Client that contacts a given DNS Server to resolve a given host name. 8. 9 &10 Write a Client to download a file from a HTTP Server. Study of Network Simulators like NS2/Glomosim / OPNET .

OS Lab I need C & Java implementation. OPERATING SYSTEM LAB - CS451 (Implement the following on LINUX platform. Use C for high level language implementation) 1. Shell programming - command syntax - write simple functions - basic tests 2. Shell programming - loops

their CPU burst times and arrival times. [Care should be taken to merge contiguous free blocks into one single block. readdir 4. compute and print the average waiting time and average turnaround time 8. 10.. 6. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id. For each of the scheduling policies. exec. Implement some memory management schemes â I 10. etc. write. 8.expansions . 5. Write C programs to simulate UNIX commands like ls. wait. Implement FIFO page Replacement Algorithm. Implement the creation of Shared memory Segment. display/print the Gantt chart for Priority and Round robin. .substitutions 3. 9. 3. their CPU burst times and arrival times.Writer Problem) Using Semaphores. Given the list of processes. getpid. 4. Implement Memory Allocation with Pages. Write programs using the following system calls of UNIX operatin g system: fork. worst fit and best fit. close.patterns . First Fit Algorithm for Memory Management. Implement the following CPU scheduling Alogrithms i) FIFO (ii) Shortest Job First (iii) Round Robin 2. Write programs using the I/O system calls of UNIX operating system (open. Implement Best fit. Implement LRU page Replacement Algorithm. compute and print the average waiting time and average turnaround time 7. Given the list of processes. For each of the scheduling policies. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. Implement the Mutual Exclusion Problem Using Dekkerâ s Algorithm. Implement some memory management schemes â II Example for expt 9 & 10: Free space is maintained as a linked list of nodes with each node having the starting byte address and the ending byte address of a free block. 1. 6. Implement Bankerâ s algorithm. grep. exit. read. When a process finishes (taken as input) the appropriate node from the allocated list should be deleted and this free disk space should be added to the free space list. etc) 5. opendir. 7. For allocation use first fit. display/print the Gantt chart for FCFS and SJF. Implement Inter Process Communication Problem (Producer-Consumer / Reader. starting byte address and the ending byte address of the allocated space. 9. stat. Implement File Locking. Implement the Producer â Consumer problem using semaphores. Each memory request consists of the process-id and the amount of storage space required in bytes.