A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds ? 
a. q ≤ (t – ns)/ (n – 1)
b. q≥(t−ns)/(n−1)
c. q ≤ (t - ns)/ (n + 1)
d. q ≥ (t - ns)/(n + 1)
Answer:q≥(t−ns)/(n−1)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: