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...
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...
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...
Using the non-preemptive and preemptive Priority schedulers, draw out process execution timelines for the following processes....
Using the non-preemptive and preemptive Priority schedulers, draw out process execution timelines for the following processes. Clearly indicate the wait time for each process for each scheduler.   Process Arrival Burst Priority P1 0 6 2 P2 3 2 1 P3 6 8 4 P4 9 4 5 P5 12 3 3
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
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 quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
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 quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
Problem 19-3A Source documents, journal entries, and accounts in job order costing LO P1, P2, P3...
Problem 19-3A Source documents, journal entries, and accounts in job order costing LO P1, P2, P3 [The following information applies to the questions displayed below.] Widmer Watercraft’s predetermined overhead rate for the year 2017 is 200% of direct labor. Information on the company’s production activities during May 2017 follows. Purchased raw materials on credit, $240,000. Materials requisitions record use of the following materials for the month. Job 136 $48,500 Job 137 32,500 Job 138 19,200 Job 139 22,400 Job 140...
Required information Problem 19-2A Source documents, journal entries, overhead, and financial reports LO P1, P2, P3,...
Required information Problem 19-2A Source documents, journal entries, overhead, and financial reports LO P1, P2, P3, P4 [The following information applies to the questions displayed below.] Bergamo Bay's computer system generated the following trial balance on December 31, 2017. The company’s manager knows something is wrong with the trial balance because it does not show any balance for Work in Process Inventory but does show a balance for the Factory Overhead account. In addition, the accrued factory payroll (Factory Payroll...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT