Scribd
Upload
2 views6 pages

Process Scheduling Examples

The document presents a series of questions related to process scheduling algorithms, including FCFS, preemptive and non-preemptive short-job first, priority scheduling, round-robin, and multilevel feedback queue scheduling. Each question asks for the calculation of average waiting time and average turnaround time for given processes. The document serves as a guide for understanding and applying different scheduling techniques in operating systems.

Uploaded by

khanalprasanna2
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views6 pages

Process Scheduling Examples

The document presents a series of questions related to process scheduling algorithms, including FCFS, preemptive and non-preemptive short-job first, priority scheduling, round-robin, and multilevel feedback queue scheduling. Each question asks for the calculation of average waiting time and average turnaround time for given processes. The document serves as a guide for understanding and applying different scheduling techniques in operating systems.

Uploaded by

khanalprasanna2
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Process scheduling examples:

Q1: Find the average waiting time and average turnaround time for executing the
following processes using FCFS (first-come first-service) scheduling?

Answer:

Q2: Find the average waiting time (A.W.T) and average turnaround time (A.T.A.T) for
executing the following process using (1) Preemptive short-job first (2) Non-preemptive
short-job first?
Q3: Find the average waiting time and turnaround time for executing the following
process using priority scheduling algorithm?
Q4: Find the average waiting time (A.W.T.) and the average turnaround time (A.T.A.T.)
for executing the following processes using round-robin algorithm, where time quantum is
5?
Q25: Consider a multilevel feedback queue scheduling (MLFBQ) with three queues q1, q2,
and q3. q1 and q2 use round-robin algorithm with time quantum (TQ) = 5, and 4
respectively. q3 use first-come first-service algorithm. Find the average waiting time
(A.W.T) and average turnaround time (A.T.A.T) for executing the following process?

You might also like