Scribd
Upload
23 views1 page

Operating Systems Lab: Course Code: 19IT1105 L T P C

The document outlines an operating systems lab course covering CPU scheduling algorithms, process coordination, memory management techniques, file system techniques, and disk scheduling algorithms. It lists 12 programs to simulate these topics and provides references for further reading.

Uploaded by

sadi dileepkumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
23 views1 page

Operating Systems Lab: Course Code: 19IT1105 L T P C

The document outlines an operating systems lab course covering CPU scheduling algorithms, process coordination, memory management techniques, file system techniques, and disk scheduling algorithms. It lists 12 programs to simulate these topics and provides references for further reading.

Uploaded by

sadi dileepkumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

INFORMATION TECHNOLOGY 2019

OPERATING SYSTEMS LAB

Course Code: 19IT1105 LT P C


0 0 3 2
Course Outcomes: At the end of the Course the student shall be able to
CO 1: Compare CPU scheduling algorithms.
CO 2: Analyze process coordination.
CO 3: Analyze memory management techniques.
CO 4: Implement different File System Techniques.
CO 5: Implement Disk Scheduling Algorithms.

List of Programs:
1. Simulate the following non-preemptive CPU scheduling algorithms to find turnaround
time and waiting time.
a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority
2. Implement multi-level queue scheduling algorithm
3. Develop a program to simulate producer-consumer problem using semaphores.
4. Develop a program to simulate the concept of Dining-Philosophers problem.
5. Implement Bankers algorithm for the purpose of deadlock avoidance.
6. Simulate the following contiguous memory allocation techniques
a) Worst-fit b) Best-fit c) First-fit
7. Implement MVT and MFT memory management techniques
8. Develop a program to simulate paging technique of memory management.
9. Simulate the following page replacement algorithms:
a) FIFO b) LRU c) Optimal d)LFU
10. Simulate the following file allocation strategies:
a) Sequential b) Indexed c) Linked
11. Develop a program to simulate the following file organization techniques
a) Single level directory b) Two level directory c) Hierarchical
12. Develop a program to simulate the following disk scheduling algorithms:
a) FCFS b) SCAN c) C-SCAN
Note: Students can implement the above programs using either C / C++
References:
1. Abraham Silberchatz, Peter B. Galvin, Greg Gagne,“Operating System Principles”, 8th
Edition, John Wiley &Sons.
2. William Stallings, “Operating Systems – Internal and Design Principles”, 6th Edition,
Pearson education/PHI.

11

You might also like