1.

T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

A. rate monotonic
B. proportional share
C. earliest deadline first
D. none of the mentioned
Answer» C. earliest deadline first


Discussion

No Comment Found