ZuoTi.Pro
Question
operation system please i need the answer now
VULTUR Using FCFS (First-Come First-Served) scheduling algorithm, find the Average waiting time for the below processes Proce
Can there be starvation in first come first serve based scheduling algorithm? Explain. TTT Arial v 3 (12pt) T. 5. 5. Path:p
18 How does Processor scheduling help us in achieving high throughput? Name the three types of Processor scheduling? TT T Ari
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

FCFS (First Come First Serve)

Process Arrive Time (AT) Service Time (ST)
p1 1 5
p2 2 6
p3 3 2
p4 4 1
p5 5 4

Sol :-6 12 14 15 ps

Formula to compute TAT and WT is given below :-

  • Turn Around Time = Completion Time – Arrival Time
  • Waiting Time = Turn Around Time – Burst Time
Process Arrive Time (AT) Service Time (ST) Complete Time (CT) Turn Around Time (TAT) Wait Time(WT)
p1 1 5 6 5 1
p2 2 6 12 10 4
p3 3 2 14 11 9
p4 4 1 15 11 10
p5 5 4 19 14 10

Average Waiting time = 1+4+9+10+10 = 34/5 = 6.8

There is no starvation in FCFS because this scheduling algorithm is scheduling on the bases they arrive in the queue hence no process will be fall into starvation.

0 0
Add a comment
Know the answer?
Add Answer to:
operation system please i need the answer now VULTUR Using FCFS (First-Come First-Served) scheduling algorithm, find...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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

  • Topic Round Robin Answer the following using the First Come First Serve Scheduling Algorithm SHOW COMPLETE...

    Topic Round Robin Answer the following using the First Come First Serve Scheduling Algorithm SHOW COMPLETE SOLUTION 1. Process AT BT P1 1 10 P2 0 15 P3 2 8 P4 5 7 P5 6 5 P6 9 3 P7 8 4 P8 3 5 P9 4. 20

  • Please help me create this CLI CPU Scheduling Simulator in java: First Come First Serve (FCFS)...

    Please help me create this CLI CPU Scheduling Simulator in java: First Come First Serve (FCFS) Round Robin (RR) Process information The process information will be read from an input file. The format is: pid arrival_time burst_time All of fields are integer type where: pid is a unique numeric process ID arrival_time is the time when the task arrives in the unit of milliseconds burst_time the is the CPU time requested by a task, in the unit of milliseconds The...

  • 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...

  • a) Using the FCFS (first come, first served) decision e for sequencing the jobs, the order...

    a) Using the FCFS (first come, first served) decision e for sequencing the jobs, the order is t Richard's Machine Shop, following jobs (below) are ready for dispatching to a work center. The processing times, date job recuived, and due dales for the jobs a ranked according lo the decision rukes given below whal sequence would the jobs b Sequence Job Date Job Processing (days) Job Received D 105 122 195 20 180 120 205 25 I times d daysloday...

  • Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight...

    Implement the following 3 CPU scheduling algorithms Simulate and evaluate each with the set of eight processes below. Use any programming language. The program listing should be submitted with the report. FCFS (First Come First Serve) non-preemptive (partial results provided) SJF non-preemptive MLFQ Multilevel Feedback Queue (absolute priority in higher queues)             Queue 1 uses RR scheduling with Tq = 5             Queue 2 uses RR scheduling with Tq = 10             Queue 3 uses FCFS All processes enter first...

  • This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems...

    This assignment requires you to create simulations for different scheduling algorithms commonly employed by operating systems to achieve multiprogramming. All problems in this assignment assume the following: The simulations you will be creating are for a uniprocessor system (single CPU). Processes in these simulations will require CPU bursts of one or more time units followed by I/O bursts of one or more time units. For simplicity’s sake, when more than one process is executing its I/O burst at the same...

  • scheduling program in C, please help 1 Objectives This programming project is to simulate a few...

    scheduling program in C, please help 1 Objectives This programming project is to simulate a few CPU scheduling policies discussed in the class. You will write a C program to implement a simulator with different scheduling algorithms. The simulator selects a task to run from ready queue based on the scheduling algorithm. Since the project intends to simulate a CPU scheduler, so it does not require any actual process creation or execution. When a task is scheduled, the simulator will...

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