Subject Name: Operating System Lab Name of student:

Subject Code: CS-18 Roll No.: Section:

INDEX
PROGRAM PROGRAM TITLE / DESCRIPTION DATE OF DATE OF DATE OF REMARKS
NO. ALLOCATION COMPLETION VIVA-VOCE

1. List of processes / jobs along with their arrival

times & CPU burst times is given. Write a
program to print the total waiting time, average
waiting time, total turnaround time, average
turnaround time & Gantt Chart using First Come
First Serve (FCFS) CPU scheduling policy.
2. List of processes / jobs along with their arrival
times & CPU burst times is given. Write a
program to print the total waiting time, average
waiting time, total turnaround time, average
turnaround time & Gantt Chart using Shortest
Job First (SJF) CPU scheduling policy.
3. List of processes / jobs along with their arrival
times, priority value & CPU burst times is given.
Write a program to print the total waiting time,
average waiting time, total turnaround time,
average turnaround time & Gantt Chart using
Priority CPU scheduling policy.
4. List of processes / jobs along with their arrival
times & CPU burst times is given. Write a
program to print the total waiting time, average
waiting time, total turnaround time, average
turnaround time & Gantt Chart using Round
Robin CPU scheduling policy.
5. Write a program to simulate the First-fit
contiguous memory allocation technique.
6. Write a program to simulate the Best-fit
contiguous memory allocation technique.
7. Write a program to simulate the Worst-fit
contiguous memory allocation technique.
8. Write a program to simulate the following file
allocation strategies. a) Sequential b) Linked
9. Write a program to simulate the MVT and MFT
memory management techniques.
10. Write a program to simulate Bankers algorithm
for the purpose of deadlock avoidance.

Submitted to Teacher Incharge: Dr. S. K. Goyal

Subject Name: Operating System Lab Name of student:
Subject Code: CS-18 Roll No.: Section:

INDEX

PROGRAM PROGRAM TITLE / DESCRIPTION DATE OF DATE OF DATE OF REMARKS

NO. ALLOCATION COMPLETION VIVA-VOCE

11. Write a program to simulate First In First Out

(FIFO) page replacement algorithm.
12. Write a program to simulate Least Recently
Used (LRU) page replacement algorithm.
13. Write a program to simulate producer-
consumer problem with the help of
semaphores.

Submitted to Teacher Incharge: Dr. S. K. Goyal