Operating SystemTU Board 2025
Consider the following set of processes, with the length of the CPU burst given in milliseconds: ProcessArrival TimeBurst TimePriorityP1062P2121P3332P4623 a) Draw Gantt charts showing the execution…
10Consider the following set of processes, with the length of the CPU burst given in milliseconds: ProcessArrival TimeBurst TimePriorityP1062P2121P3332P4623 a) Draw Gantt charts showing the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2ms). b) Compute average waiting time and average turnaround time for each of these scheduling algorithms mentioned above. c) What will happen if the quantum size is too large or too small in RR scheduling algorithm?
A worked answer is on its wayMeanwhile, read the Operating System notes for this topic.
Discussion
Loading…
More Operating System questions
What is a monolithic kernel? How is it different from microkernel? Explain. [1+4]TU Board 20265What is multithreading? Explain different types of threads. [1+4]TU Board 20265Explain the different process states in detail. [5]TU Board 20265What are the necessary conditions for the deadlock? How deadlock is different from starvation? [4+1]TU Board 20265What is segmentation? How can it be used for the memory management? [1+4]TU Board 20265What are different page replacement algorithms? Explain. [5]TU Board 20265