OSV Assignment1
OSV Assignment1
OSV Assignment1
Q.6 Following table gives arrival time and expected run time of five processes. Ignore
process switching overhead. Draw the Gantt chart and find average turnaround time
for Round robin (quantum = 2 sec) scheduling algorithm.
Process Expected Run time (in sec.) Arrival Time (in sec.)
A 8 1
B 1 4
C 2 2
D 1 5
E 5 6
Q.7 Explain the classical thread model with its implementation strategies.
Q.8 State and explain the four conditions which must occur to have deadlock in the
system.
*********