JulyAugust 2021
JulyAugust 2021
2. Consider the following five processes with the length of the CPU burst time in
U
milliseconds.
Process Burst Time Priority
se
P1 10 3
P2 1 1
P3 2 3
d
P4 1 4
P5 5 2
27
Processes are assumed to have arrived at time 0.
For the above set of processes find the average waiting time and average turn around time
for each of the following scheduling algorithm using Gantt chart. Consider 1 is highest
-0
priority:
a) SJF b) Non Preemptive Priority [7+8]
7-
3. What is Deadlock? List the condition that leads to deadlock. How deadlock can be
prevented. [15]
21
4.a) Distinguish between logical verses physical address space.
b) Explain about Virtual Memory Management in detail. [7+8]
8. What is Mutual exclusion? Explain Peterson’s solution for mutual exclusion problem.
[15]
---ooOoo---