Operating Systems OS Lab PCCSL407 Semester 4 KTU BTech CS 2024 Scheme - Dr Binu V P

 About Me

Scheme and Syllabus

Learn about the Linux Operating system Before You Start

Learn The Operating System Theory

Experiments

1.Familiarisation of Basic commands for OS programming

    ps

    top

    strace

    fuser

    time

    gdb

    strings

    objdump

    nm

    file

    od

    xxd

2.Use /proc file system to gather basic information about your machine:

(a) Number of CPU cores
(b) Total memory and the fraction of free memory
(c) Number of processes currently running.
(d) Number of processes in the running and blocked states.
(e) Number of processes forked since the last bootup. How do you compare this value with the one in (c) above?
(f) The number of context switches performed since the last bootup for a particular process.

3.Measuring process execution time

Write a simple program to print the system time and execute it. Then use the /proc file system to determine how long this program(in the strict sense,the corresponding process) ran in user and kernel modes.

Creating Process

    Learn fork command

    More Programs with fork

4.Create a new process using a fork system call.Print the parent and child process IDs.Use the pstree command to find the process tree for the child process starting from the init

Running another process

    Learn exec family of commands

5.Write a program to add two integers(received via the commandline)and compile it to an executable named “myadder”. Now write another program that creates a new process using a fork system call. Make the child process add two integers by replacing its image with the “myadder” image using execvp system call.

Synchronization

Learn about wait() system call 

6.Create a new process using a fork system call. The child process should print the string “PCCSL407” and the parent process should print the string “Operating Systems Lab”. Use a wait system call to ensure that the output displayed is “PCCSL407 Operating Systems Lab”

7. Learn Inter process Communication ( Summary)

    Inter Process Communication using Pipes

    Using Pipes- Computing b^2-4ac

    

    Inter Process Communication using Message Queues

    Using Message Queue- Palindrome Checking

    Inter-process Communication using Shared Memory

    Using Shared Memory- String concatenation and case flipping

8.Mutlithreading 

    Threads- creation and synchronization

    Statistical computations using multithreading

    Demonstration of Race Condition and Its Solution Using Mutex

9.CPU Scheduling

    First Come First Serve (FCFS)

    Shortest Job First (SJF)

    More on FCSFS and SJF

    Shortest Remaining Time First(SRTF)

    Priority Scheduling ( non preemptive)

    Priority Scheduling More Examples

    Round Robin ( RR)

    Round Robin More Examples

    Unified CPU scheduling simulator ( FCFS, SJF, SRTF, RR )

10.Process synchronization using Semaphores

    Simple process ordering example

    Producer-Consumer Problem using Semaphores ( Bounded Buffer)

    Readers-Writers problem with Reader Priority using Semaphores

    Readers-Writers problem with Writer priority using Semaphores

11.Banker’s Algorithm -Finding safe execution sequence

12.Banker’s Algorithm -Finding deadlock occurrence

13.Deadlock-free semaphore-based solution for the dining philosopher’s problem

14.Simulation of address translation in paging scheme

15.Page Replacement Algorithms

FIFO ( First In First Out )

LRU ( Least Recently Used )

LFU ( Least Frequently Used )

Optimal Page Replacement Algorithm 

16.Disk Scheduling Algorithms

SSTF ( Shortest Seek Time First)

SCAN ( elevator algorithm )

CSCAN ( Circular SCAN)

LOOK

Lab Cycles