**Question 1 **

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

Process | Arrival Time | Priority | Burst Time |

0 | 3 | 10 | |

1 | 1 | 1 | |

2 | 2 | 2 | |

4 | 1 | 3 | |

8 | 4 | 4 |

The processes are assumed to be arrived in the order, , , ,

that illustrate the execution for these processes using the following scheduling algorithms:__Draw Gantt charts__- FCFS
- SJF (Preemptive and Non-Preemptive)

- SRTN (Preemptive and Non-Preemptive)

- Priority (Preemptive and Non-Preemptive)
- RR (quantum = 1)

- What is the
of each process for each of the scheduling algorithms in part(a)?__turn-around time__

- FCFS<< P
_{1}=X_{, }P_{2}=X, P_{3}=X ……>> - SJF (Preemptive and Non-Preemptive)<<Preemptive: P
_{1}=X_{, }P_{2}=X, P_{3}=X ……, Non-Preemptive: P_{1}=X_{, }P_{2}=X, P_{3}=X……. >>

- SRTN (Preemptive and Non-Preemptive)<< Preemptive: P
_{1}=X_{, }P_{2}=X, P_{3}=X ……, Non-Preemptive: P_{1}=X_{, }P_{2}=X, P_{3}=X……. >>

- Priority (Preemptive and Non-Preemptive)<< Preemptive: P
_{1}=X_{, }P_{2}=X, P_{3}=X ……, Non-Preemptive: P_{1}=X_{, }P_{2}=X, P_{3}=X……. >> - RR (quantum = 1)

- What is the
of each process for each of the scheduling algorithms in part(a)?__waiting time__ - FCFS << P
_{1}=X_{, }P_{2}=X, P_{3}=X ……>> - SJF (Preemptive and Non-Preemptive) << Preemptive: P
_{1}=X_{, }P_{2}=X, P_{3}=X ……, Non-Preemptive: P_{1}=X_{, }P_{2}=X, P_{3}=X……. >>

- SRTN (Preemptive and Non-Preemptive) << Preemptive: P
_{1}=X_{, }P_{2}=X, P_{3}=X ……, Non-Preemptive: P_{1}=X_{, }P_{2}=X, P_{3}=X……. >>

- Priority (Preemptive and Non-Preemptive) << Preemptive: P
_{1}=X_{, }P_{2}=X, P_{3}=X ……, Non-Preemptive: P_{1}=X_{, }P_{2}=X, P_{3}=X……. >> - RR (quantum = 1)

- Which of these algorithms results in the minimum average waiting time?

__Note: To show calculation.__

__Note: To show calculation.__

- FCFS
- SJF (Preemptive and Non-Preemptive)

- SRTN (Preemptive and Non-Preemptive)

- Priority (Preemptive and Non-Preemptive)
- RR (quantum = 1)

**Question 2 **

Research on the Web regarding the scheduling mechanisms provided by the ** Windows XP and Linux operating systems**. Consolidate

__your findings into an essay of 1000 to 1300 words.__

__Note:__

__Note:__

- The answer to the second question must be in
.__an essay format divided into paragraphs__ - Provide
.__reference listing in IEEE reference format__ - Refer to “Operating System Concepts – 9th Edition”(Attached) for Question2

**Getting ****Custom Writing Service ****with any of your academic assignments is easy. Simply ****click here****.**

Originally posted 2017-08-16 16:15:59.

## Leave a Reply Cancel reply