Question: Question 3 (15 points) Three jobs are in the queue. The number of tickets each has and the number of seconds of processing time each

Question 3 (15 points) Three jobs are in the queue. The number of tickets each has and the number of seconds of processing time each requires are shown in Table 2. Assume that quanta of CPU time are sufficiently small, and that no other processes get any tickets before the last of these processes complete. For the following questions, please circle the correct answer from the candidate list Using lottery scheduling algorithm, Table 2 turnaround time for Job 1 is Job #Tickets CPU time (a) 20 (b) 25 (c) 30 (d) 35 1 30 10 turnaround time for Job 2 is 2 30 15 (a) 20 (6) 25 (c) 30 (d) 35 3 40 turnaround time for Job 3 is (a) 20 (6) 25 30 (d) 35 Fig.3 average turnaround time is 20 (6) 25 30 (d) 35 3 10 C)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
