PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2022 paper

Module 2: Processes & Scheduling

20227m

Consider the following CPU processes with arrival times 0 and CPU bursts (in milliseconds) as given below:

Process Burst time
P1 24
P2 3
P3 3

If the Round Robin Scheduling is used with time quantum of 4 milliseconds to schedule the processes. Draw the Gantt chart and calculate the average waiting time across all processes (in milliseconds).

Search GoogleAsk AI
Worked SolutionAI Assisted

RR quantum 4, P1=24,P2=3,P3=3 arrival 0

Gantt: P1 0-4, P2 4-7, P3 7-10, P1 10-14, P1 14-18, P1 18-22, P1 22-24, P1 24-28? Actually P1 needs 6 quanta: 0-4(20 rem),4-7 P2 done,7-10 P3 done,10-14 P1(16),14-18(12),18-22(8),22-26(4),26-30(0). WT: P1 =30-24=6? Wait TAT P1 30, WT 6, P2 WT 4, P3 WT 7 => Avg WT ~5.67. Detailed diagram shows RR fairness.

Similar questions

Operating SystemConsider the following four processes with following details (time given in ms): | Process | Arrival Time | CPU Burst Time | | :--- | :---: | :---: | | P1 | 0 | 12 | | P2 | 0 | 10 | | P3 | 1 | 4 | | P4 | 4 | 10 | | P5 | 2 | 12 | Draw the Gantt chart using RR scheduling with time slice 3ms. Calculate average waiting time and average turn-around time.20237mOPERATING SYSTEMAssume the following workload in a system: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P0 | 1 | 3 | | P1 | 0 | 6 | | P2 | 3 | 2 | | P3 | 4 | 7 | | P4 | 2 | 8 | | P5 | 6 | 5 | Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum=3 : (i) Average Turn Around Time (ii) Average Waiting Time20247mOperating SystemConsider the following set of processes with the length of the CPU burst given in milliseconds: | Process | Burst Time | Priority | | :---: | :---: | :---: | | A | 10 | 3 | | B | 1 | 1 | | C | 2 | 3 | | D | 1 | 4 | | E | 5 | 2 | The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20257mOperating SystemConsider the following set of processes with the length of the CPU Burst given in milliseconds: | Process | Burst Time | Priority | | :--- | :--- | :--- | | A | 10 | 3 | | B | 1 | 1 | | C | 2 | 3 | | D | 1 | 4 | | E | 5 | 2 | The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of FCFS and SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20247m
PreviousExplain process state transition diagram of an operating system.NextWrite necessary conditions that must hold simultaneously to arise deadlock situation. Briefly explain different deadlock handling mechanisms.
Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play