Scribd
Upload
100 views

06 Task Performance Template

The document summarizes the results of applying three process scheduling algorithms - First Come First Serve, Shortest Remaining Time First, and Round Robin - to a set of seven processes. For each algorithm, it provides a table with the finish time, turnaround time, and waiting time for each process. It also includes the average turnaround and waiting times. The document asks to perform the same analysis and provide Gantt charts and assessments of the algorithms.

Uploaded by

MIXTRAP MUSIC
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100 views

06 Task Performance Template

The document summarizes the results of applying three process scheduling algorithms - First Come First Serve, Shortest Remaining Time First, and Round Robin - to a set of seven processes. For each algorithm, it provides a table with the finish time, turnaround time, and waiting time for each process. It also includes the average turnaround and waiting times. The document asks to perform the same analysis and provide Gantt charts and assessments of the algorithms.

Uploaded by

MIXTRAP MUSIC
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

IT2105

Name: Francisco, Adrian kim____________________________________ Date: December 6,2022


Section :BT301

Process E F G H I J K
Arrival Time 0 2 3 5 11 17 24
Bust Time 4 9 3 7 5 6 12

1. Apply the following scheduling algorithms to the list of processes above.


 First-Come First-Serve
Process E F G H I J K
Finish Time 4 13 16 23 28 34 46
Turnaround
Time 4 11 13 18 17 17 22
Waiting
Time 0 2 10 11 12 11 10
Average Turnaround Time: 102 / 7 = 14.57
Average Waiting Time: 56 / 7 = 8.00

 Shortest Remaining Time First


Process E F G H I J K
Finish Time 4 34 7 14 19 25 46
Turnaround
Time
4 32 4 9 8 8 22
Waiting
Time
0 23 1 2 3 2 10
Average Turnaround Time: 87 / 7 = 12.43
Average Waiting Time: 41 / 7 = 5.86

 Round Robin: Quantum = 3


Process E F G H I J K
Finish Time 10 25 9 31 30 37 46
Turnaround
Time
10 23 6 26 19 20 22
Waiting
Time
6 14 3 19 14 14 10
Average Turnaround Time: 126 / 7 = 18
Average Waiting Time: 80 / 7 = 11.43

06 Task Performance 1 Answer Key *Property of STI


Page 1 of 2
IT2105
2. For each process scheduling algorithm, provide the following:

a. A complete and detailed table that contains the following criteria for each process (10 points):
o Finish time
o Turnaround time
o Waiting time
b. A detailed Gantt Chart (5 points)
c. The average turnaround time (3 points)
d. The average waiting time (2 points)

3. Then, answer the following items (5 items x 5 points) Answers may vary:
a. Among the three (3) process scheduling algorithms that you have performed, which do you think is the
most efficient and why?

b. Cite significant differences in the results of applying the First-Come First-Serve algorithm and Round
Robin algorithm. Elaborate on your answer.

c. What could possibly happen if the value of the Quantum in Round Robin is increased to 5? Elaborate on
your answer.

d. In your opinion, why does the average turnaround time and waiting time vary per algorithm?

e. Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file
management system? Why or why not?

06 Task Performance 1 Answer Key *Property of STI


Page 2 of 2
IT2105

Grading rubric for the table (2.a):


Performance Indicator Points
The table contains complete and correct values for the finish time, turnaround time, and waiting time. 10
There are only two to four incorrect values in the table. 7
Only half of the table contains the correct values. 5
There are only two to four correct values in the table. 3

Grading rubric for the Gantt Chart (2.b):


Criteria Performance Indicator Points
Content Correct process labels and scheduling criteria are included in the chart. 3
Organization The chart was presented in an organized manner. 2
TOTAL 5

Grading rubric for the essay:


Criteria Performance Indicator Points
Content Correct ideas, concepts, and/or examples were included. 3
Organization The presentation of the idea was generally organized. 2
TOTAL 5
Note: DO NOT COPY AND PASTE. All students who copy and paste their work from any website or their classmates will automatically receive a failing mark for this assessment task.

06 Task Performance 1 Answer Key *Property of STI


Page 3 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy