SPPU 2019-P ,TE IT ,OPERATING SYSTEM LABORATORY PRACTICALS
1.Employee - Address Book
-
a. Implement the C program in which main program accepts the integers to be sorted. Main program uses the FORK system call to create a new process called a child process. Parent process sorts the integers using sorting algorithm and waits for child process using WAIT system call to sort the integers using any sorting algorithm. Also demonstrate zombie and orphan states.
-
b. Implement the C program in which main program accepts an array. Main program uses the FORK system call to create a new process called a child process. Parent process sorts an array and passes the sorted array to child process through the command line arguments of EXECVE system call. The child process uses EXECVE system call to load new program which display array in reverse order.
-
Implement the C program for CPU Scheduling Algorithms: Shortest Job First (Preemptive) and Round Robin with different arrival time.
-
a. Thread synchronization using counting semaphores and mutual exclusion using mutex. Application to demonstrate: Producer Consumer problem with counting semaphores and mutex. b. Thread synchronization and mutual exclusion using mutex. Application to demonstrate: Reader-Writer problem with reader priority.
-
Implement the C program for Deadlock Avoidance Algorithm: Bankers Algorithm.
-
To implement page replacement algorithms using virtual memory.
-
a. Full duplex communication between two independent processes. First process accepts sentences and writes on one pipe to be read by second process and second process counts number of characters, number of words and number of lines in accepted sentences, writes this output in a text file and writes the contents of the file on second pipe to be read by first process and displays on standard output.
b. Inter-process Communication using Shared Memory using ystem V. Application to demonstrate: Client and Server Programs in which server process creates a shared memory segment and writes the message to the shared memory segment. Client process reads the message from the shared memory segment and displays it to the screen.
-
Implement the C program for Disk Scheduling Algorithms: SSTF, SCAN, CLook considering the initial head position moving away from the spindle.