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 TableGantt ChartProcess IDTimeProcess ID0123456Process ID1#Average turn around time =Average waiting time =2/323445656Arrival Time Burst Time791075821Exit Timeat#519503Turn Around Time##IWaiting Time##

FCFS scheduling: process which arrives first in ready queue is firstly assigned the CPU in the case…

Answered: 1. Complete requested data for each…

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

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
#
#

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

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions