in Operating System retagged by
1,173 views
0 votes
0 votes

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

  1. This algorithm is equivalent to the first come first serve algorithm.
  2. This algorithm is equivalent to the round-robin algorithm.
  3. This algorithm is equivalent to the shortest-job-first algorithm.
  4. This algorithm is equivalent to the shortest-remaining time-first algorithm.
in Operating System retagged by
by
1.2k views

1 comment

1
1

2 Answers

1 vote
1 vote

Answer is option B.Why?

Given algorithm is : After every 'T' time units, processes are given priority w.r.t. waiting time. 

lets analyse each option :

(a) not possible. as in FCFS there is no time quantum.

(C) not possible.. SJF is different. It is not preemptive.

(D) In SRTF although a process with shortest burst time is picked. But here priority is assigned based on Burst Time of a process.  

The requirement of scheduling algorithm is priority should be assigned based on Waiting Time of a process.   Hence this is not the answer.

B is correct.

Ref: https://gateoverflow.in/1419/gate2013-10

0 votes
0 votes
ANS :  B This algorithm is equivalent to the round-robin algorithm.
by
Answer:

Related questions