Consider a system with a set of processes P1, P2, P3 and their CPU bu…
Previous year question for Operating Systems.
Question
Consider a system with a set of processes P1, P2, P3 and their CPU burst times, priorities and arrival times being mentioned as below:
Process | CPU burst time | Arrival time | Priority
--- | --- | --- | ---
P1 | 5 | 0 | 2
P2 | 15 | 1 | 3
P3 | 10 | 2 | 1
Assuming 1 to be the highest priority, calculate average waiting time and average turnaround time for following scheduling algorithms:
(i) First come first served
(ii) Preemptive shortest job first
(iii) Non preemptive shortest job first
(iv) Preemptive priority
(v) Non Preemptive priority
(vi) Round robin (with time quantum of 2 units)
- Year: 2018
- Subject: Operating Systems
Related pages
More PYQs on Scheduling Algorithms
- Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed : 10+10 | Process | Arriv…
- Given the following information: Process | Arrival Time | Burst time | Priority --- | --- | --- | --- A | 0 | 3 | 3 B | 1 | 6 | 5 C | 2 | 1 | 2 D | 3 | 4 | 1 E…
- What is starvation and convoy effect and in which of the scheduling algorithms these can occur?
- Explain the difference between Preemptive Shortest job first and Non preemptive shortest job first scheduling algorithms with an example.