Question

**Operating System** FCFS Example Processes arrived in the order of P2,P3,P1. Process Burst Time P1 24...

**Operating System**

FCFS Example

Processes arrived in the order of P2,P3,P1.

Process

Burst Time

P1

24

P2

3

P3

3

Calculate the waiting times for P1, P2, and P3

Draw the Gantt Chart and calculate the average waiting time.

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Solution:

Explanation:

=>FCFS stands for first come first serve.

=>In FCFS the job which comes first is served first and the job which comes at the last is served at the last.

=>Hence on the basis of above calculations waiting times of P1, P2 and P3 are 6 units, 0 units and 3 units.

=>Average waiting time = 3 units

I have explained each and every part with the help of statements as well as image attached to the answer above.

0 0
Know the answer?
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
Similar Questions
**Operating System** Preemptive SJF The newly arrived process with shorter CPU burst will preempt the currently...
**Operating System** Preemptive SJF The newly arrived process with shorter CPU burst will preempt the currently executing process. Process Arrival Time Burst Time P1 3 8 P2 2 4 P3 1 9 P4 0 5 Draw the Gantt Chart and calculate the average waiting time.
Process Burst Time Priority Arrival p1 8 15 0 p2 3 20 0 p3 4 20...
Process Burst Time Priority Arrival p1 8 15 0 p2 3 20 0 p3 4 20 20 p4 4 20 25 p5 5 5 45 p6 5 15 55 The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time...
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: Process            Burst Time Priority P1                               5 4 P2                               3 1 P3                               1 2 P4                               7 2 P5                               4 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. If nonpreemptive priority (a larger priority number implies a higher priority) is used, what is the average waiting time of...
A set of processes along with their burst time in milliseconds is given below. The processes...
A set of processes along with their burst time in milliseconds is given below. The processes should execute in First Come First Served order. Assume that the quantum (q) is 3: Process Burst Time P1 22 P2 4 P3 12 P4 15 P5 2 Find the average waiting time using the Round Robin algorithm. Round your answer to 2 decimal places
What is the average waiting time for Processes If the Operating System uses the Priority Scheduling...
What is the average waiting time for Processes If the Operating System uses the Priority Scheduling (PS) Scheduling Algorithm? (P1=20 ms, P2=15 ms, P3=10 ms, P4=5 ms) Priority Order: P1, P4, P3, P2
There are FIVE processesing station in a prodcution system: P1, P2, P3, P4 and P5. The...
There are FIVE processesing station in a prodcution system: P1, P2, P3, P4 and P5. The times taken at each process are as follows 2 minutes, 6 minutes, 4 minutes, 9.4 and 13 minutes. Job request inflow rate is 16 per hour and jobs requests are accepted for six hours only. The systems closes after all accepted jobs have been completed, that is at the closing there are no unfinished jobs in the system. The system capacity =   /hour The...
1. What is the average waiting time for Processes If the Operating System uses the Shortest-Job-First...
1. What is the average waiting time for Processes If the Operating System uses the Shortest-Job-First (SJF) Scheduling Algorithm? (P1=5 ms, P2=10 ms, P3=15 ms) 2. How many page faults occur in the Optimum Page Replacement algorithm (OPR) with the following reference string for three-page frames?    Reference String: 4,2,1,3,2,3,4,1 3. What is the average waiting time for Processes If the Operating System uses Shortest-Job-Remaining-First (SJRF) Scheduling Algorithm? (P1=5 ms, P2=10 ms, P3=15 ms) Arrival Time ( P1=0 ms, P2=5...
The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. (20 Marks) Process    ...
The following processes are being scheduled using a preemptive, round-robin scheduling algorithm. Process     Priority Burst Time Arrival P1 40 20 0 P2 30 25 25 P3 30 15 30 P4 35 10 60 P5 5 10 100 P6 10 10 105 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task (which consumes no CPU resources and is identified...
Problem 6 The following tables show the timing for processes using two different scheduling algorithms based...
Problem 6 The following tables show the timing for processes using two different scheduling algorithms based on the table of process arrival times and burst times (All ties were resolved using the arrival time). Using this information: Calculate the average turnaround time for each algorithm. Show your work. Name the scheduling algorithm used to generate the timing tables. Process Arrival Time Burst Time P1 0 4 P2 3.9 1 P3 2.9 3 P4 0.9 2 P5 1.9 4 Mystery Algorithm...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst Arrival P 1 8 15 0 P 2 3 20 0 P 3 4 20 20 P 4 4 20 25 P 5 5 545 P 6 5 15 55 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highestpriority process. For processes with the same priority, a round-robin scheduler will be...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT