Given the following information: Process | Arrival Time | Burst time…

Question

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 | 4 | 2 | 4

Compute average waiting time and average turnaround time for the following scheduling algorithms:

i. Round Robin(quantum=1)

ii. Priority preemptive

iii. Preemptive SJF?

Related pages

• Scheduling Algorithms — topic
• Operating Systems syllabus

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…
• 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…
• 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.