GOKARAJU RANGARAJU INSTITUTE OF ENGINEERING AND TECHNOLOGY
OPERATING SYSTEMS LAB
Course Code: GR22A2079 L/T/P/C: 0/0/3/1.5
II Year II Semester
Course Outcomes:
1. Evaluate the performance of different types of CPU scheduling algorithms
2. Implement producer-consumer problem, reader-writers problem,and Dining philosophers’
problem using semaphores.
3. Simulate Banker’s algorithm for deadlock avoidance
4. Implement paging techniques and page replacement policies, memoryallocation
techniques in memory management.
5. Implement disk scheduling techniques and file allocation strategies .
TASK 1
Practice the following commands in UNIX environment
a) cp b) rm c) mv d) chmod e) ps f) kill
TASK 2
Write a program that makes a copy of a file using standard I/O and system calls.
TASK 3
Simulate the following Scheduling algorithms.
a) FCFS b)SJF c)Priority d)Round Robin
TASK 4
Simulate the Producer Consumer problem using semaphores.
TASK 5
Simulate the Readers – Writers problem using semaphores.
TASK 6
Simulate the Dining Philosophers problem using semaphores
TASK 7
Simulate Bankers Algorithm for Deadlock Avoidance.
TASK 8
Simulate First Fit and Best Fit algorithms for Memory Management.
TASK 9
Simulate paging technique of memory management.
TASK 10
Simulate page replacement Algorithms. a)FIFO b)LRU
78
TASK 11
Simulate following Disk Scheduling algorithms.
a)FCFS b)SSTF c)SCAN d)C-SCAN
e)LOOK f)C-LOOK
TASK 12
Simulate file allocation strategies.
a) Sequential b)Indexed c)Linked
Text Books/ References:
1. Operating System Concepts- Abraham Silberchatz , Peter B. Galvin, Greg Gagne7th
Edition, JohnWiley.
2. Operating Systems– Internal and Design Principles Stallings, Fifth Edition–2005,Pearson
education/PHI.
79