A computer has two processors, π1 and π2. Four processes π1, π2, π3, π4β¦
GATE Β· 2025 Β· CS Β· Set 1 Β· Computer Science & IT
A computer has two processors, π1 and π2. Four processes π1, π2, π3, π4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and these are the only processes in the system. The scheduler uses non-preemptive priority scheduling, with priorities decided as follows:
β’ π1 uses priority of execution for the processes as, π1 > π3 > π2 > π4, i.e., π1 and π4 have highest and lowest priorities, respectively.Β
β’ π2 uses priority of execution for the processes as, π2 > π3 > π4 > π1, i.e., π2 and π1 have highest and lowest priorities, respectively.Β
A process ππ is scheduled to a processor ππ, if the processor is free and no other process ππ is waiting with higher priority. At any given point of time, a process can be allocated to any one of the free processors without violating the execution priority rules. Ignore the context switch time. What will be the average waiting time of the processes in milliseconds?
- A.
9.00
- B.
8.75
- C.
6.50
- D.
7.50
Attempted by 256 students.
Show answer
Correct answer: A
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2