Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
1. Complete requested data for each scheduling algorithm. 2. Average turn around time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 3. Average wait time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 4. Submitted this completed document to Webcourses. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. C. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. Calculate the average wait time of the processes. e. Time Table Gantt Chart Process ID Time Process ID 1 0 23456 Process ID 1 2 # Average turn around time = Average waiting time: = 23 3 4 456 6 11 Arrival Time 7 Exit Time # 8519 0 3 Burst Time 9 10 7 # 58 21 Turn Around Time # I Waiting Time # #

1. Complete requested data for each scheduling algorithm. 2. Average turn around time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 3. Average wait time must be fully explained (e.g. 1+2+3+4+5=15/5=3) 4. Submitted this completed document to Webcourses. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. C. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. Calculate the average wait time of the processes. e. Time Table Gantt Chart Process ID Time Process ID 1 0 23456 Process ID 1 2 # Average turn around time = Average waiting time: = 23 3 4 456 6 11 Arrival Time 7 Exit Time # 8519 0 3 Burst Time 9 10 7 # 58 21 Turn Around Time # I Waiting Time # #

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Operating Systems Fill in the blank. Find the average turn around time and average waiting time. Show step by step how you got the answer. Please make sure the answers are correct.
1. Complete requested data for each scheduling algorithm. 2. Average tum around time must be fully explained (e.g. 1+2+3+4+5=15/5 = 3) 3. Average wait time must be fully explained (eg. 1+2+3+4+5=15/5=3) Submitted this completed document to Webcourses. 4. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. C. e. Calculate the average wait time of the processes. Time Table Gantt Chart Process ID Time Process ID 0 1 2 3 4 5 6 Process ID 1 # Average turn around time = Average waiting time = 2/3 2 3 4 456 5 6 Arrival Time Burst Time 7 9 10 7 5 8 21 Exit Time at # 51950 3 Turn Around Time # # I Waiting Time # #
Transcribed Image Text:1. Complete requested data for each scheduling algorithm. 2. Average tum around time must be fully explained (e.g. 1+2+3+4+5=15/5 = 3) 3. Average wait time must be fully explained (eg. 1+2+3+4+5=15/5=3) Submitted this completed document to Webcourses. 4. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. C. e. Calculate the average wait time of the processes. Time Table Gantt Chart Process ID Time Process ID 0 1 2 3 4 5 6 Process ID 1 # Average turn around time = Average waiting time = 2/3 2 3 4 456 5 6 Arrival Time Burst Time 7 9 10 7 5 8 21 Exit Time at # 51950 3 Turn Around Time # # I Waiting Time # #
Expert Solution
Step 1

FCFS scheduling:

  • process which arrives first in ready queue is firstly assigned the CPU
  • in the case of tie, process with smaller process id is executed first
  • it is always the non-preemptive in nature

 

 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Analysis of Performance Measurement
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS