Question 31. Scheduling is done so as to :

Question 32. The strategy of making processes that are logically runnable to be temporarily suspended is called :

Question 33. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.

Question 34. There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short run-time, e.g. less than 10ms ?

Question 35. Scheduling is :

Question 36. Which of the following algorithms tends to minimize the process flow time ?