You are on page 1of 1

Project No.

1
Submit the project before 15th April 2020 in soft form and keep the hardcopy
with you as well. Hardcopy is submitted latter when classes resume by each
student individually. Copy-paste is not accepted if found will be given F grade.
Experimen Division of Description of Experiments
t No. Experiment
Write a program to simulate the following
non-preemptive CPU scheduling algorithms
to find average turnaround time and average
waiting time. a) FCFS b) SJF c)
1
Round Robin (pre-emptive) d) Priority Queue.
Take any five process with its burst time.
Assume all the processes arrive at the same
CPU
time.
Scheduling
Write a program to simulate multi-level queue
Algorithms
scheduling algorithm considering the
following scenario. All the processes in the
system are divided into two categories –
2
system processes and user processes.
System processes are to be given higher
priority than user processes. Use FCFS
scheduling for the processes in each queue.
Write a program to simulate the following
contiguous memory allocation techniques
Memory a) Worst-fit b) Best-fit c) First-fit
3 Management Take the number of memory blocks: 4
System Take the number of process: 3
Take size of each block as (2,3,5,7).
Take the size of the process (1,2,4)

You might also like