Instructions: Process F G H J K Arrival Time 11 17 24 Bust Time 4 7 6 12 1. Apply the following scheduling algorithms to the list of processes above. First-Come First-Serve • Shortest Remaining Time First Round Robin: Quantum = 3 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): 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?
Instructions: Process F G H J K Arrival Time 11 17 24 Bust Time 4 7 6 12 1. Apply the following scheduling algorithms to the list of processes above. First-Come First-Serve • Shortest Remaining Time First Round Robin: Quantum = 3 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): 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?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:Instructions:
Process
H.
J
K
Arrival Time
Bust Time
11
17
24
4
3
7
12
1. Apply the following scheduling algorithms to the list of processes above.
• First-Come First-Serve
Shortest Remaining Time First
Round Robin: Quantum = 3
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):
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?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education