Scribd
Upload
99 views2 pages

Operating System Experiments

The document is an index of experiments related to operating systems, detailing various tasks to be performed using Linux and C programming. It includes basic commands, shell programs, system calls, CPU scheduling algorithms, memory allocation techniques, and file organization strategies. The experiments also cover synchronization problems like the Producer-Consumer and Dining Philosopher problems.

Uploaded by

hii421124my
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
99 views2 pages

Operating System Experiments

The document is an index of experiments related to operating systems, detailing various tasks to be performed using Linux and C programming. It includes basic commands, shell programs, system calls, CPU scheduling algorithms, memory allocation techniques, and file organization strategies. The experiments also cover synchronization problems like the Producer-Consumer and Dining Philosopher problems.

Uploaded by

hii421124my
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

OPERATING SYSTEM LIST OF

EXPERIMENTS
INDEX:-

1. Basic Commands in Linux Operating System.

2. Write a Shell program to check the given number is even or odd.

3. Write a Shell program to swap the two integers.

4. Write a Shell program to find the factorial of a number.

5. Write a shell program to generate Fibonacci series.

6. Write a C program using the following system calls (fork, exec).

7. Write a C program using the following system calls (get_pid, exit).

8. Write a C program using the I/O system calls (open, read, write, etc)

9. Write a C program to simulate CPU scheduling algorithms: FCFS, SJF, and Round Robin.

10. Write a C program to simulate Page Replacement Algorithms


a) FIFO
b) LRU.

11. Implementation of memory allocation algorithms:


a) First Fit
b) Best Fit
c) Worst Fit.

12. Implement the Producer – Consumer problem using semaphores.

13. Implement the Dining Philosopher problem using semaphores.

14. Write a C program to simulate Intra & Inter – Process Communication (IPC) techniques.

15. Write a C program to simulate Bankers Algorithm for Deadlock Detection.

16. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance.

17. Simulate all File Organization Techniques


a) Single level directory
b) Two level.
18. Simulate all file allocation strategies
a) Sequential
b) Indexed
c) Linked.

19. Write a C program to simulate implementation of FCFS Disk Scheduling Algorithms.

20. Write a C program to simulate implementation SSTF Disk Scheduling Algorithm.

You might also like