Question: Consider N processes sharing the CPU in a round-robin fashion (N>2). Assume that each context switch takes S m sec and that each time quantum is Q msec.

For simplicity, assume that processes never block on any event and simply switch between the CPU and the ready queue.

Problem 1: What is the maximum consecutive period of time any process remains in the ready queue (the max waiting time) expressed in terms of N,S,Q?

Problem 2: Now let N=3, Q= 10, with process Pi requiring Ti ms of CPU process time, where i = 0,1,2. Give that T1=6, T2=9, T3 = 12.

-  What is the average waiting time? (all units are m sec)

Answer this question using round-robin algorithm and show each and every step with example.