Welcome to the Operating Systems Lab! This repository contains materials for the B.Tech. II Year II Sem. Operating Systems Lab. Below you will find essential information about the course, including prerequisites, objectives, outcomes, list of experiments, and recommended textbooks.
- Course Code: OS Lab
- Duration: II Year II Semester
- Lecture Hours: 0
- Tutorial Hours: 0
- Practical Hours: 2
- Credits: 1
-
Write C programs to simulate the following CPU Scheduling algorithms:
- a) FCFS
- b) SJF
- c) Round Robin
- d) Priority
-
Write programs using the I/O system calls of UNIX/LINUX operating system:
-
Write a C program to simulate Bankers Algorithm for Deadlock Avoidance and Prevention.
-
Write a C program to implement the Producer – Consumer problem using semaphores using UNIX/LINUX system calls.
-
Write C programs to illustrate the following IPC mechanisms:
- a) Pipes
- b) FIFOs
- c) Message Queues
- d) Shared Memory
-
Write C programs to simulate the following memory management techniques:
- a) Paging
- b) Segmentation
-
Write C programs to simulate Page replacement policies:
- a) FCFS
- b) LRU
- c) Optimal
- Operating System Principles - Abraham Silberschatz, Peter B. Galvin, Greg Gagne (7th Edition), John Wiley
- Advanced Programming in the Unix Environment - W.R. Stevens, Pearson Education.
Feel free to contribute by submitting pull requests or by raising issues. Happy coding!