Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
17 views4 pages

Problem

The document outlines a series of scheduling problems involving various processes characterized by burst time, arrival time, and priority. It requires the calculation of average waiting time and average turnaround time for different scheduling algorithms including preemptive and non-preemptive priority scheduling, round robin scheduling, and FCFS. The document presents multiple sets of processes for analysis, each with distinct parameters.

Uploaded by

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

Problem

The document outlines a series of scheduling problems involving various processes characterized by burst time, arrival time, and priority. It requires the calculation of average waiting time and average turnaround time for different scheduling algorithms including preemptive and non-preemptive priority scheduling, round robin scheduling, and FCFS. The document presents multiple sets of processes for analysis, each with distinct parameters.

Uploaded by

nctitacademic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1. Consider the following processes, burst time, arrival time.

Process Burst Time Priority Arrival Time


P1 6 2 0
P2 2 2 1
P3 3 4 1
P4 1 1 2
P5 2 3 2
Calculate the average waiting time and Calculate the average
turnaround time.
a. Preemptive & non-preemptive Priority scheduling
b. Round robin scheduling (use time slice = 2ns)
c. FCFS
2. Consider the following processes, burst time, arrival time.
Process Burst Time Arrival time Priority
P1 4 2 4
P2 2 1 1
P3 5 0 2
P4 3 3 3
Calculate the average waiting time and Calculate the average
turnaround time.
a. Preemptive & non-preemptive SJF scheduling
b. Preemptive priority scheduling (lower number for priority
means high priority)
c. Round robin scheduling (use time slice = 2ns)
3. Consider the following processes, burst time, arrival time.
Process Burst Time Priority Arrival Time
P1 10 5 0
P2 6 2 0
P3 7 4 1
P4 4 1 1
P5 5 3 2

4. Consider the following processes, burst time, arrival time.


Process Burst Time Priority Arrival Time
P1 8 1 0
P2 4 3 1
P3 9 4 2
P4 5 2 3
5. Consider the following set of processes with the length of CPU burst-
time given in milliseconds.
Process Burst time Priority Arrival time
P1 10 3 0
P2 1 1 0
P3 2 3 0
P4 1 4 0
P5 5 2 0

6. Consider the following set of processes with the length of the CPU-
burst time in given ms:
Process Burst Time Arrival time Priority
P1 8 0 1
P2 4 1 3
P3 9 2 4
P4 5 3 2
P5 3 4 2

7. Consider the following set of processes with the length of CPU burst
time given in milliseconds.
Process Burst Time priority Arrival time
P1 10 3 0
P2 1 1 1
P3 2 3 2
P4 1 4 1
P5 5 2 2
8. Consider the following CPU processes with arrival times (in
milliseconds) and length of CPU bursts (in milliseconds) as given
below: (15 Marks)
Process Arrival time Burst time Priority
P1 0 7 1
P2 3 3 4
P3 5 5 2
P4 6 2 3
9. Consider the set of processes with arrival time (in milliseconds), CPU
burst time (in milliseconds), and priority (0 is the highest priority)
shown below. None of the processes have I/O burst time. (15 Marks)

Process Arrival time Burst Time Priority


P1 0 11 2
P2 5 28 0
P3 12 2 3
P4 2 10 1
P5 9 16 4
10. Consider the following processes, with the arrival time and the
length of the CPU burst given in milliseconds. (15 Marks)

Process Arrival Time Burst Time Priority


P1 0 10 3
P2 3 6 1
P3 7 1 2
P4 8 3 4
11. Consider the following set of processes that need to be scheduled on
a single CPU. All the times are given in milliseconds. (15 Marks)
Priorit
Process NameArrival TimeBurst Time
y
A 0 6 4
B 3 2 2
C 5 4 1
D 7 6 3
E 10 3 5

12. For the processes listed in the following table, which of the
following scheduling schemes will give the lowest average turnaround
time? (15 Marks)

Process Arrival Time Burst Time Priority


A 0 3 2
B 1 6 1
C 4 4 4
D 6 2 3

You might also like