Question

Answer ALL Questions 1. For the processes listed in Table 1, draw a chart illustrating their execution using: a. First Come F
1 0
Add a comment Improve this question Transcribed image text
Answer #1

Turn around time = Finish time - Arrival time .

Waiting Time= Turn around time - Burst time.

Finish time is determined from the chart .

For the question 1)

part A) FCFS :

In fcfs , the processes are executed in the order of their arrival. If the process enters into execution phase , it completes its execution .

the image attached shows the gantt chart and average turnaround time and average waiting time.

Please Note: the image contains average turnaround time and average waiting time.

PILI detecte Perovery from Suchessor and (a) first come first serve (FCFS) u Turn Around W aiting Process Arrival Baust Time

Part B) Shortest Job first.

Shortest job first can be considered as a non preemptive job scheduling as there is no context switching .

In this , the job with shortest burst time is served first and completes executes.

Now the image attached shows the chart as well as average turnaround time and average waiting time.

Please Note: the image contains average turnaround time and average waiting time.

Locommunication OS m Communicatie Shortest Job Fir STF) Process | Arrival Time Burst ! Finish Time Time 44 4 715 Turn Around

Part c) Shortest remaining time first .

In this , context switching is allowed in this method .

It is similar to Shortest job first as the one with shortest burst time is served but switching is allowed in between the processes.

Now the image attached shows the chart as well as average turnaround time and average waiting time.

Please Note: the image contains average turnaround time and average waiting time.

(3) Shortest Remaining time in Process / Arrival (Burst / Finish / Turn Around I waiting Time Time Time ume TAT) - AFT-AT = T

Part D) Round Robin scheduling .

In the round robin method , we give each process a slot of time and then the queue is shifted to next process.

By doing this , we can prevent the processes from starvation.

Now the image attached shows the chart as well as average turnaround time and average waiting time.

Please Note: the image contains average turnaround time and average waiting time.

d Round Robin Arrival / Burst Time Time finish Process quantom - 2) Turn Around Waiting Time Time LAT-AT) (TAT-BT) Time Time

Part E) Round robin

This part is same as the above but with time quantom = 1.

Now the image attached shows the chart as well as average turnaround time and average waiting time.

Please Note: the image contains average turnaround time and average waiting time.

(e) Round Robin (Time quantom Process) Arrival / Burst I finish! Turn Around Time Time Time time CET-AT) waiting I Time ICTAT

Thank you.

I hope i was able to provide you the desired answer.

if you have any queries please be comfortable to ask in the comments i will be glad to help.

:)

Add a comment
Know the answer?
Add Answer to:
Answer ALL Questions 1. For the processes listed in Table 1, draw a chart illustrating their...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Given the following set of processes with corresponding execution times (in ms), arrival times and priority...

    Given the following set of processes with corresponding execution times (in ms), arrival times and priority (1 – highest).  For each scheduling algorithm: Construct a table showing which process is active and for how long until all processes are completely serviced (as done in class). Calculate the average waiting time and turnaround time. Process ID Burst (ms) Arrival time P1 9 0 P2 12 0 P3 3 0 P4 30 0 P5 20 0 P6 10 0 First Come First Serve...

  • Operating Siytem Concepts Homework No. 1 Variant No. 1 Student Cristian Anchei Paraschine (academic group, name,...

    Operating Siytem Concepts Homework No. 1 Variant No. 1 Student Cristian Anchei Paraschine (academic group, name, surname) I got the task.... (date, signature) Homework Submission Date: November 6th, 2019 Assignment: Consider the following set of processes, with the length of the CPU burst time given in milliseconds!: Process CPU burst time, ms Arrival time, ms Priority P 2 2 2 7 Ps 3 3 Draw a Gantt chart that illustrates process scheduling for these algorithms: a) First Come - First...

  • Assume that the three processes arrived in order: Processes                            CPU Burst Time P1  &n

    Assume that the three processes arrived in order: Processes                            CPU Burst Time P1                                           17 P2                                            6 P3                                            8 a.     Please draw the Gantt chart if FCFS scheduling is used. b.    Please calculate the average waiting time and average completion time under FCFS. You MUST show the calculation procedure. c.      Please draw the Gantt chart if Round Robin is used. d.    Please calculate the average waiting time and completion time under RR with q = 3. You MUST show the calculation...

  • 4. Consider a ready queue with four processes :- Process Arrival Time Burst Time (ms) P1...

    4. Consider a ready queue with four processes :- Process Arrival Time Burst Time (ms) P1 Priority P2 P3 P4 P5 For each of the following CPU scheduling algorithms, determine the turnaround and average waiting time for each of the process :- a. Shortest remaining Time First b. Shortest Job First C. Priority Scheduling (Both pre-emptive and non-preemptive) d. Round Robin (quantum is 1 ms)

  • Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

    Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:Processburst TimePriorityP1103P211P323P414P552For each of the scheduling algorithms, FCFS, Shortest-Job-First (SJF, non-preemptive), Priority (smaller priority number implies higher scheduling priority), and RR (quantum = 1) do the following.Draw a Gantt chart to show how these processes would be scheduled.Give the turnaround time (total time from the first arrival into ready state until CPU-burst is completed) of each process.Give the waiting time (total time spent in the Ready state) of each process.Give...

  • From the Gantt chart, the waiting time and the turnaround time are calculated as:

    Round Robin Schedulin ProcessBurst Time in MsP14P22P32Calculate the average waiting time and turnaround time using round robin scheduling, where the time quantum q = 2 ms According to the Round Robin algorithm, the arrival of processes is shown in the following Gantt chart. From the Gantt chart, the waiting time and the turnaround time are calculated as: Waiting time for P1= Waiting time for P2 = Waiting time for P2 = Therefore, the average waiting time = Turnaround time =

  • Practice question! Answer fast or no upvote. 4. Given the following table: Arrival Time Burst Time...

    Practice question! Answer fast or no upvote. 4. Given the following table: Arrival Time Burst Time Process P1 P2 P4 WN a) Calculate the average waiting time if shortest job first preemptive algorithm is applied. (5pts) b) Calculate the average turnaround time if round robin algorithm is applied with a time quantum of 3 units. (5pts)

  • 8. Consider the following 5 processes in the ready queue: Process Burst Priority Arrival time n...

    8. Consider the following 5 processes in the ready queue: Process Burst Priority Arrival time n w P1 P2 w N P3 P P - W WE O P4 N P5 N A O Draw Gantt charts illustrating the execution of these processes for each of the following algorithms: (a) preemptive SJF, (b) RR (with quantum = 1), (C) FCFS, and (d) preemptive priority, and calculate the respective turnaround and waiting times.

  • Please answer the following question in C++ language Consider the following set of processes, with the...

    Please answer the following question in C++ language Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process            Burst Time      Priority P1. 7 5 P2 2 4 P3 11 3 P4 9 1 P5 5 3 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive...

  • Here is a table of processes and their associated arrival and running times: Show the scheduling...

    Here is a table of processes and their associated arrival and running times: Show the scheduling order for these processes under First-Come-First-Served (FCFS), Shortest-Job First (SJF), and Round-Robin (RR) with a quantum = 1 time unit. Assume that the context switch overhead is 0 and new processes are added to the head of the queue (i.e. next in line for scheduling) except for FCFS. In the table, use notation such as P1, P2, etc.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT