 |
PRACTICE NUMERICALS
Question 1
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):
The average waiting time (in milliseconds) of the process is _____ .
(a) 4.5ms
(b) 2.5ms
(c) 5.5ms
(d) 3.5ms
ANSWER:
Question 2
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is pre-emptive shortest remaining-time first. The absolute difference between the average turn around time and the waiting time and of these processes is_______ milliseconds.
(a) 7.5 , 6.25
(b) 4.5 , 5.35
(c) 5.5 , 8.25
(d) 8.5 , 3.25
ANSWER:
Question 3
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is pre-emptive shortest remaining-time first.
The average turn-around time of these processes is_______ milliseconds.
(a) 6.25
(b) 8.25
(c) 3.25
(d) 4.25
ANSWER:
Question 4
Calculate average waiting time for the following sequence of processes:
(a) 4
(b) 2
(c) 9
(d) 6
ANSWER:
Question 5
Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds. Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in msec) is ______.
