Consider a variant of the RR scheduling algorithm where the entries in the ready queue are pointers

Question:

Consider a variant of the RR scheduling algorithm where the entries in the ready queue are pointers to the PCBs.
a. What would be the effect of putting two pointers to the same process in the ready queue?
b. What would be the major advantages and disadvantages of this scheme?
c. How would you modify the basic RR algorithm to achieve the same effect without the duplicate pointers?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: