Q1. Consider the following processes with arrival time and burst time.
30 Marks
|
Process
|
Arrival Time
|
Burst Time
|
|
P1
|
0.0
|
19
|
|
P2
|
7.0
|
8
|
|
P3
|
11.0
|
3
|
|
P4
|
14.0
|
11
|
Calculate waiting time , average waiting time, completion time and average completion time for the following algorithm:
a. FCFS (Assume all processes arrive at time 0 )
Calculate waiting time and average waiting time for the following algorithm:
a. SJF (Non-Pre-emptive)
b. SJF (Pre-emptive) / SRTF
Q2. Consider the following processes with arrival time and burst time.
20 Marks
|
Process
|
Arrival Time
|
Burst Time
|
|
P16
|
0.0
|
29
|
|
P21
|
19.0
|
12
|
|
P32
|
22.0
|
13
|
|
P41
|
30.0
|
25
|
Calculate waiting time and average waiting time Round Robin (R-R) scheduling algorithm by using the following Quantum/Time slice:
a. Quantum / Time Slice = 8
b. Quantum / Time Slice = 16
Q3. Calculate the CPU Utilization and Idle time by considering 35% I/O wait and number of processes are from 1 to 5. Draw a chart as well, where
x-axis showing number of processes and y-axis showing CPU utilization.